Location: Not disclosed
Application: Direct application through the Fivetran careers page
Language: Java only for the online assessment

Process

Direct application → HackerRank online assessment → Recruiter call → 60-minute technical interview → Rejection

What Happened in Each Round

1. HackerRank Online Assessment

The assessment contained one Java-only coding problem about managing employee scores.
A heap-based solution was submitted, but two or three test cases failed. Despite the partial result, the recruiter moved the process forward.

2. Recruiter Call

The recruiter confirmed that the assessment had cleared the screening threshold and explained that two technical interview rounds would follow.

Headsup: Round 2 would only be scheduled after passing Round 1.

3. Round 1 — Technical Interview

The interview lasted one hour and contained two DSA problems.

Problem 1: Longest Increasing Subsequence

The interviewer asked for a solution to the Longest Increasing Subsequence problem.

The solution was developed by first describing a decision tree and identifying overlapping subproblems. This led to an O(n²) dynamic-programming approach.

The interviewer and interviewee then walked through a sample input together before the solution was implemented. The final code passed all test cases.

Problem 2: Aladdin and the Magic Carpet

The interviewer presented a problem called “Aladdin and the Magic Carpet.”

After the problem initially caused some confusion, the interviewer clarified the requirements. A greedy solution was then implemented.

The first implementation failed several tests because of a bug in the minimum-fuel calculation. After the bug was identified and fixed, the revised solution passed all test cases.

Result

After several days without an update, a follow-up was sent to the recruiter.

The recruiter responded that the interview feedback was not positive and that the process would not continue. No detailed rejection reason was provided.