How to remove a node from a singly-linked list when only given the pointer to the node
Desarrollador Web Interview Questions
Desarrollador Web Interview Questions
Las entrevistas para el puesto de desarrollador web suelen centrarse en las preguntas técnicas. Puedes esperar que te hagan preguntas para evaluar tu conocimiento de los principales lenguajes de programación, como JavaScript y CSS, y de las funciones web generales, o para conocer tu experiencia de diseño en servicios web como REST y SOAP. Como desarrollador, es probable que te pidan ejemplos de sitios web o proyectos anteriores.
Preguntas de entrevista más frecuentes para desarrollador/a web y cómo responderlas
Pregunta n.º 1: ¿Podrías describir los lenguajes de programación y servicios web más populares?
Pregunta n.º 2: ¿Cómo te describirían los jefes de proyecto y otros desarrolladores web?
Pregunta n.º 3: ¿Cómo sueles resolver los problemas de código?
711,452 desarrollador web interview questions shared by candidates
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.
If you have a file containing millions of integers, how would you sort the data in the file using extremely limited resources, such a s 1GB of memory?
Viewing 251 - 260 interview questions