HUMMINGBIRD WEB SOLUTIONS PVT LTD interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
HUMMINGBIRD WEB SOLUTIONS PVT LTD
2 rounds | 2 Coding
problems
Selected Interview preparation journey
Journey
I was given three DSA questions: one on trees, one on dynamic programming, and one on the sliding window technique. I was able to successfully solve two out of the three questions.
Following this, I was invited to the Noida campus for further rounds. During the on-site interview, I solved two questions, including one based on BFS, and I was able to work through them effectively.
Additionally, I worked on an HLD question to design a system similar to Google Docs during the interview and had discussions on concepts related to JWT tokens, React, and Spring Boot.
Application story
Solved 2/3 DSA problems (Trie, DP on Trees, Segment Tree). At the Noida campus, I tackled BFS (Gas Station) and a sliding window problem, solved a puzzle, and discussed JWT, React, and Spring Boot.
Why selected/rejected for the role?
I was selected due to my solid problem-solving skills, demonstrated by solving most of the DSA questions, and my ability to approach challenging problems with clear reasoning. Additionally, my understanding of core concepts like JWT, React, and Spring Boot, along with effective communication during the interview, contributed to my selection.
Preparation
Duration: 1 months
Topics: Spring Boot, React, Trie, Segment Tree, DP
Tip 1: Prepare from official documentation.
Tip 2: Use YouTube videos to strengthen your understanding.
Tip 3: Dedicate sufficient time to practice consistently.
Application process
Where: Campus
Eligibility: Above 8 CGPA. (Salary package: 9 LPA)
Tip 1: Explain your projects clearly.
Tip 2: Prepare them thoroughly.
Interview rounds
01
Round
Easy
Video Call
Duration40 minutes
Interview date27 Oct 2025
Coding problem1
The round was conducted in the afternoon in a well-organized and comfortable environment. The overall atmosphere was positive and conducive to focused problem-solving.
The interviewer was friendly and approachable, which made it easier to communicate my thought process. In addition to solving coding questions, there was also a discussion on relevant technical concepts and a puzzle-solving activity.
1. Maximum value node
Easy
15m average time
80% success
0/40
Asked in companies
Given a BST (Binary search tree) with N number of distinct nodes and two nodes ‘X’ and ‘Y’ (which are definitely present in the input BST). You need to find the value of the maximum node that lies in between the nodes ‘X’ and ‘Y’ (both inclusive) in the given BST.
A binary search tree (BST) is a binary tree data structure which has the following properties.
• The left subtree of a node contains only nodes with data less than the node’s data.
• The right subtree of a node contains only nodes with data greater than the node’s data.
• Both the left and right subtrees must also be binary search trees.
Note:
1. All the elements of the Binary Search Tree are unique.
2. You can’t use the same node value/element of BST twice.
Problem approach
Tip 1: Clearly define DP states for each node (e.g., include/exclude cases) before coding.
Tip 2: Use DFS to propagate values from children to the parent while maintaining constraints.
Tip 3: Carefully handle base cases and edge conditions to avoid incorrect transitions.
02
Round
Easy
Video Call
Duration40 minutes
Interview date27 Oct 2025
Coding problem1
The round was conducted in the afternoon in a well-organized and comfortable environment. The overall atmosphere was positive and conducive to focused problem-solving.
The interviewer was friendly and approachable, which made it easier to communicate my thought process. In addition to solving coding questions, there was also a discussion on relevant technical concepts and a puzzle-solving activity.
1. Longest Substring Without Repeating Characters
Moderate
30m average time
65% success
0/80
Asked in companies
Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.
Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.
Problem approach
Tip 1: Use two pointers (left and right) to maintain a dynamic window and expand it while the characters are unique.
Tip 2: Use a hash set or map to track characters and quickly detect duplicates.
Tip 3: When a duplicate is found, shrink the window from the left until the constraint is satisfied again.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which data structure is used to implement a DFS?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
5027 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
1077 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6697 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3720 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
Rejected
15659 views
4 comments
0 upvotes
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
Selected 15563 views
1 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
Selected 10248 views
2 comments
0 upvotes