Buyhatke

Role: Internship

College: Not Specified (On-Campus)

Interview Date: July 2020

Interview Type: On-Campus/Internship

Result: Rejected

Difficulty: Medium to Hard

Rounds: 3 rounds

Topics Asked: Data Structures, Algorithms (Triplets with zero sum, Zigzag String, Hamiltonian Cycle, First Non-Repeating Character, Peak Element, Bit Manipulation, Graph Shortest Path/Dijkstra), JavaScript (Asynchronous JavaScript, Promises), Projects, LP questions, Hackathons.

Experience:

BuyHatke visited campus for internships and full-time roles, with around 200 students shortlisted based on resumes. The interview consisted of 3 rounds.

Round 1 (Online Coding Round): This round was on the Interviewbit platform and comprised 4 coding questions ranging from medium to hard:

• All distinct triplets whose sum equals 0.
• Zigzag string Conversion.
• Mark all Hamiltonian Cycles in a given graph.
• Find the first non-repeating character in a stream of characters (print '#' if not found).

The candidate solved all four questions, and 25 students were selected for the next round.

Round 2 (Technical Interview Round): Conducted via Skype by a panel of 5 interviewers. It started with a 15-20 minute introduction, LP questions, and questions about hackathon experiences and websites made by the candidate.

A JavaScript question was asked: "What is asynchronous JavaScript?".

Coding questions followed:

• Question on arrays: Finding a peak element in the array (return any element greater than its adjacents, e.g., for output is 6). A binary search solution with O(log n) complexity was provided and accepted.
• Question on Bit manipulation: Given a number and integer K, return a number after offsetting all the bits after K in the binary representation of the given number, without loops or recursion (e.g., num=15, K=2, output=3). Solution: Num & (pow(2,K)-1).
• Question on graph: Given a Directed positive weighted graph with source and destination node, find the shortest path. The candidate suggested Floyd Warshall, but the interviewer was not satisfied and hinted at running Dijkstra four times.

The candidate was ultimately rejected, as all 25 students were rejected in this process.