Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGiven an array of non-negative integers, where each array element represents the maximum number of positions one can move forward from that element. Find the minimum number of jumps required to reach a given destination from a given source within the array.
Given an array of positive and negative integers, segregate them without changing the relative order of elements. The output should contain all positive numbers follow negative numbers while maintaining the same relative ordering.
Given a list of jobs where each job has a start and finish time, and a profit associated with it, find a maximum profit subset of non-overlapping jobs.
Given a connected undirected graph and a vertex in the graph, construct a directed graph such that any path in the directed graph leads to that particular vertex.
Given a linked list that stores a path formed by cells of a matrix, remove the redundant nodes in that path. The path can be both vertical and horizontal, but never diagonal.
Given a singly linked list whose nodes represent digits of a number, add a single-digit number to it.
Write an efficient algorithm to determine if a binary tree satisfies the height-balanced property of the red–black tree or not.
Given a linked list, reverse every alternate group of k nodes where k is a given positive integer.
This post will implement a stack using the queue data structure. In other words, design a stack that supports push and pop operations using standard enqueue and dequeue operations of the queue.
Given a linked list representation of two positive numbers, calculate and store their sum in a new list without extra space.
Given a singly linked list of integers, determine if the linked list is a palindrome or not.
Given an array of distinct integers, shuffle it according to the given order of elements.