GeeksforGeeks Question · Jul 2025 · USA

Infybeam Interview Experience | Set 1

Question Details

ROUND-1I. Field of interest(I told data structure and problem solving)II. projectIII. How to find whether a loop in a linked list is present or not if present then find t...

Full Details

ROUND-1 I. Field of interest(I told data structure and problem solving) II. project III. How to find whether a loop in a linked list is present or not & if present then find the point of loop. IV. An array consists of only 0,1 & 2 in an unsorted manner.sort the array. V. 8 queens problem(backtracking) VI. Coins with weight puzzle:100 bags with coins like 1st bag has 1 coin,2nd bag has 2 coins & so on.all the coins weigh 1gm but only one bag has coins with weight of 1.1 gm.identify the bag. VII. Swapping problem using pointer.(he wrote a code where input values for a,b variable has to be swapped.asked me to write the arguments for the function he used using pointers) VIII. Puzzle-4 person & a torch light problem. Round 2 • Given the inorder and preorder traversals, find the binary tree corresponding to them. • Given an array of integers and a value k, find a pair of array entries whose sum is equal to k. Brute force approach will not be considered. • Given a binary tree with parent pointers to every node in addition to the left child and right child pointers and a pointer to the root and a pointer to any node,

return the mirror node. What if the pointer to the root is not given? • What do you know about design patterns in Java? • How does singleton design pattern look like? • How to make the singleton design pattern thread-safe?

Free preview — 6 questions shown. Unlock all Infybeam questions →

About This Question

This is a reported interview question from a infybeam interview for a swe role during the onsite round reported in 2025.

It covers the following topics: Oop, Linked List, Trees, Binary Tree, Backtracking, Recursion, Arrays .

About Infybeam Interview Reports

This question was reported by a candidate who interviewed at Infybeam. 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 Infybeam are the higher-signal extractions to take from this report.

For broader preparation context, the Infybeam 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 Infybeam reports consistently are the ones worth investing in; one-off niche problems are not.

During Your Infybeam 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 Infybeam 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.