Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from root node down to the nearest leaf node.
Senior Software Engineer Test Interview Questions
67,470 senior software engineer test interview questions shared by candidates
Write a list class where the only data structure available is a stack
General questions on Object oriented programming, and creating an OOP scenario in a programming language of my preference. Followed by a question asking me to describe any challenging technical situation and it's resolution (in my career).
Write an app that calculates a number of identical strings in a list
do you have a degree
Code 1 and 2 Write a ratelimiter, and calculate the size of the files on a system, basically do a calculation on a list of a list, and sort a list
Build a to do list
Build a task list using vanilla javascript
Visit all the nodes of a binary search tree level by level.
a[5] = [10,12,3,4,15] int* const exp1 = &a; int const* exp2 = &a; for ( int i=0; i<5; i++) { print("Value %d", *exp1++); print("Value %d", *exp2++); } what will be the output?
Viewing 441 - 450 interview questions