There were no difficult questions. Descriptive questions: the difference between arrays and linked lists, how to insert into an array and a linked list, how to remove from an array and linked list. He also asked me questions about quick sort vs. merge sort, Big O, and another algorithms question -- which I could not answer, because I had not taken the course. Coding exercise: build a Binary Tree (not BST) and implement a getDepth() method that returns the depth of the tree.
2 sum.
find if two linked lists join each others or not and if yes where is the intersection point.
question which was to remove the nth node from end of the linked list.
Sobre tu curriculum y preguntas sobre ti no tecnicas
Where is the most shear force and moment on a cantilever beam located?
What are the four concepts of java?
Please tell us about yourself
Why would you be a good fit for Arup?
when two computers want to communicate with each other, how do they verify that the computer's name is valid?
Viewing 871 - 880 interview questions