15 questions · from 3 interviews
Josh Technology Group interview questions
Every question candidates reported from their Josh Technology Group interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.
Josh Technology Group coding and DSA questions
- 01
Stack-Based String Reduction
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).
From Josh Technology Group Interview Experience | SDE Role | Batch 2026
- 02
House Robber III on Binary Tree
Maximum sum of nodes in a binary tree with the constraint that you cannot pick a parent and its direct child.
From Josh Technology Group Interview Experience | SDE Role | Batch 2026
- 03
Minimize Maximum Partition Sum
Split an array into M parts such that the maximum sum of any part is minimized.
From Josh Technology Group Interview Experience | SDE Role | Batch 2026
- 04
Custom BST Pruning with O(1) Space
Delete a node if node.val - inorderPredecessor < K . Must be done in one traversal, with O(1) extra space and no global variables.
From Josh Technology Group Interview Experience | SDE Role | Batch 2026
- 05
BST Pair Sum with O(1) Space
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.
From Josh Technology Group Interview Experience | SDE Role | Batch 2026
- 06
Generate M Numbers Summing to N (Backtracking)
Backtracking to generate all unique combinations of M numbers that sum to N.
From Josh Technology Group Interview Experience | SDE Role | Batch 2026
- 07
Remove Nth Node from End of Linked List
Remove Nth Node from the End of a Linked List (Leetcode 19) The requirement was to solve it in O(1) space and with a single traversal.
- 08
Convert BST to Greater Sum Tree
Convert a Binary Search Tree to a Greater Sum Tree (Leetcode 1038) This also needed to be solved in O(1) space and with a single traversal.
- 09
Median of Two Sorted Arrays
Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)) .
Hard · From Josh Technology|Interview Experience|SDE Role
- 10
Two Sum
Given an array of integers nums and an integer target , return indices of the two numbers such that they add up to target . You may assume that each input would have exactly one solution, and you may not use the same element twice.
Easy · From Josh Technology|Interview Experience|SDE Role
- 11
Implement Randomized Set
Implement the RandomizedSet class: RandomizedSet() Initializes the RandomizedSet object. bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise. bool remove(int val) Removes an item val…
Medium · From Josh Technology|Interview Experience|SDE Role
- 12
Cycle Detection in Directed Graph
Given a directed graph, determine if it contains a cycle. Describe and implement an algorithm to detect cycles efficiently.
Medium · From Josh Technology|Interview Experience|SDE Role
Josh Technology Group system design questions
- 01
Design a Parking Lot System
Design a parking lot system that can manage different types of vehicles (cars, bikes, trucks), multiple levels, different parking spot sizes, and handle entry/exit operations including payment. Consider scalability and core functionalities.
Hard · From Josh Technology|Interview Experience|SDE Role
Josh Technology Group behavioural and HR questions
- 01
Tell Me About a Time You Failed
Describe a situation where you experienced failure. What was the situation, what was your role, what did you learn from it, and how did you apply those learnings?
- 02
Why Josh Technology?
What motivated you to apply for a role at Josh Technology Group? What do you know about our company, and what excites you about this opportunity?
Josh Technology Group interview questions FAQ
What questions are asked in Josh Technology Group interviews?
Candidates reported 15 distinct questions across 3 Josh Technology Group interviews. 12 coding and DSA questions, 1 system design questions, 2 behavioural and HR questions.
How difficult are Josh Technology Group interview questions?
Of the questions candidates rated, 20% were easy, 40% medium and 40% hard.