Write a recursive function to determine prime number
Ingeniero De Software Interview Questions
Ingeniero De Software Interview Questions
Los ingenieros de software se encargan de diseñar y desarrollar software informático. Las entrevistas serán muy técnicas, así que debes prepararte para resolver problemas de código y desafíos matemáticos. Las preguntas concretas que te planteen dependerán del tipo de puesto de programación al que aspires. Intenta buscar una disciplina de software concreta, como desarrollo web, desarrollo de aplicaciones o desarrollo de sistemas.
Preguntas de entrevista más frecuentes para ingeniero/a de software y cómo responderlas
Pregunta n.º 1: ¿Cómo describirías tu proceso de programación?
Pregunta n.º 2: ¿Qué lenguajes de programación conoces y prefieres?
Pregunta n.º 3: Comenta algún proyecto que hayas completado con éxito.
665,526 ingeniero de software interview questions shared by candidates
How to remove a node from a singly-linked list when only given the pointer to the node
Find max k elements among mostly sorted list.
Was asked how I would implement division without using division or mod operators. The answer should return in the form quotient r remainder.
Given 2 numbers x and y, check if x is an integer power of y. For instance, x = 8, y = 2 would return true and x = 10 and y = 2 would return false since the first one is an integer power but the second isn't.
How to reverse a number, e.g. 1234.
Given heads of two linked lists. Find if the two linked lists intersect. Solution should not use extra memory.
Print a singly-linked list backwards, in constant space and linear time.
Given nested arrays, write an enumerator class such that next() returns the elements in sequential order, e.g.: [1,[4,3],6,[5,[1,0]]] -> 1, 4, 3, 6, 5, 1, 0 also implement allObjects for this class
Mark likes to listen to music while travelling. His iPod™ contains N songs and he wants to listen to L (not necessarily different) songs during a trip. So he creates a playlist such that: • Every song is played at least once. • A song can be played again only if at least K other songs have been played Mark wants to know how many different playlists are possible. Can you help Mark determine this number? As the number can be very large, display number modulo 1,000,000,007. You are given N, K and L.
Viewing 211 - 220 interview questions