Get better at Coding Interviews. Complete solutions to the most frequently asked Coding Interview Problems.
Fixed-length sliding window coding interview problems are a subset of the sliding window problems where the window’s size remains constant throughout the operation.
How to Solve Fixed-Length Sliding Window Problems? Read More »
An LRU Cache is a mechanism that keeps recently used items around, but when the cache reaches its limit, the least recently used item is discarded to make space for a new item.
What is LRU Cache and How to implement it yourself? Read More »
Learn how to efficiently and elegantly find Kth largest element in a stream using Priority Queue.
Kth Largest Element in a Stream: Prioritizing Elements in a Real-time Read More »
You are given two sorted linked lists, and your task is to merge them into one sorted linked list.
Merge Two Sorted Linked Lists Read More »
Given a non-empty list of words, return the k most frequent words. The output should be sorted by frequency from highest to lowest.
Solving “Top K Frequent Words” Coding Interview Problem Read More »
Add the two numbers represented as Linked Lists, return the sum as a linked list.
Add Two Numbers: Navigating Linked Lists in Coding Interview Read More »
Problem Statement Given an array of integers arr, write a function that returns true if the number of occurrences of each value in the array is unique, otherwise return false. Example For the array arr = [1,2,2,1,1,3], the number of occurrences are: 1 appears 3 times, 2 appears 2 times, and 3 appears 1 time.
Unique Number of Occurrences: Coding Interview Problem Read More »
Problem Statement: Given an array of integers, nums, and an integer target, return the indices of the two numbers such that they add up to the target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Example For the array nums = [2, 7,
Solving “Two Sum” Coding Interview Problem Efficiently Read More »
Problem Statement Given two strings, s and t, determine if t is an anagram of s. Definition of Anagram An anagram is a word or phrase formed by rearranging the letters of another word or phrase, using all the original letters exactly once. Example For the strings s = “anagram” and t = “ganaram”, the
How to check if two Strings are Anagram of each other? Read More »
Problem Statement Given an array of integers, where each integer represents the height of a vertical line on a chart, determine the two lines which, together with the x-axis, forms a container that can hold the most water. The objective is to maximize the area of the container. Note: The width of the container is
Solving “Container With Most Water” Coding Interview Problem Read More »