In place, move the duplicates in an array to the end. [Hint: first define duplicate. Ex. 02155530. Move 55 to end, OR 55 and 55, resulting in moving 555 to end.]
Software Development Engineer In Test Sdet Interview Questions
3,708 software development engineer in test sdet interview questions shared by candidates
no difficlt question.. all they want to test is your knowledge and grasp.. the questions i was asked were: 1. given a data structure .one node with 2 pointers.. determine whether it is a doubly linked list , tree or nothing 2. design an atoi function 3. implement stack using 2 queues 4. telll me about your project 5. basic os questions
Stack to queue
a huge matrix with 1 and 0, block the block of 1. elements could be "connected" by left, right, up or down side; but no diagonal. my answer, scan one by one, after getting the first 1, use stack walking to all neighour 1 and change them into 0, count++ then the interview asked how to make it parallel, ...
He asked me how to reverse a string in C. I was a bit rusty, and the answer he was looking for was to iterate over the length of the string store one character in a temporary character, then store the end of the array in the new location. char<-str[i] str[i++]<-str[end] str[end--]<-char Something like that in pseudocode.
Given a Binary Tree (not Search Tree) , find the lowest common ancestor.
In your opinion what do you consider "good" code?
BFS
Nothing specific.
How would you design a calculator for second graders?
Viewing 3581 - 3590 interview questions