Data structures and algorithms
Combinations
Combinations: Given two integers n and k, return all possible combinations of k numbers chosen from the range [1, n].
read more
Data structures and algorithms
Permutations II
Permutations II: Given a collection of numbers, nums, that might contain duplicates, return *all possible unique permutations in any order*.
read more
Data structures and algorithms
Permutations
Permutations: Given an array nums of distinct integers, return all the possible permutations.
read more
Data structures and algorithms
Subsets II
Subsets II: Given an integer array nums that may contain duplicates, return all possible subsets (the power set).
read more
Data structures and algorithms
Subsets
Subsets: Given an integer array nums of unique elements, return all possible subsets (the power set).
read more
Data structures and algorithms
Letter Combinations of a Phone Number
Letter Combinations of a Phone Number: Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.
read moreAbout Me
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 More