CUREFIT

Role: SDE Summer Internship

College: Not Specified

Interview Date: August (reported July 2025)

Interview Type: On-Campus (Summer Internship)

Result: Not Specified

Difficulty: Medium to Hard

Rounds: 3 rounds (Online Assessment + 2 Technical Rounds)

Topics Asked: Data Structures, Algorithms, Binary Search, Binary Lifting, Dynamic Programming, Graph Algorithms, Projects.

Experience:

The process began with resume shortlisting, leading to an Online Assessment for approximately 200 candidates.

Online Assessment: This was a 1-hour round on HackerEarth with two coding questions. One question involved the concept of binary search, and the other focused on binary lifting. The candidate was able to complete the first question fully and the second partially.

First Round (Technical): This round started with introductions. The interviewer asked the candidate to explain one of their resume projects. Following this, a variation of the subset problem, similar to LeetCode's Target Sum, was asked, which the candidate optimized using dynamic programming and coded on a Google Doc. Another question on binary search, similar to one on CSES, was posed, for which only intuition was required. Finally, the Gas Station problem from LeetCode was asked, and the candidate quickly provided and explained the optimal solution with a dry run. The interviewer was reportedly impressed.

Second Round (Technical): This round started with a 15-minute discussion about the candidate's project, including learnings and difficult parts. The interviewer then asked a subtle variation of the minimum platforms question, which the candidate explained and coded quickly. A string matching question followed, for which only a brute-force solution was written, and the round ended before an optimized approach could be fully developed.