Digital Specialist Engineer (DSE)
Interview Date
March 8 (Interview), April 12 (Offer)
Result
Selected
Difficulty
Medium to Hard
Rounds
2 rounds (Online Assessment, Technical Interview)
Drive Type
Off-Campus
Topics asked
Detailed experience
College: Not Specified
Interview Date: March 8 (Interview), April 12 (Offer)
Interview Type: Off-Campus
Result: Selected
Difficulty: Medium to Hard
Rounds: 2 rounds (Online Assessment, Technical Interview)
Topics Asked: Data Structures (Arrays, Searching, Sorting, Dynamic Programming), Algorithms, Prime Numbers, Square Calculation, C/C++, DBMS (Joins, Primary Key, Foreign Key, DELETE, TRUNCATE, DROP commands)
The candidate applied for an off-campus drive on December 13, 2021, and was shortlisted on January 15. The online test link was received on January 27.
Online Round: This round was 3 hours long and consisted of 3 coding questions, with no MCQs or technical questions. The questions were based on Data Structures and Algorithms (DSA) and ranged from medium to hard difficulty. The candidate reported that the first question was based on arrays, the second on searching and sorting, and the third seemed to be based on Dynamic Programming. They were able to solve the first question fully and part of the second. Solving more than 2 questions could lead to a Specialist Programmer role.
Technical Interview: The interviewer was experienced. After a brief introduction, two questions were posed: to determine if given numbers are prime, and to calculate the square of 19 without direct calculation. The candidate was asked to share their screen and open an online compiler, preferring C/C++. They were also asked to input an array and determine if its elements are prime or not, and to print N Fibonacci numbers. The interviewer also inquired about the candidate's proficiency in databases, asking theoretical questions on DBMS topics like types of joins, primary key, foreign key, DELETE, TRUNCATE, and DROP commands.
Tips and Suggestions: The candidate prepared by solving over 140 problems on GeeksforGeeks, HackerRank, and LeetCode (90+), and participated in Competitive Programming contests on CodeChef. For DSA, they referred to GFG articles, YouTube resources, and "Data Structures and Algorithms made easy" by Narasimha Karumanchi.