Problem database last updated: June 20, 2025
22 problems · 3 Easy, 18 Medium, 1 Hard · Ranked #85 of 458
3 Easy
14% · avg 23%
18 Medium
82% · avg 59%
1 Hard
5% · avg 18%
Based on 22 reported problems, josh technology interviews are easier than average - only 5% Hard compared to 18% across all companies. The majority (82%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, josh technology puts unusual emphasis on binary-tree (27.3% of problems, 5.5x the industry average), tree (27.3% of problems, 4.9x the industry average), linked-list (27.3% of problems, 3.8x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (31.8%), linked-list (27.3%), tree (27.3%), depth-first-search (27.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Move Zeroes Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. | Easy | Very Likely | arraytwo-pointers | Solve |
Add Two Numbers You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a sing... | Medium | Very Likely | linked-listmathrecursion | Solve |
Largest Number Given a list of non-negative integers nums, arrange them such that they form the largest number and return it. | Medium | Very Likely | arraystringgreedy | Solve |
Maximum Twin Sum of a Linked List In a linked list of size n, where n is even, the ith node (0-indexed) of the linked list is known as the twin of the (n-1-i)th node, if 0 <= i <= (n / 2) - 1. | Medium | Very Likely | linked-listtwo-pointersstack | Solve |
Remove Zero Sum Consecutive Nodes from Linked List Given the head of a linked list, we repeatedly delete consecutive sequences of nodes that sum to 0 until there are no such sequences. | Medium | Very Likely | hash-tablelinked-list | Solve |
Number of Good Leaf Nodes Pairs You are given the root of a binary tree and an integer distance. A pair of two different leaf nodes of a binary tree is said to be good if the length of the sho... | Medium | Very Likely | treedepth-first-searchbinary-tree | Solve |
Count Pairs Whose Sum is Less than Target Given a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < target. | Easy | Very Likely | arraytwo-pointersbinary-search | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Very Likely | arraydynamic-programming | Solve |
Find the Minimum and Maximum Number of Nodes Between Critical Points A critical point in a linked list is defined as either a local maxima or a local minima. | Medium | Very Likely | linked-list | Solve |
Reverse Odd Levels of Binary Tree Given the root of a perfect binary tree, reverse the node values at each odd level of the tree. | Medium | Very Likely | treedepth-first-searchbreadth-first-search | Solve |
Find Bottom Left Tree Value Given the root of a binary tree, return the leftmost value in the last row of the tree. | Medium | Very Likely | treedepth-first-searchbreadth-first-search | Solve |
Merge Nodes in Between Zeros You are given the head of a linked list, which contains a series of integers separated by 0's. The beginning and end of the linked list will have Node.val == 0. | Medium | Very Likely | linked-listsimulation | Solve |
Trim a Binary Search Tree Given the root of a binary search tree and the lowest and highest boundaries as low and high, trim the tree so that all its elements lies in [low, high]. Trimmi... | Medium | Likely | treedepth-first-searchbinary-search-tree | Solve |
Daily Temperatures Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait aft... | Medium | Likely | arraystackmonotonic-stack | Solve |
Reverse Nodes in k-Group Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. | Hard | Likely | linked-listrecursion | Solve |
Remove K Digits Given string num representing a non-negative integer num, and an integer k, return the smallest possible integer after removing k digits from num. | Medium | Likely | stringstackgreedy | Solve |
Count Good Nodes in Binary Tree Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X. | Medium | Likely | treedepth-first-searchbreadth-first-search | Solve |
Maximum Difference Between Node and Ancestor Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b. | Medium | Likely | treedepth-first-searchbinary-tree | Solve |
Minimum Swaps to Group All 1's Together II A swap is defined as taking two distinct positions in an array and swapping the values in them. | Medium | Likely | arraysliding-window | Solve |
Construct Smallest Number From DI String You are given a 0-indexed string pattern of length n consisting of the characters 'I' meaning increasing and 'D' meaning decreasing. | Medium | Likely | stringbacktrackingstack | Solve |
Find the Substring With Maximum Cost You are given a string s, a string chars of distinct characters and an integer array vals of the same length as chars. | Medium | Likely | arrayhash-tablestring | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Likely | hash-tablestringsliding-window | Solve |
Move Zeroes
SolveGiven an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Add Two Numbers
SolveYou are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a sing...
Largest Number
SolveGiven a list of non-negative integers nums, arrange them such that they form the largest number and return it.
Maximum Twin Sum of a Linked List
SolveIn a linked list of size n, where n is even, the ith node (0-indexed) of the linked list is known as the twin of the (n-1-i)th node, if 0 <= i <= (n / 2) - 1.
Remove Zero Sum Consecutive Nodes from Linked List
SolveGiven the head of a linked list, we repeatedly delete consecutive sequences of nodes that sum to 0 until there are no such sequences.
Number of Good Leaf Nodes Pairs
SolveYou are given the root of a binary tree and an integer distance. A pair of two different leaf nodes of a binary tree is said to be good if the length of the sho...
Count Pairs Whose Sum is Less than Target
SolveGiven a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < target.
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Find the Minimum and Maximum Number of Nodes Between Critical Points
SolveA critical point in a linked list is defined as either a local maxima or a local minima.
Reverse Odd Levels of Binary Tree
SolveGiven the root of a perfect binary tree, reverse the node values at each odd level of the tree.
Find Bottom Left Tree Value
SolveGiven the root of a binary tree, return the leftmost value in the last row of the tree.
Merge Nodes in Between Zeros
SolveYou are given the head of a linked list, which contains a series of integers separated by 0's. The beginning and end of the linked list will have Node.val == 0.
Trim a Binary Search Tree
SolveGiven the root of a binary search tree and the lowest and highest boundaries as low and high, trim the tree so that all its elements lies in [low, high]. Trimmi...
Daily Temperatures
SolveGiven an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait aft...
Reverse Nodes in k-Group
SolveGiven the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.
Remove K Digits
SolveGiven string num representing a non-negative integer num, and an integer k, return the smallest possible integer after removing k digits from num.
Count Good Nodes in Binary Tree
SolveGiven a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X.
Maximum Difference Between Node and Ancestor
SolveGiven the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b.
Minimum Swaps to Group All 1's Together II
SolveA swap is defined as taking two distinct positions in an array and swapping the values in them.
Construct Smallest Number From DI String
SolveYou are given a 0-indexed string pattern of length n consisting of the characters 'I' meaning increasing and 'D' meaning decreasing.
Find the Substring With Maximum Cost
SolveYou are given a string s, a string chars of distinct characters and an integer array vals of the same length as chars.
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent josh technology interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
josh technology interviews focus heavily on array, linked-list, tree problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. josh technology interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
josh technology has been reported to ask 22 distinct coding problems. The most common topics are array, linked-list, tree. 3 are Easy difficulty, 18 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 22 reported problems, josh technology interviews are easier than average - only 5% Hard compared to 18% across all companies. 82% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, linked-list, tree. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real josh technology coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a josh technology interview with AIarrow_forward
