Citadel
100 LeetCode interview questions
Curated Lists
Categories
All Questions
Topics
- Longest Non-decreasing Subarray From Two ArraysMedium29.8%100.0%
- Binary Tree Maximum Path SumHard41.2%98.7%
- Delete and EarnMedium56.7%93.4%
- Minimum Knight MovesMedium41.3%93.4%
- Palindromic SubstringsMedium71.7%86.5%
- Sliding Window MaximumHard47.6%85.3%
- Count Palindromic SubsequencesHard39.3%81.3%
- Minimum Equal Sum of Two Arrays After Replacing ZerosMedium50.2%79.8%
- LFU CacheHard46.6%79.8%
- Minimum Operations to Make Numbers Non-positiveHard42.2%78.1%
- Number of Good Binary StringsMedium52.5%76.4%
- Maximum Total Damage With Spell CastingMedium27.7%76.4%
- Maximum Length of Repeated SubarrayMedium51.0%74.4%
- LRU CacheMedium45.2%74.4%
- Minimum Costs Using the Train LineHard77.6%74.4%
- Best Position for a Service CentreHard34.9%74.4%
- Evaluate DivisionMedium63.1%72.3%
- First Completely Painted Row or ColumnMedium63.9%72.3%
- Longest String ChainMedium62.0%70.0%
- Merge IntervalsMedium49.4%70.0%
- Best Time to Buy and Sell StockEasy55.3%67.4%
- Serialize and Deserialize Binary TreeHard59.0%67.4%
- Find the Duplicate NumberMedium62.8%67.4%
- Evaluate Reverse Polish NotationMedium55.0%64.5%
- Insert Delete GetRandom O(1)Medium55.0%64.5%
- Sudoku SolverHard63.9%61.1%
- Length of Longest Subarray With at Most K FrequencyMedium55.8%61.1%
- Parallel Courses IIIHard66.7%61.1%
- Number of IslandsMedium62.3%61.1%
- Couples Holding HandsHard58.4%57.1%
- Find Median from Data StreamHard53.3%57.1%
- Group AnagramsMedium70.9%57.1%
- Validate Binary Search TreeMedium34.4%57.1%
- Meeting SchedulerMedium55.2%57.1%
- Employee Free TimeHard72.6%57.1%
- Merge k Sorted ListsHard56.8%57.1%
- PermutationsMedium80.7%57.1%
- Robot Room CleanerHard77.5%57.1%
- Binary Tree Zigzag Level Order TraversalMedium61.7%52.2%
- Design Search Autocomplete SystemHard49.4%52.2%
- N-QueensHard72.8%52.2%
- Fizz BuzzEasy74.4%52.2%
- Best Time to Buy and Sell Stock IIMedium69.5%52.2%
- Regular Expression MatchingHard29.3%52.2%
- Best Time to Buy and Sell Stock IIIHard51.1%52.2%
- Search Suggestions SystemMedium65.1%52.2%
- Combination SumMedium74.7%52.2%
- Design Circular QueueMedium52.6%52.2%
- Trapping Rain WaterHard65.1%52.2%
- Word SearchMedium45.3%45.9%
- Design Excel Sum FormulaHard42.6%45.9%
- Climbing StairsEasy53.5%45.9%
- Letter Combinations of a Phone NumberMedium63.9%45.9%
- Sqrt(x)Easy40.4%45.9%
- Implement Trie (Prefix Tree)Medium67.9%45.9%
- Moving Average from Data StreamEasy79.9%45.9%
- Sort Items by Groups Respecting DependenciesHard65.6%45.9%
- Design Front Middle Back QueueMedium56.3%45.9%
- Median of Two Sorted ArraysHard43.8%45.9%
- Find Servers That Handled Most Number of RequestsHard44.1%45.9%
- Longest Increasing Path in a MatrixHard55.3%45.9%
- House RobberMedium52.3%45.9%
- Maximal SquareMedium48.8%45.9%
- 3SumMedium37.1%45.9%
- Perfect SquaresMedium55.7%45.9%
- Minimum Height TreesMedium42.0%45.9%
- Alien DictionaryHard36.7%45.9%
- Count Ways To Build Good StringsMedium59.2%45.9%
- Transform to ChessboardHard50.6%45.9%
- Best Time to Buy and Sell Stock with Transaction FeeMedium70.5%37.1%
- Open the LockMedium60.7%37.1%
- Koko Eating BananasMedium49.1%37.1%
- Populating Next Right Pointers in Each Node IIMedium55.6%37.1%
- Max Points on a LineHard29.0%37.1%
- Integer to RomanMedium68.6%37.1%
- Permutations IIMedium61.6%37.1%
- Pow(x, n)Medium37.0%37.1%
- Simplify PathMedium47.9%37.1%
- Container With Most WaterMedium57.8%37.1%
- Rotting OrangesMedium56.6%37.1%
- Longest Increasing SubsequenceMedium57.8%37.1%
- Rank Transform of a MatrixHard41.4%37.1%
- Paint HouseMedium63.7%37.1%
- Subarray Sums Divisible by KMedium55.6%37.1%
- Search a 2D Matrix IIMedium55.2%37.1%
- Best Time to Buy and Sell Stock IVHard47.1%37.1%
- Insert Delete GetRandom O(1) - Duplicates allowedHard35.8%37.1%
- Word Ladder IIHard27.2%37.1%
- Bus RoutesHard47.0%37.1%
- Course ScheduleMedium49.2%37.1%
- Reorganize StringMedium56.2%37.1%
- Longest Common SubsequenceMedium58.2%37.1%
- Egg Drop With 2 Eggs and N FloorsMedium73.7%37.1%
- Course Schedule IIMedium53.4%37.1%
- Populating Next Right Pointers in Each NodeMedium65.4%37.1%
- Knight Probability in ChessboardMedium56.6%37.1%
- Asteroid CollisionMedium45.5%37.1%
- The Skyline ProblemHard44.0%37.1%
- Basic CalculatorHard45.6%37.1%
- Count Number of Maximum Bitwise-OR SubsetsMedium87.9%37.1%
Showing 100 of 100 questions.