Implement a queue class.
Desenvolvedor Interview Questions
102,665 desenvolvedor interview questions shared by candidates
The chessboard problem. I first mentioned BFS and use of a Queue but the interviewer kept asking about some data structure with less memory that I could extract due to the simple structure of the graph. I did not understand what he meant. I eventually mentioned DFS and proved it works uses less memory. The cache problem took a long time. I kind of though I failed it at some point. I had no prior knowledge of the topic since I am not a CS guy. I eventually, used an array to store the access time to different items and O(n) search through it to find the least frequently used one. The interviewer did not raise the complexity. He wanted me to write code on a paper (which is hard, esp. in C).
Copy a block of memory from source to destination. You need to consider the overlapping cases. Yet I don't think copy from behind will solve the problem. Because the memory may overlap at the beginning. So a pre-check of overlapping region is necessary. In my view, for a typical copy operation the source should not be overwritten, but the answer allows for that. I was pretty confused...
How is the macro function interpreted during compilation
"You are city director and you want to build a water tower for your city, what do you do?".
Reverse a string in place and also remove spaces, so for example "Software Eng " would become "tfoSgnE"
There are one hundred closed lockers in a hallway. A man begins by opening all one hundred lockers. Next, he closes every second locker. Then he goes to every third locker and closes it if it is open or opens it if it is closed (e.g., he toggles every third locker). After his one hundredth pass in the hallway, in which he toggles only locker number one hundred, how many lockers are open?
Given a list of strings, determine if there are any anagrams. What is the running time of your algorithm?
how will you find a circular link list which has a loop in it.
Classic one from them: You have an array and you want to find the first non-repeating element.
Viewing 841 - 850 interview questions