Merge 2 sorted arrays A and B Result should end up in B, which has available space for all items Utilize the space in B, not using temporary arrays Result in sorted array in B A { 2, 5, 8, 12, 15} B { 3, 5, 7, 9, , , , , , }
Development Engineer Interview Questions
37,123 development engineer interview questions shared by candidates
You have two intersecting linked lists. Describe a function that returns a pointer to the node where they intersect.
sort an array N consists of four numbers, each number can be repeated k times, where k < n. Example: sort 1111144422223 to 1111122223444. Try to be as efficient as you can, not just O(n^2)
How would you sort an array if you had infinite RAM? Infinite memory?
Given a database, where we know some portion of data (e.g. say 20%) is accessed more than the other portion of the database by the client. We have a frontend that client requests data from. Design a data structure that will increase the efficiency of access of objects. And we know that we can only hold on to n elements in memory.
The challenge was comprised of two tasks; one code challenge and one puzzle.
On ado.net and asp.net they interviewed and programs
Find the intersection of two linked lists. Follow up: if the linked lists are doubly-linked lists.
If you have eight objects that all weigh the same except for one (which is heavier) and a two-sided scale, what is the minimal number of times you can use the scale to determine the odd item out?
What happens when you type www.google.com in your browser?
Viewing 271 - 280 interview questions