Josh Technology Group Interview Experience | SDE Role | Batch 2026
- Location
- Gurgaon, India
- Posted
- 24 Apr 2026
Summary
I went through a grueling 15‑hour on‑campus and on‑site interview process at Josh Technology Group for an SDE role, clearing multiple rounds but ultimately no candidates were selected.
How it went
I am sharing this because the industry needs a reality check on what "broken hiring" looks... (full original content omitted for brevity)
Questions asked (6)
- 01
Stack-Based String Reduction
Data Structures & Algorithms
Remove adjacent characters if they are consecutive (ab, ba) or circular (az, za). Removals must be cascading (if removing a pair might make the new neighbors consecutive, remove them too).
- 02
House Robber III on Binary Tree
Data Structures & Algorithms
Maximum sum of nodes in a binary tree with the constraint that you cannot pick a parent and its direct child.
- 03
Minimize Maximum Partition Sum
Data Structures & Algorithms
Split an array into M parts such that the maximum sum of any part is minimized.
- 04
Custom BST Pruning with O(1) Space
Data Structures & Algorithms
Delete a node if
node.val - inorderPredecessor < K. Must be done in one traversal, with O(1) extra space and no global variables. - 05
BST Pair Sum with O(1) Space
Data Structures & Algorithms
Find all pairs in a BST that sum to a target with O(1) extra space. You cannot use a stack or a temporary list; you have to implement a stackless iterator or use Morris Traversal logic.
- 06
Generate M Numbers Summing to N (Backtracking)
Data Structures & Algorithms
Backtracking to generate all unique combinations of M numbers that sum to N.
How they prepared
I prepared by extensively solving LeetCode problems, focusing on arrays, trees, and linked lists, and practicing under time pressure.