Josh Technology

Role: SDE Intern

College: Not Specified

Interview Date: 2023-08-23

Interview Type: Not Specified (Face-to-face interviews)

Result: Not Specified (Implied progression through initial rounds)

Difficulty: Medium

Rounds: 2 Online Assessment rounds, followed by at least 2 Interview Rounds (typically 3).

Topics Asked: Aptitude, Basic Programming, Program Output, Data Structures (Trees), Algorithms (Binary Search on Answer, Morris Traversal), Basic Dynamic Programming.

Experience:

This experience details the interview process for an SDE intern position at Josh Technology Group, involving online assessment rounds followed by face-to-face interviews.

Level 1: Online Assessment (OA) Rounds

Round 1: Focused on aptitude, basic programming skills, and the ability to decipher program outputs. It included a mix of aptitude problems, basic programming exercises, and two coding problems designed to test logical thinking and coding proficiency.

Round 2: This OA round delved into more challenging problem-solving, consisting of three problems with a focus on trees and basic dynamic programming. One problem required finding the maximum sum subtree within a given tree structure.

Level 2: Interview Rounds
After clearing the Online Assessment rounds, the process moved to face-to-face interviews. While typically three interviews are conducted, this candidate proceeded directly to rounds 2 and 3.

Round 2: The first interview round (referred to as Round 2 after OA) involved two more challenges.

Round 3: In the second interview round, two specific algorithmic challenges were presented:

• Binary Search on Answer: A problem akin to the "Capacity to Ship Packages Within D Days" problem on LeetCode, requiring a binary search approach to find a minimum capacity under given constraints.
• Morris Traversal: A problem centered around Morris Traversal, a technique for traversing binary trees without requiring additional space for a stack or recursion.

Key Takeaways from OA: Emphasized accuracy, optimization (time and space), and speed in solving problems without compromising accuracy.