One of the difficult question was about solving a puzzle with good algorithm and coding it up as well. I don't recall the puzzle's name now, but the solution involved using linked list (circular), and writing some classes and methods. In the end, testing was also required for this solution.
Create a copy of a singly-linked list. Each node has a value and a next pointer, but also has a pointer to a random node: It can be null, or point to any other node in the list. The solution must take O(n) time and use O(1) space.
Be careful when you use str.Split(' '); because it may generate empty strings.
The algorithum question
Difference between calloc() and malloc() synopsys-rd-interview-questions 0 of 0 votes 13 Answers What are the differences between new (in C++) & malloc (in).
Well, I try to use non-recursive method to generate the permutations of a given string, but I forget that I only have 10min to write the code.
c) WAP to Print last n lines of a big log file.
Technical questions are very difficult, but if you are well prepared on the requirement of the job position you will answer to most of them. Programming excersice are very difficul and challenging.
Tell me about a project you have worked on and any problems you faced
Question on binary trees and test cases
Viewing 1261 - 1270 interview questions