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.
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 challenge do you used to face and how to solve it
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.
None very straight forward
3 Technical Interviews consisting of standard programming questions, increasing in difficulty. The last interview was almost 2.5 hours on a single problem (Leetcode Hard question about intervals). 2 Behaviour Interviews 1 Screening Phone Call
Tell me about a previous project.
Viewing 431 - 440 interview questions