Josh-Technology Questions
Here are the LeetCode questions for Josh-Technology.
Total: 36
Easy: 7
Medium: 26
Hard: 3
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 15 | |
| 2 | String | 7 | |
| 3 | Linked List | 7 | |
| 4 | Breadth-First Search | 7 | |
| 5 | Depth-First Search | 6 | |
| 6 | Math | 6 | |
| 7 | Matrix | 5 | |
| 8 | Binary Tree | 5 | |
| 9 | Tree | 5 | |
| 10 | Dynamic Programming | 5 | |
| 11 | Greedy | 4 | |
| 12 | Two Pointers | 4 | |
| 13 | Stack | 4 | |
| 14 | Recursion | 3 | |
| 15 | Monotonic Stack | 3 | |
| 16 | Binary Search | 2 | |
| 17 | Simulation | 2 | |
| 18 | Shortest Path | 2 | |
| 19 | Heap (Priority Queue) | 2 | |
| 20 | Graph Theory | 2 | |
| 21 | Sorting | 2 | |
| 22 | Hash Table | 2 | |
| 23 | Backtracking | 1 | |
| 24 | Bit Manipulation | 1 | |
| 25 | Bitmask | 1 | |
| 26 | Geometry | 1 | |
| 27 | Number Theory | 1 | |
| 28 | Memoization | 1 | |
| 29 | Combinatorics | 1 | |
| 30 | Enumeration | 1 | |
| 31 | Sliding Window | 1 | |
| 32 | Prefix Sum | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Count Pairs Whose Sum is Less than Target | Visit | Easy | |
| 2 | Find the Substring With Maximum Cost | Visit | Medium | |
| 3 | Reverse Odd Levels of Binary Tree | Visit | Medium | |
| 4 | Construct Smallest Number From DI String | Visit | Medium | |
| 5 | Merge Nodes in Between Zeros | Visit | Medium | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 36 questions for free!
Log InFrequently Asked Questions
Common questions about Josh-Technology interviews