K Closest Points to Origin: Given an array of points where points[i] = [x_i, y_i] represents a point on the X-Y plane and an integer k, return the k closest points to the origin (0, 0).
read more
Generate Parentheses: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
read more
Palindrome Partitioning: Given a string s, partition s such that every substring of the partition is a palindrome.
read more
Word Search: Given an m x n grid of characters board and a string word, return true if word exists in the grid.
read more
Combination Sum III: Find all valid combinations of k numbers that sum up to n such that the following conditions are true:
read more
Combination Sum II: Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target.
read more
After investing countless hours in courses, books, and guides, as well as honing my skills on LeetCode, we came to the realization that interview preparation can be an incredibly time-consuming process, not to mention the stress of actually passing the interviews.
Know MoreDon’t settle for anything less than the crown. Join our newsletter and become the King of Interviews! Click here to join now and get the latest updates.