Fivetran | SDE-2 | Offer After Graph + Parking Lot Rounds

• Location: Bangalore, India
• Application: Applied through LinkedIn
• Experience: 2.6 years
• Degree: B.Tech

Process

75-minute HackerRank OA → Technical Coding 1 → Technical Coding 2 → Design → Director → Offer

The interviewers were helpful throughout the process.

Round 1 — Online Assessment

The HackerRank assessment had one medium LeetCode-style problem and a 75-minute time limit.

Round 2 — Java, Databases, and Graph Coding

A senior software engineer ran this 45-minute interview.

The first 15 minutes covered Java and database fundamentals. The interviewer then gave a medium graph-traversal problem on HackerRank. The solution passed every test on the first attempt, and the interviewer followed up with questions about graph fundamentals.

Round 3 — Coding

Another senior software engineer ran the second 45-minute coding interview. The plan was to spend 30 minutes on one medium HackerRank problem and use the final 15 minutes for discussion.

The coding took the full interview. The interviewer was supportive and allowed the coding to continue, but the final submission passed 12 of 14 tests. Two days later, the recruiter confirmed that the process would continue.

Round 4 — Parking Lot Design

An architect ran this 30-minute design interview.

The interviewer asked for a parking lot system that could handle both two-wheeled and four-wheeled vehicles. The system needed to support the parking lot owner, people parking their vehicles, and the security guard.

A service breakdown and database schema were enough for the initial design. Once that was complete, the interviewer added new requirements and asked how the design would handle them. The interviewer also shared feedback at the end of the round.

Round 5 — Director

The director spent 30 minutes discussing previous experience, projects, coding practices, and behavioral topics.

Original Questions

Java

• What do static and final mean in Java?
• Can a static method be overloaded?
• What is the difference between static and dynamic binding?
• Can a Java class extend multiple classes?

Databases

• What is a foreign key?
• What is the difference between normalized and denormalized data?
• What are 1NF and 2NF?

Coding

• One medium graph-traversal problem on HackerRank
• One additional medium HackerRank problem

The report identifies the topics and difficulty but does not include either full coding prompt.

Design

Design a parking lot system for two-wheeled and four-wheeled vehicles. The system should support the parking lot owner, people parking their vehicles, and the security guard.

Follow-ups

• Answer graph-fundamentals questions after the first coding problem.
• Adjust the parking lot design when the interviewer adds new requirements.
• Explain how the services and database schema should change.

Result

The day after the director interview, HR confirmed that every round had been cleared and said an offer would follow within two days.

Key Takeaways

• Expect Java and database fundamentals alongside LeetCode-style coding.
• The second coding round advanced despite a 12-of-14 test result.
• The design round focused on services, database schema, and adapting to changing requirements.
• Both coding interviews were conducted on HackerRank.

Sources:

• LeetCode interview experience