Teradata
8 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 857. Minimum Cost to Hire K Workers | Hard | 100% | TopicsArrayGreedySortingHeap (Priority Queue) |
| 2528. Maximize the Minimum Powered City | Hard | 98.5% | TopicsArrayBinary SearchGreedyQueueSliding WindowPrefix Sum |
| 3629. Minimum Jumps to Reach End via Prime Teleportation | Medium | 96.9% | TopicsArrayHash TableMathBreadth-First SearchNumber Theory |
| Remove Boxes | Hard | 91.2% | TopicsArrayDynamic ProgrammingMemoization |
| 3082. Find the Sum of the Power of All Subsequences | Hard | 88.9% | TopicsArrayDynamic ProgrammingKnapsack Problem0-1 Knapsack |
| 3766. Minimum Operations to Make Binary Palindrome | Medium | 86.3% | TopicsArrayTwo PointersBinary SearchBit Manipulation |
| 1402. Reducing Dishes | Hard | 71.2% | TopicsArrayDynamic ProgrammingGreedySorting |
| Count Pairs in Two Arrays | Medium | 56.2% | TopicsArrayTwo PointersBinary SearchSorting |
