Define binary search tree. Develop a procedure to verify a binary search tree.
Programador Cientifico Interview Questions
710,927 programador cientifico interview questions shared by candidates
There were 2 questions: 1 design and 1 implementation. The design was something like the following: you have a billion google searches a day, design a data structure which lets you pull out the top 100 unique ones at the end of the day.
1. mutable, non mutable classes in Java 2. declaring constants in Java 3. x^y algorithm and its optimization. 4. second largest number from Binary Tree
Find the number of ways to get from one corner of a grid to the opposite corner, by going down or right only.
Check if a string is balanced
After Round 2 I Asked Interviewer How he would Solution for Above mentioned Q1 & Q2 questions of the Round 2 Technical Interview. Very Smartly Interviewer Did not take any effort to answer and also told me find it out by myself :)
Implement clearbit(int n, int p) function, p is the position of the bit to be cleared. Example : n is 13, p is 0. Binary representation of n : 1101. You need to clear the pth postion, means 0th position bit needs to be cleared.
Write a function to obtain a string with the binary representation of an integer
you have array with n elements. How would you do circular shift of k positions? Time and space complexity?
Write code to generate all possible case combinations of a given lower-cased string. (e.g. "0ab" -> ["0ab", "0aB", "0Ab", "0AB"])
Viewing 561 - 570 interview questions