Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGiven a list that can grow in both horizontal and vertical directions (right and down), flatten it into a singly linked list. The conversion should be in such a way that the down node should be processed before the next node for any node.
Given a linked list, swap the k’th node from the beginning with the k’th node from the end. The swapping should be done so that only links between the nodes are exchanged, and no data is swapped.
Given a list of jobs where each job has a start and finish time, and has profit associated with it, find a maximum profit subset of non-overlapping jobs.
Given a binary matrix, find the largest square submatrix, which is surrounded by all 1’s.
Given a binary tree, print its nodes in vertical order. Assume that the left and right child of a node makes a 45–degree angle with the parent.
This post will implement a queue using the stack data structure. In other words, design a queue that supports enqueue and dequeue operations using standard push and pop operations of the stack.
Given a multilevel linked list, convert it into a singly linked list so that all nodes of the first level appear first, followed by all nodes of the second level, and so on.
Given an integer array, rearrange it such that it contains positive and negative numbers at alternate positions. If the array contains more positive or negative elements, move them to the end of the array.
Given an array of pairs of integers, find all symmetric pairs, i.e., pairs that mirror each other. For instance, pairs (x, y) and (y, x) are mirrors of each other.
Write an efficient algorithm to construct the longest palindrome by shuffling or deleting characters from a given string.
Calculate the total number of ways to achieve a given sum with n throws of dice having k faces.
Given a string and a pattern, in-place replace all non-overlapping occurrences of the pattern in the string by a specified character.