🎯 Process Overview

📌 Stages:

• Online Assessment
• Technical Interviews: Round 1 & Round 2
• HR Interview

📝 Online Assessment

The assessment consisted of *two sets, where *one question was common across both sets.

• My Set: This set was relatively easier.
  • Question 1: A standard string manipulation question.
  • Question 2: A Fibonacci pattern-based question. This was *challenging to interpret, but upon careful observation of the test cases, the *pattern could be deciphered.

🛠 Interview Rounds

🔹 Technical Interview — Round 1

👥 Candidate Count: Approximately 20–25 candidates.
⏳ Interview Duration: 1 hour 10 minutes (longest among all candidates).
💻 Mode: Online

📝 Questions:

• Mathematical & Bit Manipulation:

  • A few questions related to basic math and bitwise operations.

• Data Structures:

  • Linked List: Dividing a linked list into k parts and performing some operation.
  • Graphs: Questions focused on DFS and BFS traversal methods.

• Computer Science Concepts:

  • Kernel: Explained the basic concept of the kernel.
  • Abstraction and Encapsulation: Discussed these fundamental OOP concepts.

🔹 Technical Interview — Round 2

👥 Candidate Count: Reduced to 10 candidates.

⚠ Challenges:

• Limited time remaining for the interview because of the last round.
• My interviewer had some personal issues with clear communication, which added a bit of difficulty.

📝 Questions:

• Introduction:

  • Briefly introduced myself.

• Technical Questions:

  • String manipulation questions.
  • A graph-based question.
  • Pattern Matching: A string pattern-matching question where the optimal solution involved using a Trie data structure.
    • I implemented the solution but faced difficulty in managing the end-of-string marker to check if a word was fully formed.

❌ Verdict:

• Outcome: Not selected.

🔍 Observations:

• Candidates who cleared Round 2 were offered the position, with **three candidates receiving Pre-Placement Offers (PPOs).