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.
Im not going to give away their brainteaser questions, but writing your own version of battleship in psuedo code was challenging.
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
Tell me some CS projects you have worked on before.
If you could choose one candidate to take this internship position over you, who would it be and why?
How would I design a system that could detect fraudulent credit card purchases of alcohol, with the only source being credit card transaction history?
What are the 4 pillars of Object-Oriented Programming and can you explain them?
O que me atraiu para a vaga.
Given a list of strings, remove the words that are an anagram of the previous ocurring words.
Viewing 691 - 700 interview questions