Given a database, where we know some portion of data (e.g. say 20%) is accessed more than the other portion of the database by the client. We have a frontend that client requests data from. Design a data structure that will increase the efficiency of access of objects. And we know that we can only hold on to n elements in memory.
You have two intersecting linked lists. Describe a function that returns a pointer to the node where they intersect.
Merge 2 sorted arrays A and B Result should end up in B, which has available space for all items Utilize the space in B, not using temporary arrays Result in sorted array in B A { 2, 5, 8, 12, 15} B { 3, 5, 7, 9, , , , , , }
How to write an evaluator for a string like "(1+3 * ( 5 / 4)) and get a numeric result.
Connect Four is a game where two players take turns dropping their color discs into a vertically suspended grid. The game ends when a player adds a disc to the playing grid that connects four discs of their color. The connected discs can be in a horizontal, vertical or diagonal line. Write a function to be called after every turn that returns true if the game is over (and false otherwise).
Given a big image, how will you pan and zoom into the image in a way so as to focus on the important parts ot the image.
Give an example of real world scenario where you see inheritance?
You have 16 race horses and a racetrack which only fits 4 horses at one time. Find the top 4 horses in the fewest number of races.
sort an array N consists of four numbers, each number can be repeated k times, where k < n. Example: sort 1111144422223 to 1111122223444. Try to be as efficient as you can, not just O(n^2)
How would you sort an array if you had infinite RAM? Infinite memory?
Viewing 1521 - 1530 interview questions