Tcs
264 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 312. Burst Balloons | Hard | 50.3% | TopicsArrayDynamic Programming |
| 234. Palindrome Linked List | Easy | 50.3% | TopicsLinked ListTwo PointersStackRecursion |
| 230. Kth Smallest Element in a BST | Medium | 50.3% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
| 4Sum | Medium | 46.3% | TopicsArrayTwo PointersSorting |
| 55. Jump Game | Medium | 46.3% | TopicsArrayDynamic ProgrammingGreedy |
| 62. Unique Paths | Medium | 46.3% | TopicsMathDynamic ProgrammingCombinatorics |
| 73. Set Matrix Zeroes | Medium | 46.3% | TopicsArrayHash TableMatrix |
| 118. Pascal's Triangle | Easy | 46.3% | TopicsArrayDynamic Programming |
| 202. Happy Number | Easy | 46.3% | TopicsHash TableMathTwo PointersFloyd's Cycle Finding Algorithm |
| 204. Count Primes | Medium | 46.3% | TopicsArrayMathEnumerationNumber TheoryPrimality TestSieve TheoryPrime Number Sieve |
| 766. Toeplitz Matrix | Easy | 46.3% | TopicsArrayMatrix |
| 898. Bitwise ORs of Subarrays | Medium | 46.3% | TopicsArrayDynamic ProgrammingBit Manipulation |
| 912. Sort an Array | Medium | 46.3% | TopicsArrayDivide and ConquerSortingHeap (Priority Queue)Merge SortBucket SortRadix SortCounting Sort |
| 35. Search Insert Position | Easy | 46.3% | TopicsArrayBinary Search |
| 23. Merge k Sorted Lists | Hard | 46.3% | TopicsLinked ListDivide and ConquerHeap (Priority Queue)Merge SortTournament Sort |
| 19. Remove Nth Node From End of List | Medium | 46.3% | TopicsLinked ListTwo Pointers |
| Product Sales Analysis I | Easy | 46.3% | TopicsDatabase |
| 238. Product of Array Except Self | Medium | 46.3% | TopicsArrayPrefix Sum |
| 162. Find Peak Element | Medium | 46.3% | TopicsArrayBinary Search |
| 21. Merge Two Sorted Lists | Easy | 41.5% | TopicsLinked ListRecursion |
| 78. Subsets | Medium | 41.5% | TopicsArrayBacktrackingBit Manipulation |
| Sliding Window Maximum | Hard | 41.5% | TopicsArrayQueueSliding WindowHeap (Priority Queue)Monotonic QueueRange Minimum/Maximum Query |
| 543. Diameter of Binary Tree | Easy | 41.5% | TopicsTreeDepth-First SearchBinary TreeDP on Trees |
| 287. Find the Duplicate Number | Medium | 41.5% | TopicsArrayTwo PointersBinary SearchBit ManipulationPigeonhole PrincipleFloyd's Cycle Finding Algorithm |
| 141. Linked List Cycle | Easy | 41.5% | TopicsHash TableLinked ListTwo PointersFloyd's Cycle Finding Algorithm |
