Bidgely Interview experience | Set 2 ( Software Engineer)
Question Details
Aptitude and Coding RoundThis round consisted of 12 questions including 10 general aptitude and 2 coding questions. The aptitude part comprised of questions on speed, dis...
Full Details
Aptitude and Coding Round This round consisted of 12 questions including 10 general aptitude and 2 coding questions. The aptitude part comprised of questions on speed, distance & time, permutation & combination, probability, and other general mathematical concepts. The 2 coding questions were based on digit sum of a number and decimal to binary conversion of a string. The aptitude questions were multiple choice type with a marking of +2 and -1. I could solve 7 aptitude and 1 coding question after which i was selected for the interviews.
Interview Round 1 The interviews took place at Bidgely's office which is located at the outer ring road near Bellandur. This round started off with the customary question: “ Tell me about yourself ? ”. I introduced myself to the interviewer and told him about the various academic projects i undertook. He took specific interest in my DBMS project which I thoroughly explained to him using an E-R diagram. Further, this round was mostly about data structures, specially trees. I was asked few simple concepts such as DFS , BFS , tree traversals and their respective pseudo codes. There were questions on conversion for pre-order to post-order given the inorder, level order traversal of a tree using a queue. The last question for the round was on the Dijkstra's algorithm and its modification .
Interview Round 2 The level of difficulty of questions increased in this round. The first question that the interviewer asked me was to divide a given array into 3 variable stacks and the generalize the code for 'n' stacks. I used n+1 arrays, one for keeping the track of empty places in the array (array coloring), and the rest 'n' for keeping a track for previous stack tops. Next question was to store a tree in a database. Basically, i had to explain him the structure of the database table.
Interview Round 3 This was a short round with just one question: “ How do you find the number of unique users visiting a web page within a bracket of one hour ?”. I used queues to count the users and the concept of cookies to keep a track of uniqueness. After this, I was selected for the profile of Software Engineer. Sources Referred www.hackerrank.com www.geeksforgeeks.org
About This Question
This is a reported interview question from a bidgely interview for a swe role during the oa round reported in 2025.
It covers the following topics: Trees, Strings, Binary Tree, Sql, Probability Stats, Stack Queue, Networking, Graph, Backtracking, Graphs, Queue, Arrays, Stack .
Difficulty rating: Easy
Topics
About Bidgely Interview Reports
This question was reported by a candidate who interviewed at Bidgely. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Bidgely are the higher-signal extractions to take from this report.
For broader preparation context, the Bidgely interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Bidgely reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Bidgely Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Bidgely reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.