Find the maximal and minimal number in an array of integers
Ingegneria Interview Questions
375,191 ingegneria interview questions shared by candidates
A task in which I was required to print all numbers between 1 and a million - with no repeating digits - Easy enough! Just can throw you off guard a bit
Define binary search tree. Develop a procedure to verify a binary search tree.
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 :)
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 351 - 360 interview questions