Role: SDE Internship
College: Not Specified (On-Campus)
Interview Date: 2020
Interview Type: On-Campus/Internship
Result: Selected
Difficulty: Medium
Rounds: 2 rounds
Topics Asked: Data Structures, Algorithms, Operating Systems, DBMS, Projects, Internships, Scenario-based questions
Experience:
The selection process for the SDE Internship at Hyperverge consisted of two rounds.
Round 1: Online Coding Round (3 hours)
This round had 6 sections, each with one coding problem.
- Find repeating and missing numbers from the array.
- Find the median of two sorted arrays.
- Given an array of piles where at each index there are some plates, find at which pile the Nth plate belongs (Hint: use prefix sum and binary search).
- Given an array A of size N and integers B, C, D, find all possible unordered pairs (i,j) such that (1<=i
- Given an array consisting of both positive and negative integers, maximize the array sum after K negations.
- Given a string of operators and numbers, return all possible results (e.g., "2*3-4*5").
Out of 300 candidates, 20 were shortlisted for the next round.
Round 2: Interview Round (1 hour)
This round focused on projects and technical knowledge.
- Discussion about projects (technologies used, motivation, difficulties faced).
- Questions about internships mentioned in the resume.
- Technical questions related to Operating Systems (virtual memory, paging, page replacement algorithms).
- Technical questions related to DBMS (Primary key, JOIN operations, Normal forms, etc.).
- Discussion on the approach taken for coding problem-3 from Round 1.
- A scenario-based question was asked, where the candidate had to explain how Hyperverge's technology could provide a solution for the given problem.
The overall experience was very good, and the interviewers were highly cooperative.