Difficult to answer in short and first time attempt.
Software Development Engineer In Test Interview Questions
6,448 software development engineer in test interview questions shared by candidates
Not difficult. It is like why can not compare two strings. And how to compare one object which initialed as a string with string. The coding quesition is to find the kth in two sorted arrays.
First explain what a tree, then binary tree, then a binary search tree is. Now implement a function that verifies whether a binary tree is a valid binary search tree.
Given a binary tree, how would you set the keys/values of all the nodes and their child pointers to null. No language restriction. Do it iteratively in O(N) time with O(1) space complexity where N is the number of nodes in the tree. Other Details: - Tree is just a regular Binary Tree and doesn't have the BST property. - It is not guaranteed to be balanced. - You may do whatever you want to the tree however, you must ensure that all the nodes in the tree and their left/right pointers are set to null.
1) 6 hours problem - Walls and Guards, use triple loop as a solutions and matrix. 2) Live coding question - 3 boxes with apples, oranges and apple and oranges, famous problem.
Divide two numbers without using / or % and return quotient.
Check if tic-tac-toe has a winner
2. You have an array (size is not known) and whose elements are having the values from 0-> 99. Find out the three largest elements in that array and return those.
Implement a Queue using 2 Stacks
In a BST write a program to find 2 nodes x and y such that X+y=k
Viewing 31 - 40 interview questions