Track: SDE-2

SDE-2

Round Breakdown

1. Technical Round (DSA Focus)

• Duration: 1 hour.
• Questions:
  1. Sliding window problem.
  2. Dynamic Programming problem.
• Focus: Solution approach, time complexity, clean code, and communication skills.
• Source: LeetCode

2. Machine Coding Round

• Task: Design and implement a cricket game.
• Duration: 1.5 hours.
• Focus: Modularity, clean implementation, and functional correctness.
• Source: LeetCode

3. System Design Round (High-Level Design)

• Task: Design a booking aggregator system.
  • Features: Book movies, cabs, etc.
  • Storage of configurations and monitoring.
• Duration: 1 hour.
• Source: LeetCode

4. Managerial Round

• Focus: Discussion on past projects, contributions, learnings, and role expectations.
• Source: LeetCode

5. Machine Coding Round (Alternative)

• Task: Design and implement a Splitwise-like expense management system.
  • Features: User/group management, expense tracking, balance settlement.
  • Extensions: Custom splits, settlement logic.
• Source: LeetCode

6. Design Round (HLD/LLD)

• Task: Design a ride-sharing application.
  • Features: Driver/rider management, ride creation/updating/withdrawal, pricing strategies.
  • Deliverables: HLD diagrams, activity diagrams.
• Source: LeetCode

---

Key Topics for Preparation

• DSA: Sliding window, Dynamic Programming, Trees, Graphs.
• System Design: Booking aggregators, ride-sharing systems, rate limiters.
• Low-Level Design: Expense management systems, modularity, OOPs principles.
• Managerial: Project deep dives, behavioral questions, scalability considerations.

---

Track: Intern

Intern

Online Assessment (OA) Format

• Platform: Typically conducted on platforms like HackerRank or similar.
• Structure:
  • Coding Round: 2-3 questions (varies by source).
    • Example topics: Stock buy-sell problems, Minimum Cost for Tickets, subarray problems.
  • MCQs: 10 easy aptitude and basic knowledge questions (e.g., time complexity, OS, threading, C++ basics).
  • Difficulty: Medium to hard, focusing on foundational DSA and problem-solving.

Round Breakdown

1. Resume Shortlisting

• Focus: Application-based selection, not CGPA-based.
• Source: GeeksforGeeks

2. Coding Round

• Questions:
  1. Stock buy-sell problem.
  2. Variation of stock buy-sell problem with at most k transactions.
  3. Design a vending machine using OOPs concepts.
• Source: GeeksforGeeks

3. Technical Round

• Questions:
  1. Balanced parenthesis problem.
  2. Longest balanced parenthesis in a given string in O(N) time.
  3. Find the first peak element in an array in O(logN) time.
  4. Reverse a linked list.
• Source: GeeksforGeeks

4. Assignment Round (Frontend-Specific)

• Task: Develop a checkout experience from cart to payment details with coupon functionality, payment confirmation, and dynamic theme configuration.
• Tech Stack: Next.js, TypeScript, Zustand/Redux, Tailwind.
• Source: LeetCode

5. Technical Round (Frontend-Specific)

• Questions:
  1. Write a function to access a deeply nested object property using a string path (e.g., 'user.config.details.name.first').
  2. Polyfills for Promise.any and other methods.
  3. Sorting algorithm used in C++ STL’s inbuilt sort function.
  4. Explanation of priority queues and min/max heaps.
• Source: LeetCode

6. HR Round

• Focus: Culture fitment, reasons for choosing Groww, and role preferences.

---

Key Topics for Preparation

• DSA: Arrays, Strings, Linked Lists, Trees, Graphs.
• OOPs: Design principles, polymorphism, inheritance.
• Frontend: React hooks, TypeScript, state management (Redux/Zustand).
• System Design: Basic design principles (e.g., vending machine, rate limiters).

---

Track: SDE-3 / Senior

SDE-3 / Senior

Round Breakdown

1. Low-Level Design (LLD) / Machine Coding

• Task: Design a stock liquidation system.
  • Focus: API contracts, database schemas, concurrency handling.
• Source: LeetCode

2. Machine Coding

• Task: Build a stock exchange system.
  • Features: Match buy/sell orders, retain unmatched orders, notify users.
  • Priority: Orders with better prices in case of multiple matches.
• Source: LeetCode

3. High-Level Design

• Task: Design an API hit counter system.
  • Features: Track and aggregate API hits per customer, enforce rate limits.
• Source: LeetCode

4. Managerial Round

• Focus: Evaluation of past work experiences and technical contributions.

5. HR / Culture Fit Round

• Focus: Discussion on favorite mobile/web apps, reasons for preference, and potential engineering improvements.

---

Key Topics for Preparation

• System Design: Stock exchange systems, API hit counters, rate limiting.
• Low-Level Design: Concurrency, API contracts, database schemas.
• Managerial: Leadership, scalability, and technical contributions.

---

Track: SDE-1 / New Grad

SDE-1 / New Grad

Online Assessment (OA) Format

• Platform: Typically conducted on platforms like HackerRank, Codility, or similar.
• Structure:
  • MCQs: 9 questions focusing on time complexity, OS, threading, and C++ basics.
  • Coding: 1 question (e.g., a variation of Minimum Cost for Tickets or subarray problems).
• Difficulty: Medium, testing foundational DSA and problem-solving skills.

Round Breakdown

1. Online Assessment (OA)

• Questions:
  1. Minimum Cost for Tickets (variation with days range 1 to 30).
  2. Subarray problems (e.g., count subarrays where length is k times the sum).
• Source: GeeksforGeeks

2. Technical Round

• Questions:
  1. Detect loop in a linked list.
  2. Next greater element.
  3. Poisoned wine bottle puzzle (using rats).
  4. Newspaper page numbering puzzle.
• Source: GeeksforGeeks

3. Technical Round (Advanced)

• Questions:
  1. Remove duplicates from a linked list II.
  2. Number of ways to decode a string (Dynamic Programming).
  3. Sliding window problem: Longest substring with k maximum distinct characters.
• Source: LeetCode

4. Low-Level Design Round

• Task: Implement a group chat functionality.
  • Admin can create up to 5 groups.
  • Users can join up to 20 groups.
  • Admin can add/remove users from groups.
• Duration: 90 minutes.
• Source: LeetCode

5. System Design Round

• Task: Design a rate limiter for a Flickr-like image service.
  • Premium users: 100 images/minute.
  • General users: 10 images/minute.
  • Handle requests exceeding limits.
• Source: LeetCode

6. Technical Round (Scenario-Based)

• Task: Solve a variation of the Two Heap Problem in a stock market trading context.
• Source: LeetCode

7. HR Round

• Focus: Behavioral questions, reasons for leaving current organization, and cultural fitment.

---

Key Topics for Preparation

• DSA: Arrays, Strings, Linked Lists, Trees, Graphs, Dynamic Programming.
• System Design: Rate limiters, chat systems, API design.
• Low-Level Design: OOPs principles, modularity, extensibility.
• Puzzles: Classic algorithmic puzzles (e.g., poisoned wine, newspaper puzzles).