josh technology coding interview
questions, leaked.
22 problems reported across recent josh technology interviews. Top patterns: array, linked list, tree. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Josh Technology's assessment leans hard on linked-list and tree traversal. You're looking at 22 problems, mostly medium difficulty, with arrays and depth-first search as the recurring patterns. Three easy problems won't save you. You'll face connected-node manipulation, tree reconstruction, and greedy string problems back to back. The assessment runs hot on patterns that look simple until you hit the edge cases. If you blank mid-OA on a linked-list pointer problem or a tree traversal, StealthCoder surfaces a working solution in seconds, invisible to the proctor.
Top problems at josh technology
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Move Zeroes | EASY | 100.0 | 63% | Array · Two Pointers |
| 02 | Largest Number | MEDIUM | 95.0 | 41% | Array · String · Greedy |
| 03 | Add Two Numbers | MEDIUM | 95.0 | 46% | Linked List · Math · Recursion |
| 04 | Maximum Twin Sum of a Linked List | MEDIUM | 88.9 | 81% | Linked List · Two Pointers · Stack |
| 05 | Remove Zero Sum Consecutive Nodes from Linked List | MEDIUM | 88.9 | 53% | Hash Table · Linked List |
| 06 | Find the Minimum and Maximum Number of Nodes Between Critical Points | MEDIUM | 81.0 | 69% | Linked List |
| 07 | Number of Good Leaf Nodes Pairs | MEDIUM | 81.0 | 72% | Tree · Depth-First Search · Binary Tree |
| 08 | Best Time to Buy and Sell Stock | EASY | 81.0 | 55% | Array · Dynamic Programming |
| 09 | Merge Nodes in Between Zeros | MEDIUM | 81.0 | 90% | Linked List · Simulation |
| 10 | Find Bottom Left Tree Value | MEDIUM | 81.0 | 72% | Tree · Depth-First Search · Breadth-First Search |
| 11 | Reverse Odd Levels of Binary Tree | MEDIUM | 81.0 | 87% | Tree · Depth-First Search · Breadth-First Search |
| 12 | Count Pairs Whose Sum is Less than Target | EASY | 81.0 | 87% | Array · Two Pointers · Binary Search |
| 13 | Remove K Digits | MEDIUM | 69.9 | 35% | String · Stack · Greedy |
| 14 | Reverse Nodes in k-Group | HARD | 69.9 | 63% | Linked List · Recursion |
| 15 | Find the Substring With Maximum Cost | MEDIUM | 69.9 | 57% | Array · Hash Table · String |
| 16 | Minimum Swaps to Group All 1's Together II | MEDIUM | 69.9 | 66% | Array · Sliding Window |
| 17 | Longest Substring Without Repeating Characters | MEDIUM | 69.9 | 37% | Hash Table · String · Sliding Window |
| 18 | Construct Smallest Number From DI String | MEDIUM | 69.9 | 86% | String · Backtracking · Stack |
| 19 | Trim a Binary Search Tree | MEDIUM | 69.9 | 66% | Tree · Depth-First Search · Binary Search Tree |
| 20 | Count Good Nodes in Binary Tree | MEDIUM | 69.9 | 74% | Tree · Depth-First Search · Breadth-First Search |
| 21 | Daily Temperatures | MEDIUM | 69.9 | 67% | Array · Stack · Monotonic Stack |
| 22 | Maximum Difference Between Node and Ancestor | MEDIUM | 69.9 | 78% | Tree · Depth-First Search · Binary Tree |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual josh technology OA. The proctor cannot see it. Screen share cannot detect it. Built by a senior engineer who knows the OA is theater. This is the script.
Get StealthCoder- array7 · 32%
- linked list6 · 27%
- tree6 · 27%
- depth first search6 · 27%
- binary tree6 · 27%
- string5 · 23%
- stack4 · 18%
- greedy3 · 14%
- two pointers3 · 14%
- hash table3 · 14%
Arrays appear 7 times, but linked lists and trees are the real backbone at 6 problems each, plus 6 depth-first search variations. You're not grinding a balanced mix. Josh Technology wants to see if you can manipulate node structures and traverse trees cleanly. Most problems sit at medium difficulty, which means partial solutions won't pass. Start with linked-list fundamentals (two-pointer reversal, pointer repair, sum aggregation), then move to tree traversals and DFS patterns. Arrays and strings are the hedge topics if you need a quick confidence win. Only one hard problem reported, so don't waste days on Reverse Nodes in k-Group if you haven't nailed the mediums. When you hit the live OA, StealthCoder is your backup for whatever pattern didn't stick.
Companies with similar patterns
If you prepped for josh technology, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass josh technology.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by a senior engineer who knows the OA is theater. This is the script. Works on HackerRank, CodeSignal, CoderPad, and Karat.
josh technology interview FAQ
How many linked-list problems should I solve before the Josh Technology assessment?+
Linked lists show up in 6 of 22 problems here, and they're all medium difficulty. Solve at least 10 to 15 linked-list problems, focusing on pointer manipulation, two-pointer techniques, and hash-table cleanup. Josh Technology tests node repair and list transformation, not just iteration.
Is studying array problems enough for Josh Technology?+
No. Arrays appear 7 times, but most are paired with greedy, sorting, or two-pointer logic. If you skip linked lists and trees (12 problems combined), you'll fail. Spend 40 percent of your time on linked lists and trees, 30 percent on arrays, 20 percent on strings and stacks, 10 percent on edge cases.
What topic should I study first for a Josh Technology interview?+
Linked lists. Six problems reported, all medium, and they hit on two-pointer traversal, pointer repair, and hash-table marking. Trees and DFS come next. These two topics alone cover 12 of 22 problems. Arrays and strings are secondary but appear frequently.
How many tree problems will I see, and what type?+
Six tree problems reported, all medium difficulty, split between binary-tree traversal (DFS and BFS), node-pair counting, and level-order manipulation. Expect both recursive and iterative solutions. You'll need confidence in both depth-first and breadth-first approaches.
Should I worry about the one hard problem at Josh Technology?+
Not yet. One hard problem (Reverse Nodes in k-Group) can tank your confidence if you obsess over it early. Nail the 18 medium problems first. Most candidates fail on mediums due to incomplete logic, not because hard problems exist. Hard is a bonus if you have time.