Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedImplement the Quicksort algorithm using Hoare’s Partitioning scheme which is more efficient than Lomuto’s partition scheme because it does three times fewer swaps on average, and it creates efficient partitions even when all values are equal.
Given a linked list of integers, rearrange it such that every second node of the linked list is greater than its left and right nodes. In other words, rearrange the linked list nodes in alternating high-low.
Given a normal binary tree, convert it into a Left–child right–sibling (LC–RS) binary tree. Each node in the LC–RS binary tree has two pointers: one to the node’s left child and one to its next sibling in the original binary tree.
Given an unsorted integer array, find a triplet with a given sum in it.
Given a number, check if it is a power of four or not.
Given an integer array, find a triplet having the maximum product.
Implement your diff utility, i.e., given two similar strings, efficiently list out all differences between them. The diff utility is a data comparison tool that calculates and displays the differences between the two texts.
Given an array and an integer k, find the count of distinct elements in every subarray of size k.
Given an integer array, print all maximum size subarrays having all distinct elements in them.
Given a string and a pattern (having all distinct characters), determine if the string characters follow a specific order as defined by the pattern’s characters.
Given two sorted arrays, find a pair whose sum is closest to a given sum where the pair consists of elements from each array.
Given a linked list containing 0’s, 1’s, and 2’s, sort the linked list by doing a single traversal of it.