Boomerang Commerce Interview Experience | Set 2 (Associate Software Developer 1)
Question Details
There were 6 rounds in total.1) Online
coding hackerearthThree Questions in 1.15hr. Total 50 marks.Questions were in increasing order of the difficulty as per the marks....
Full Details
There were 6 rounds in total. 1) Online
coding hackerearth Three Questions in 1.15hr. Total 50 marks. Questions were in increasing order of the difficulty as per the marks. You can code only in Java. I remember 2 questions 1) Two friends friend list were given. You have to find the mutual friends of both the friends.(15marks) 2) Question was based on Tree. For example -
input will be no. of nodes and their position and output should be yes or no depending upon whether a valid tree will be formed or not.(-) represents root node For Example - 6 l lr r - ll rl ans will be yes 6 l lr rl - ll rll ans will be no- because rl doesn't have a parent node (r) 2) Skype Round 1) A number was given. You have to make just greater number than that number. 2) Two strings were given .Print all the strings that can be formed by both the strings and additional constraint was sequence of characters in each string should remain same. For example - "abc" and "xyz" axybcz - is a valid string but axyczb is not valid because order of b and c has been changed. 3) f2f 1) Given an array count boomerang pairs which means a[i] > a[j] and i < j. Implementation of merge sort basically with a slight change. 2) Right view of a Binary tree. Discussion on projects. Java Questions. 4) Machine Coding Round A problem statement will be given and you don't have to code. They will give you the access of server box.
Problem statement will check your googling skills and how much time you take to do a new thing. In my case I had to install erlang and a webframework for it. 1) Then a web service to print hello world. 2) Web service to put a string in db fetch that string from db and print hello string. 5) f2f 1) 3 Sorted Arrays were given. Find a triplet such that maximum - minimum in that triplet is minimum of all the triplets and while selecting a triplet number should be there from each array. 2) 0 and 1 matrix was given. Flip operation can be done on a matrix. Flip means if we are doing a flip on a particular column all the elements of column will be reversed and flip can be done only on the columns. Flips can be done n number of times.
Output - Maximum no. of rows that will contain all same elements after flips in a matrix. You can do infinite flips. Discussion on last company projects. 6) F2F Write a Complete Class Design and code -
input - From command line a string Output - total words unique words most occurred word frequency of most occurred word General Discussion of company's work,policies and all. 7)HR Normal Discussion round Important Points - 1) Write a complete code, atleast explain your approach completely 2) Take care of all the test cases and checks( very important).
About Boomerang Commerce Interview Reports
This question was reported by a candidate who interviewed at Boomerang Commerce. 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 Boomerang Commerce are the higher-signal extractions to take from this report.
For broader preparation context, the Boomerang Commerce 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 Boomerang Commerce reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Boomerang Commerce 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 Boomerang Commerce 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.