EagleView

Role: SDE-1

College: Not Specified

Interview Date: Not Specified

Interview Type: Full-Time

Result: Selected (Implied)

Difficulty: Medium

Rounds: 4 rounds

Topics Asked: Data Structures, Algorithms, CS Fundamentals (Semaphore, tree traversal, Polymorphism, TCP/UDP, status codes), SQL, Binary Search, Queue implementation, Projects, Work Experience

Experience:

This interview experience for an SDE-1 role at EagleView involved four rounds.

Round 1: Online Coding Round (90 minutes)
This round consisted of 3 Data Structures and Algorithms questions. Candidates could choose any programming language. The questions were similar in concept and logic to LeetCode medium problems, especially string-related questions. The candidate completed 2 out of 3 questions and was selected for the next round.

Round 2: Online Technical Interview (60 minutes)
The interviewer started with an introduction and questions about projects and any work experience. Following this, two DSA questions were asked. One question involved finding an approach with O(n) time complexity and O(n) space complexity, then optimizing it to constant space. The other question required an initial O(n^3) approach to be optimized. Additionally, questions on CS fundamentals were asked, including Semaphore, tree traversal, Polymorphism, TCP/UDP, and status codes. The interviewer was supportive. The suggestion was to explain the approach thoroughly and use meaningful variable names.

Round 3: Online Technical Interview (90 minutes)
This round began with a discussion of the candidate's resume, focusing on projects and internships. Candidates were advised to be knowledgeable about everything mentioned in their resume. Problem-solving questions were then posed. One question involved writing an SQL query, which the candidate initially wrote with O(n^2) complexity but was unable to optimize further. Another problem involved a BFS approach using a priority queue, where the interviewer asked about a DP approach. The candidate successfully explained why DP would fail in that specific example. Other questions included optimizing binary search and implementing a queue. The candidate was selected for the next round after a few days.

Round 4: Non-Technical Round (30 minutes)
This round focused on basic questions about studies, college, and included some puzzles and situational questions.