All companies
Nagarro
4 Easy4 Medium0 Hard8 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 2320 | Count Number of Ways to Place Houses | Medium | |
| 3852 | Smallest Pair With Different Frequencies | Easy | |
| 3 | Longest Substring Without Repeating Characters | Medium | |
| 242 | Valid Anagram | Easy | |
| 225 | Implement Stack using Queues | Easy | |
| 75 | Sort Colors | Medium | |
| 141 | Linked List Cycle | Easy | |
| 2434 | Using a Robot to Print the Lexicographically Smallest String | Medium |