Netskope
7 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 647. Palindromic Substrings | Medium | 100% | TopicsTwo PointersStringDynamic Programming |
| LFU Cache | Hard | 100% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| 3. Longest Substring Without Repeating Characters | Medium | 100% | TopicsHash TableStringSliding Window |
| First Missing Positive | Hard | 100% | TopicsArrayHash Table |
| Design In-Memory File System | Hard | 100% | TopicsHash TableStringDesignTrieSorting |
| 23. Merge k Sorted Lists | Hard | 100% | TopicsLinked ListDivide and ConquerHeap (Priority Queue)Merge SortTournament Sort |
| 10. Regular Expression Matching | Hard | 100% | TopicsStringDynamic ProgrammingRecursion |
