Citadel
75 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Minimum Operations to Make Numbers Non-positive | Hard | 46.8% | TopicsArrayBinary Search |
| 2958. Length of Longest Subarray With at Most K Frequency | Medium | 46.8% | TopicsArrayHash TableSliding Window |
| 622. Design Circular Queue | Medium | 46.8% | TopicsArrayLinked ListDesignQueue |
| 412. Fizz Buzz | Easy | 46.8% | TopicsMathStringSimulation |
| 346. Moving Average from Data Stream | Easy | 46.8% | TopicsArrayDesignQueueData Stream |
| 70. Climbing Stairs | Easy | 46.8% | TopicsMathDynamic ProgrammingMemoization |
| Pow(x, n) | Medium | 46.8% | TopicsMathRecursion |
| 875. Koko Eating Bananas | Medium | 46.8% | TopicsArrayBinary Search |
| Max Points on a Line | Hard | 46.8% | TopicsArrayHash TableMathGeometryEuclidean AlgorithmGreatest Common Divisor |
| 5. Longest Palindromic Substring | Medium | 46.8% | TopicsTwo PointersStringDynamic ProgrammingManacher |
| 204. Count Primes | Medium | 46.8% | TopicsArrayMathEnumerationNumber TheoryPrimality TestSieve TheoryPrime Number Sieve |
| 34. Find First and Last Position of Element in Sorted Array | Medium | 46.8% | TopicsArrayBinary Search |
| Next Permutation | Medium | 46.8% | TopicsArrayTwo Pointers |
| 98. Validate Binary Search Tree | Medium | 46.8% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
| 1155. Number of Dice Rolls With Target Sum | Medium | 46.8% | TopicsDynamic Programming |
| 188. Best Time to Buy and Sell Stock IV | Hard | 46.8% | TopicsArrayDynamic Programming |
| 155. Min Stack | Medium | 46.8% | TopicsStackDesign |
| 1244. Design A Leaderboard | Medium | 46.8% | TopicsHash TableDesignSorting |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | 46.8% | TopicsArrayDynamic ProgrammingGreedy |
| Knight Probability in Chessboard | Medium | 46.8% | TopicsDynamic Programming |
| 1411. Number of Ways to Paint N × 3 Grid | Hard | 46.8% | TopicsDynamic ProgrammingGraph Coloring |
| 802. Find Eventual Safe States | Medium | 46.8% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological SortKosaraju's AlgorithmTarjan's SCC Algorithm |
| Design Search Autocomplete System | Hard | 46.8% | TopicsStringDepth-First SearchDesignTrieSortingHeap (Priority Queue)Data Stream |
| 935. Knight Dialer | Medium | 46.8% | TopicsDynamic Programming |
| Implement Trie (Prefix Tree) | Medium | 46.8% | TopicsHash TableStringDesignTrie |
