DSA Doctor
Verified Company Vault
Josh Technology DSA Interview Questions
34 curated coding interview questions directly asked in Josh Technology technical rounds, sorted by frequency with recency and difficulty diagnostics.
34
Total Questions
7 (21%)
Easy Problems
24 (71%)
Medium Problems
3 (9%)
Hard Problems
🔥 Most Tested Topics:
Trees (15)Arrays (13)Linked List (9)Core DSA (5)Strings (3)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 179 | Largest Number | Medium | Core DSA | Implementation / Reasoning | 43.1% | 100.0% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 87.5% | all |
| 2130 | Maximum Twin Sum of a Linked List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 81.7% | 87.5% | all |
| 2074 | Reverse Nodes in Even Length Groups | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 64.1% | 87.5% | all |
| 2415 | Reverse Odd Levels of Binary Tree | Medium | Trees | DFS / BFS | 86.6% | 75.0% | all |
| 513 | Find Bottom Left Tree Value | Medium | Trees | DFS / BFS | 72.3% | 75.0% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 75.0% | all |
| 1325 | Delete Leaves With a Given Value | Medium | Core DSA | Implementation / Reasoning | 77.2% | 75.0% | all |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | Medium | Arrays; Trees; Linked List | Sorting / Prefix / Scan; DFS / BFS; Two Pointers | 53.2% | 62.5% | all |
| 2181 | Merge Nodes in Between Zeros | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 89.7% | 62.5% | all |
| 2606 | Find the Substring With Maximum Cost | Medium | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS | 58.0% | 62.5% | all |
| 2134 | Minimum Swaps to Group All 1's Together II | Medium | Arrays | Sorting / Prefix / Scan | 65.6% | 62.5% | all |
| 2824 | Count Pairs Whose Sum is Less than Target | Easy | Arrays | Sorting / Prefix / Scan | 87.7% | 62.5% | all |
| 25 | Reverse Nodes in k-Group | Hard | Trees; Linked List | DFS / BFS; Two Pointers | 66.1% | 62.5% | all |
| 1448 | Count Good Nodes in Binary Tree | Medium | Trees | DFS / BFS | 73.9% | 62.5% | all |
| 402 | Remove K Digits | Medium | Core DSA | Implementation / Reasoning | 36.9% | 62.5% | all |
| 739 | Daily Temperatures | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.7% | 62.5% | all |
| 1026 | Maximum Difference Between Node and Ancestor | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 78.2% | 62.5% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | all |
| 226 | Invert Binary Tree | Easy | Trees | DFS / BFS | 80.1% | 62.5% | all |
| 114 | Flatten Binary Tree to Linked List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 70.7% | 62.5% | all |
| 19 | Remove Nth Node From End of List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 51.6% | 62.5% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 62.5% | all |
| 617 | Merge Two Binary Trees | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 79.1% | 62.5% | all |
| 132 | Palindrome Partitioning II | Hard | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 37.1% | 62.5% | all |
| 1315 | Sum of Nodes with Even-Valued Grandparent | Medium | Arrays; Trees; Dynamic Programming | Sorting / Prefix / Scan; DFS / BFS; State Transition | 85.9% | 62.5% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 62.5% | all |
| 328 | Odd Even Linked List | Medium | Linked List | Two Pointers | 62.5% | 62.5% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 62.5% | all |
| 61 | Rotate List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 42.6% | 62.5% | all |
| 515 | Find Largest Value in Each Tree Row | Medium | Trees | DFS / BFS | 66.3% | 62.5% | all |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 62.5% | all |
| 463 | Island Perimeter | Easy | Graphs | BFS / DFS / Topological Sort | 74.4% | 62.5% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 62.5% | all |