Hardest question was how to sort a linked list using recursion only. I knew the iterative solution but couldn't come up with recursion. Very difficult.
Development Engineer Interview Questions
37,105 development engineer interview questions shared by candidates
You are given two buckets. One holds 3 gallons and the other holds 5 gallons. Have do you make 4 gallons of water?
how much memory is int[3000][3000] in bytes and then in MB's. should this size of memory be allocated or static?
Walk me through your resume. Tell me about a time you had to overcome an obstacle. How would you check if two strings are anagrams.
Clone a linked list that has a cycle (do not fix the cycle). Is there a way to uniquely identify a node without relying on a hash code?
Program to check if a "ransom note", has been taken from a particular news paper article. Which meant you were given two arrays of strings, and you had to check if the first array, could have been constructed from the second set
Graph Coloring problem: given a connected graph, color each node in the graph such that no two adjacent nodes have the same color.
implement atoi
Write a function that checks if a number's divisors sum up to that number, i.e. whether it's a perfect number or not.
Consider two arrays of integers, v1 and v2, with allocate memory of (n+m)*sizeof(int) and m*sizeof(int), respectively; In array v1, you have the first n positions filled with integers, sorted in ascendent order. In array v2, you have all m positions filled with integers, also sorted in ascendent order. Write/implement a function that return a vector of size (n+m)*sizeof(int) that have all the elements of v1 and v2, sorted in an ascendent order
Viewing 561 - 570 interview questions