J'ai passé un entretien chez Josh Technology Group
Entretien
My overall interview was okayish
waiting for the result (fingers crossed)
I was really nervous but I think i aced the interview
I hope I really get selected coz i have worked really hard for this
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Josh Technology Group (New Delhi)
Entretien
I applied through college, there is 3 round , Round 1 is objective that based on programming fundamental and 2 round based on aptitude and 2 coding problem then 3 round based on DSA (linked list,tree), if you clear then you technical interview in office
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Josh Technology Group (Gurgaon, Haryana) en juin 2026
Entretien
3 rounds. 1st was CS MCQ, 2nd was quant/english/math etc. 3rd was DSA, easy to medium questions. Had around 3 questions in the DSA round. This was the interview process basically.
Questions d'entretien [1]
Question 1
Asteroid collection leetcode question remodelled into something else
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Josh Technology Group (Gurgaon, Haryana) en juin 2026
Entretien
total 8 rounds
1st was oa(basic programming in c)
rest all rounds based on dsa
2-3 dsa question in each rounds
from trees and linked list
total 4 interviews
sliding window questions and trees questions
Questions d'entretien [1]
Question 1
Linked List (Medium)
Remove Nth Node From End of List
Pattern: Two pointers
Learn:
Fast and slow pointers
Dummy node
Edge cases
Reorder List
Pattern:
Find middle
Reverse second half
Merge two lists
One of the most important linked list questions.
Sort List
Pattern:
Merge Sort on Linked List
Very common interview question.
Swap Nodes in Pairs
Pattern:
Pointer manipulation
Dummy node
Odd Even Linked List
Pattern:
Rearranging pointers
Rotate List
Pattern:
Length calculation
Circular linked list
Breaking at correct position
Sliding Window (Medium)
Longest Repeating Character Replacement
Pattern:
Variable-size window
Frequency array
Permutation in String
Pattern:
Fixed-size window
Character count
Maximum Erasure Value
Pattern:
Sliding window + HashSet
Fruit Into Baskets
Pattern:
At most K distinct
Longest Substring Without Repeating Characters
Pattern:
Classic sliding window
Minimum Size Subarray Sum
Pattern:
Variable window
Shrink while valid
Trees (Medium)
Binary Tree Right Side View
Pattern:
BFS level order
DFS alternative
Validate Binary Search Tree
Pattern:
Range checking
Inorder traversal
Lowest Common Ancestor of a Binary Tree
Pattern:
DFS recursion
Path Sum II
Pattern:
Backtracking on trees
Construct Binary Tree from Preorder and Inorder Traversal
Pattern:
Divide and conquer
Hash map
Kth Smallest Element in a BST
Pattern:
Inorder traversal
BST property