Given the root node of a tree, write two Java programs to visit all nodes of the tree, one in a depth-first fashion and the other in a breadth-first fashion, both without using recursion. Assume a node is represented by a class named Node, which has a method children() that returns a list of child nodes. Call node.visit() to visit a node.
"What do you want to do with data?" ??? what kind of interview question is that
what is the process of kodiak tool.
Nothing specific I can say, but lots of questions related to the position as well as questions you would be able to answer after taking a data structures course.
Write a enqueue and dequeue using linked lists, resolve deadlock on it etc
What are the 4 pillars of Object-Oriented Programming and can you explain them?
None very straight forward
I had to sign an NDA.
They asked me to create a square root function.
Given a integer, which is the length of a string containing numbers, give a complete permutation of strictly increasing numbers.
Viewing 541 - 550 interview questions