He asked the best way to store boolean values on memory. I said an array but he wanted more, so in the end I said BinaryVector class. He asked why a binary vector is a better option but I couldn't answer that. I told him that I don't know the internal implementation.
Problem solving: 1. Given a no. Find next highest no. containing same digits. 2. Given a array and a value k. Find all unique pairs that sums up to k. 3. Anagram check. 4. Given a array, i, j. Find all nos. such that j > i and array[j] > array[i]. 5. Boolean matrix problem. make all the values in a row or column as '1' if there is at least one '1' in that row or column. 6. Given a array where consecutive digits differences out to particular set of values and no. 'k'. Find the index of 'k'. Use hashing. Scripting: 1. Given a log file containing req ID and time consumed. Find all req. IDs consuming time more than certain seconds. Red ID: xyz Time: 10 2. Given a file containing 'Stundent,Marks'. Sum the marks of students and display totals marks student wise. I/P: Stud1,20 Stud2,30 Stud1,10 Stud2,30 O/P: Stud1,30 Stud2,60
How would you implemented a priority queue that allows one to get minimum and maximum from the same data structure?
OOPS, String, Multi-threading, collections DBMS - Joins, Keys, Views, Stored procedures
The second coding problem was a dynamic programming problem which was tough.
Where can you apply binary search - sorted array or linked list?
u have a table wilh user information like name,age and sex. Give a smart way to sort the entires based on age.
Given 2 arrays of names, how would you merge them?
There are 100 people standing near the beginning of a row of 100 closed doors. The first person goes down the row and opens every door. The second person closes every 2nd door. The third person changes the state of every 3rd door, and so on. Write a routine to find the state of door X after person Y passes by.
Some questions about Java basics, and some math problems and SQL
Viewing 2421 - 2430 interview questions