Code to find a missing number in an array
Test Specialist Interview Questions
43,269 test specialist interview questions shared by candidates
Given a string, konylabsinterview write a program to return bool if a given pattern matches.pattern example - kon*lab*terview*
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.
Difficult to answer in short and first time attempt.
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.
You have seven stones and a weighing scale. Six of the stones are equal in weight and one is lighter. How will you figure out which one is lighter ? Minimum tries required to do so ?
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.
there is a 5 lit can,3 lit can if i want 4 lit how will u give me?
Onsite Interview 2 a): check whether a number is the power of 2 b) Skyline silhouette puzzle . c) Discussion on uses of hash-tables and trees ? d) Few general questions on Work and academic background .
Viewing 51 - 60 interview questions