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.
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).
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)
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.
Java program in round 3 was the most difficult question in my case. A matrix halfly-filled with numbers - almost randomly was given . And You need to fill the blank matrix of same size with those numbers in similar arrangement in a program using 2D arrays and loops.
How would you sort an array if you had infinite RAM? Infinite memory?
You have two intersecting linked lists. Describe a function that returns a pointer to the node where they intersect.
Given an array of unique non-negative integers, {A1,…,An}, and a positive integer, X, write a function that finds all pairs of numbers in the array that sum to X”. You are given an integer array nums sorted in ascending order (with distinct values), and an integer target. Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).” Take a singly-linked list, and reorder in such a way that the first element points to the last element, second element points to second-to-last element, and so on.
Viewing 1521 - 1530 interview questions