Interview Stages

Round 1: Technical Screening

• Process: 70-minute coding assessment with 4 problems.
• Problems:
  • Problem 1: Basic list operations.
  • Problem 2: Train schedule problem (e.g., find the most recent departure time given current time).
  • Problem 3: Graph-related problem (did not attempt due to time constraints).
  • Problem 4: Operations on two lists (one operation modifies the secondary list, the other counts pairs summing to a target).
• Focus: Time management and handling edge cases (e.g., duplicate numbers in two-sum variant).

Personal Reflection:

• Struggled with time, especially on the two-sum variant with duplicates.
• Realized the issue with dictionary approach for counting pairs but ran out of time to fix.