Groww OA Experience
Summary
I completed Groww's online assessment, which included 10 MCQs and two DSA coding questions—a Digit DP problem and a knight‑move problem.
Full Experience
I recently appeared for the Groww Online Assessment through the on-campus placement process at a Tier 2 college. The offered compensation was 26 LPA (18 LPA fixed + 2 LPA variable + 2 LPA joining bonus + 4 LPA ESOPs), with an internship stipend of ₹1 LPM.
The assessment consisted of 10 MCQs followed by 2 DSA coding questions.
The MCQs covered OOP, DBMS, CN, and OS.
The first coding question was a Digit DP problem. Given a range [L, R], the task was to count the numbers whose binary representation contains the substring "101" (referred to as fortunate numbers). The objective was to print the count of such numbers within the given range.
The second coding question involved finding the minimum number of moves for a knight on a chessboard to travel from a given starting coordinate (x₁, y₁) to a target coordinate (x₂, y₂). If the destination could not be reached, the required output was -1.
Interview Questions (2)
Count numbers with binary substring "101" (Digit DP)
Given a range [L, R], count the numbers whose binary representation contains the substring "101" (called fortunate numbers). Print the count of such numbers within the given range.
Minimum knight moves on a chessboard
Find the minimum number of moves for a knight on a chessboard to travel from a starting coordinate (x₁, y₁) to a target coordinate (x₂, y₂). If the destination cannot be reached, output -1.