Josh Technology|Interview Experience|SDE Role

Result
Offer
Experience
2 years
Posted
20 Aug 2022
331 reads

Summary

I successfully navigated through the online assessment, technical, and hiring manager rounds for an SDE role at Josh Technology Group, ultimately receiving an offer.

How it went

My journey with Josh Technology Group began after they reached out for an SDE position. The interview process consisted of three distinct rounds. I started with an online assessment hosted on HackerRank, which presented three coding challenges. I managed to solve all of them within the given time frame, which gave me confidence for the next stages.

Following the online round, I advanced to a technical interview primarily focused on Data Structures and Algorithms. The interviewer first delved into my previous projects, asking insightful questions about my contributions and challenges faced. After that, he presented a coding problem centered around cycle detection in a directed graph. I thoroughly explained my DFS-based approach, detailing how different node states (unvisited, visiting, visited) are used to identify back edges and thus, cycles. We also moved onto a system design problem, specifically 'Design a parking lot system', where I outlined a high-level architecture, discussed potential database schemas, and structured the core classes and functionalities.

The final round was with the hiring manager, which was predominantly behavioral. I was asked to share experiences about challenges I'd faced and how I overcame them, as well as my motivations for wanting to join Josh Technology Group. I articulated my enthusiasm for the company's work and how my skills aligned with their requirements. I was thrilled to eventually receive an offer after successfully completing all interview stages.

Questions asked (7)

  1. 01

    Median of Two Sorted Arrays

    Data Structures & Algorithms · Hard

    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)).

  2. 02

    Two Sum

    Data Structures & Algorithms · Easy

    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.

  3. 03

    Implement Randomized Set

    Data Structures & Algorithms · Medium

    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 from the set if present. Returns true if the item was present, false otherwise.
    • int getRandom() Returns a random element from the current set of elements. Each element must have the same probability of being returned.
    All functions should run in O(1) average time complexity.

  4. 04

    Cycle Detection in Directed Graph

    Data Structures & Algorithms · Medium

    Given a directed graph, determine if it contains a cycle. Describe and implement an algorithm to detect cycles efficiently.

  5. 05

    Design a Parking Lot System

    System Design · Hard

    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.

  6. 06

    Tell Me About a Time You Failed

    Behavioral

    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?

  7. 07

    Why Josh Technology?

    Behavioral

    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?

How they prepared

My preparation primarily involved a rigorous LeetCode grind for Data Structures and Algorithms problems, focusing on a wide range of topics and difficulties. For system design, I utilized resources like the System Design Primer and various online articles to understand common patterns, scalable architectures, and component interactions. Additionally, I practiced answering behavioral questions using the STAR method to structure my responses effectively, ensuring I could clearly articulate my experiences and learnings.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Josh Technology Group recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!