how to check if a tree is balanced on o(nlogn)
Student Developer Interview Questions
970 student developer interview questions shared by candidates
1. sum of all palindrome numbers of 5 digits. 2.valis palindrome
1-you are given two lists find the first node at which they collide 2-implement a stack data structure (only takes int and has a max size) 3-if you have a string that contains () {} [] .. check if its balanced 4-implement a stack with get_min o(1) you can use additional space 5- given a binary search tree and a number a find the rank of a
I was asked to Implement the strtok function
Describing what a given code do
What do you know about OOP?
What are some of your favorite games and why?
Why did you apply to work at the LEGO Group?
What is your biggest weakness?
What do you know about Docker?
Viewing 621 - 630 interview questions