Dev Rev

Role: Software Intern

College: Not Specified (On-Campus)

Interview Date: Approximately September 2024

Interview Type: On-Campus

Result: Selected (for further rounds)

Difficulty: Medium to Hard (OA), Easy/Moderate (Technical Coding Round)

Rounds: Online Assessment, Technical Round (Coding) (at least two rounds detailed)

Topics Asked: Data Structures and Algorithms (LeetCode medium/hard), Merge Intervals, Minimum Swaps required to group all 1's together (circular array), Operating Systems (Concurrency, Deadlock conditions), React (Class/Component based architecture, hooks, features).

Experience:

The candidate applied for a Software Intern role at DevRev through on-campus recruitment approximately three months before December 23, 2024.

Round 1: Online Assessment (OA): This round consisted of four questions. Three were LeetCode-medium, and one was LeetCode-hard. The candidate solved two questions fully and the third partially. After this round, the candidate was initially waitlisted but was informed of selection for the next rounds three weeks later.

Round 2: Technical Round (Coding): A one-hour technical coding round was scheduled. The interviewer, an experienced QA engineer, was supportive. Two standard LeetCode problems from Striver Sheet were presented:

• Problem 1: Merge Intervals: Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
• Problem 2: Minimum Swaps required to group all 1's together: A swap is defined as taking two distinct positions in an array and swapping the values in them. A circular array is defined as an array where the first and last elements are considered adjacent. Given a binary circular array nums, return the minimum number of swaps required to group all 1's present in the array together at any location.

After the DSA questions, the interviewer asked about the candidate's favorite core subject. Upon answering OS, questions were posed on Concurrency and Conditions for deadlock. Additionally, questions were asked about the difference between React Class/Component based architecture, hooks, and features of React. The interviewer seemed satisfied with the answers. The round went well, with the candidate able to run all test cases and explain the approach optimally.