Buyhatke

Role: Internship

College: Not Specified (On-Campus)

Interview Date: March 30, 2021

Interview Type: On-Campus/Internship

Result: Selected

Difficulty: Hard

Rounds: 3 rounds

Topics Asked: Data Structures (Linked List, Trees, DFS, BFS), Algorithms (Dynamic Programming, Binary Search), Operating Systems, OOPS, DBMS, React, JavaScript, Projects.

Experience:

The interview process consisted of a Coding Round followed by two Technical Interview Rounds.

Coding Round: This round had 4 hard problems, including concepts like dynamic programming and binary search. 20 students were shortlisted after this round.

Technical Round 1: The interviewer started with an introduction and discussion of projects. Questions were asked on OS (scheduling algorithms, memory management), OOPS (basic concepts, abstract classes), and DBMS (types of keys). Following this, 3 Data Structures and Algorithms questions were asked:

• Delete a node in a linked list when the head pointer is not provided in O(1) time.
• Check if a number is a power of 2 in O(1) time.
• Given an array, return the number of pairs whose sum was divisible by k.

4 students were selected for the second technical interview.

Technical Round 2: This round also began with introductions and a discussion of projects. 3 Data Structures and Algorithms questions were posed:

• A question involving trees, solvable using simple DFS traversal.
• A question involving BFS traversal in a matrix, followed by a request to differentiate between DFS and BFS.
• A hard dynamic programming question that took a significant amount of time to solve.

Finally, questions on React and JavaScript were asked, based on the technologies mentioned in the resume. After this round, 3 students were selected for the internship.