TechJobs Hiring A community-driven job board helping engineers discover high-impact roles at companies building the future.
© 2026 TechJobs Hiring. All rights reserved.
Built for the developer community.
← Back to all experiences Interview Rounds Breakdown
Technical Round 1 Data Structures Algorithms BFS
The candidate initially proposed a sub-optimal recursive approach followed by a per-house BFS approach.
The interviewer challenged the candidate's logic regarding the visited array management during the BFS process.
The candidate successfully defended the necessity of maintaining a global minimum distance matrix while explaining the multi-source BFS optimization.
The interviewer acknowledged a momentary confusion and expressed satisfaction with the candidate's final optimized approach.
Given a 2D matrix of houses (H) and stores (S), find the minimum moves from each house to the nearest store. Graphs BFS Matrix
Solve
Technical + HR Round1 hour String Manipulation Behavioral Project Discussion
The round began with a discussion on favorite subjects and project experiences.
The candidate clarified requirements regarding overlapping tags and repeated occurrences before starting the implementation.
Key Takeaways & Advice Candidate Advice Ensure a thorough understanding of the problem statement before coding to avoid solving the wrong problem. Avoid over-complicating the problem by asking unnecessary questions that might make the implementation more tedious than required. Time management is crucial; ensure the approach is validated before committing to code.
Final Verdict The candidate was unfortunately rejected.
Experience Details Experience Level 1-3 Years
TechJobs Hiring A community-driven job board helping engineers discover high-impact roles at companies building the future.
© 2026 TechJobs Hiring. All rights reserved.
Built for the developer community.
The candidate proposed an optimized approach using a boolean array to track indices that require bolding, avoiding brute force.
The interviewer requested the candidate to write the code first before explaining, and subsequently asked for debugging statements to be added to the implementation.
The candidate demonstrated robustness by providing self-generated test cases to verify the solution.
Given a string and a list of tags, wrap all occurrences of the tags in the string with bold tags (<b>...</b>), ensuring overlapping tags are handled correctly. Strings Implementation
Solve
Avoid spending excessive time explaining sub-optimal solutions; pivot quickly to optimization.
Maintain confidence when challenged by interviewers; clearly explain the reasoning behind technical choices.
Clarify all edge cases and requirements with the interviewer before beginning the implementation to avoid wasted effort.
Proactively provide test cases to demonstrate the correctness of the solution.