Media.net
39 LeetCode interview questions
Curated Lists
Categories
All Questions
Topics
- Minimum Operations to Form Subsequence With Target SumHard31.3%100.0%
- Count the Number of Square-Free SubsetsMedium25.2%92.9%
- Scramble StringHard42.2%86.4%
- Maximum Genetic Difference QueryHard44.3%86.4%
- Furthest Building You Can ReachMedium50.4%82.4%
- Minimum Total Space Wasted With K Resizing OperationsMedium43.0%82.4%
- Make the XOR of All Segments Equal to ZeroHard39.9%82.4%
- Minimum Time Visiting All PointsEasy82.6%82.4%
- Minimum XOR Sum of Two ArraysHard49.1%82.4%
- Minimum Cost to Buy ApplesMedium67.1%82.4%
- Queens That Can Attack the KingMedium72.2%82.4%
- Maximum XOR of Two Non-Overlapping SubtreesHard49.6%82.4%
- Difference Between Maximum and Minimum Price SumHard31.8%82.4%
- Sum of Remoteness of All CellsMedium70.8%82.4%
- Maximum Value of an Ordered Triplet IIMedium56.7%82.4%
- Maximum Value of an Ordered Triplet IEasy58.3%82.4%
- Best Time to Buy and Sell StockEasy55.3%77.4%
- Flatten Binary Tree to Linked ListMedium68.5%74.4%
- Substring with Concatenation of All WordsHard33.0%74.4%
- Merge Two Sorted ListsEasy66.8%70.9%
- Painting the WallsHard48.5%66.9%
- Fizz BuzzEasy74.4%61.9%
- Jump GameMedium39.5%61.9%
- LRU CacheMedium45.2%55.5%
- Number of Submatrices That Sum to TargetHard74.5%55.5%
- Binary Search Tree IteratorMedium74.9%55.5%
- Valid Phone NumbersEasy27.5%55.5%
- The Number of Good SubsetsHard35.9%55.5%
- Valid SudokuMedium62.3%55.5%
- Best Time to Buy and Sell Stock IIMedium69.5%55.5%
- All O`one Data StructureHard44.1%46.5%
- Merge IntervalsMedium49.4%46.5%
- Sliding Window MaximumHard47.6%46.5%
- Longest Palindromic SubstringMedium35.8%46.5%
- Sum of Distances in TreeHard65.3%46.5%
- Majority ElementEasy65.7%46.5%
- Trapping Rain WaterHard65.1%46.5%
- Search in Rotated Sorted ArrayMedium42.8%46.5%
- Minimize the Maximum Difference of PairsMedium50.9%46.5%
Showing 39 of 39 questions.