Blogvault

Role: Software Development Engineer (Likely)

College: Not Specified

Interview Date: 1st September 2022

Interview Type: On-Campus

Result: Not Specified

Difficulty: Medium to Hard

Rounds: 5 rounds

Topics Asked: Data Structures, Algorithms, Sorts, Puzzles, Tree Traversals, String Coding Questions, System Design, Projects, Technical Managerial questions

Experience:

BlogVault conducted a campus recruitment drive.

Round 1: Online Coding Round
This round took place on 1st September 2022, on the Interviewbit platform, lasting 1 hour. There were three coding questions, categorized as easy to medium (1 easy, 2 medium). Students who completed all 3 questions were shortlisted. Specific questions included:

• Return each character with count (related to this question)
• Maximum of Absolute Value Expression (almost same as GeeksforGeeks)
• One more question that was forgotten by the candidate.

Round 2: Technical Interview (Google Meet)
Approximately 40 students advanced to this round, conducted via Google Meet. Questions covered Sorts, puzzles, tree traversals, and string coding questions. The interviewer focused on achieving a certain outcome (e.g., job scheduling question, Inorder traversal implementation through a while loop) without using STL. Efficient solutions and least complexity were highly appreciated.

Round 3: Live Coding Round (CoderPad)
25 students reached this round. A coding environment (CoderPad) was provided for a string-based question with test cases, to be solved within 1 hour. Questions were asked about the logic used. The question was described as challenging and difficult, an extended version of wildcard pattern matching for this candidate. The choice of programming language was noted as influential in the final code.

Round 4: Technical Managerial Round
13 students proceeded to this round. It was a short technical managerial round that included questions about the candidate's background and three technical questions. Specific questions mentioned:

• Deletion of 1 node present in between x+y-1 nodes, with only 1 pointer given which points to the node to be deleted.
• Width of the binary tree.
• One more question that the candidate forgot.

Round 5: Founder's Round
This round involved a rigorous discussion on projects done in college. The founder also posed questions on how the candidate would approach a problem, for example, "how you will implement Google Maps". The questions were pointed at every aspect of the projects.