Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedCheck if a given set of moves is circular or not. A move is circular if its starting and ending coordinates are the same. The moves can contain instructions to move one unit in the same direction (M), to change direction to the left of current direction (L), and to change direction to the right of current direction (R).
Given a simple sentence and a set of syntax rules, validate if it is syntactically correct or not.
Given a limited range integer array of size n with all its elements between 1 and n except for one element that occurs twice and one missing from the list. Find the missing number and the duplicate element in linear time and without using any extra memory.
Given a number n, find the previous power of 2. If n itself is a power of 2, return n.
Given a number n, find the next highest power of 2. If n itself is a power of 2, return n.
Given two 16–bit positive values stored in 32–bit integer variables, find the product using the 8–bit multiply operator that takes two 8–bit numbers and returns a 16–bit value.
Write a program to find the XOR of two numbers without using the XOR operator.
Given an integer array, find out the minimum and maximum element present using minimum comparisons.
Given an integer array, find the maximum sum among all subarrays possible using divide and conquer algorithm.
Given an array, find the peak element in it. A peak element is an element that is greater than its neighbors. There might be multiple peak elements in an array, and the solution should report any peak element.
Given a nearly sorted array such that each of the n elements may be misplaced by no more than one position from the correct sorted order, search a given element in it efficiently. Report if the element is not present in the array.
Given a sorted array of distinct non-negative integers, find the smallest missing element in it.