Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Bhanzu Team. If you also belong to the team, you can get access from here

Bhanzu Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Bhanzu Senior Software Developer Interview Questions and Answers

Updated 18 Mar 2023

Bhanzu Senior Software Developer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Sep 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

1 round of dsa with 2 questions

Round 3 - Technical 

(2 Questions)

  • Q1. 1 system design round
  • Q2. LLD round for 30 minutes
Round 4 - Technical 

(2 Questions)

  • Q1. Previous project discussion
  • Q2. Discuss past project, tech stack for 30 mins
  • Ans. 

    Developed a web-based project management tool using React, Node.js, and MongoDB.

    • Used React for the front-end development

    • Used Node.js for the back-end development

    • Used MongoDB for the database management

    • Implemented features like task assignment, progress tracking, and file sharing

    • Followed Agile methodology for project management

  • Answered by AI
Round 5 - HR 

(1 Question)

  • Q1. Basic hr questions, salary discussion

Interview Preparation Tips

Interview preparation tips for other job seekers - Stay calm during the interview, communite clearly and brush through system design interviews.

Interview questions from similar companies

I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Questions on Java,SQL,some trending technologies(IOT,Big data),pattern questions, programming questions with different approaches.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basics of DSA, have knowledge about the databases, some common dml ,ddl statements, programming knowledge of a particular language like C,Java, python,etc...have good command on oops concepts... little bit of frameworks knowledge will also help

I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.

Round 1 - Aptitude Test 
Round 2 - Technical 

(1 Question)

  • Q1. Basic questions of java.
Round 3 - HR 

(1 Question)

  • Q1. Intro and other hr related questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - Cover the basic questions regarding the programming language.

I applied via Approached by Company and was interviewed before Apr 2021. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Aptitude Test 

My resume

Round 3 - HR 

(3 Questions)

  • Q1. What are your salary expectations?
  • Q2. What are your strengths and weaknesses?
  • Q3. Tell me about yourself.

Interview Preparation Tips

Interview preparation tips for other job seekers - I like the it companies and technologies
Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
More than 8 weeks
Result
Not Selected

I applied via Walk-in and was interviewed before Jan 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Double-check your resume for any spelling mistakes. The recruiter may consider spelling mistakes as careless behavior or poor communication skills.
View all Resume tips
Round 2 - Aptitude Test 

Aptitude test duration 90 min 100 question

Round 3 - Coding Test 

Coding test 50 code 100 marks 60 min

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well. code in c , c++ , java is very important

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.

Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix

Tips: All question were from geeksforgeeks
So practice it well ..u will make through it

Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible

Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...

Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens

Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar

I applied via Walk-in and was interviewed before Jul 2021. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. .net questions - routing in asp.net MVC ?

Interview Preparation Tips

Interview preparation tips for other job seekers - Nothing . Prepare well for interview on .Net technology stack

I applied via Company Website and was interviewed before Jun 2021. There were 2 interview rounds.

Round 1 - Aptitude Test 

First round was coding as well as aptitude done together went well I guess focusing on codes helps a lot.

Round 2 - Technical 

(1 Question)

  • Q1. 2nd round included tr and mr round went quite enegritic

Interview Preparation Tips

Interview preparation tips for other job seekers - Resume skills matters a lot don't fill resume the technologies you don't even aware of

I applied via Campus Placement and was interviewed before Jan 2021. There were 2 interview rounds.

Round 1 - Aptitude Test 

Good

Round 2 - Technical 

(1 Question)

  • Q1. Basic question from C++.Some questions from Data structure and computer architecture.

Interview Preparation Tips

Topics to prepare for TCS Software Engineer interview:
  • C++
Interview preparation tips for other job seekers - Prepare well. Aptitude is not very easy so you have to prepare well.

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.

  • Q1. 

    K-th Largest Number in a BST

    Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.

    If there is no K-th la...

  • Ans. 

    Find the K-th largest element in a BST.

    • Perform reverse in-order traversal of the BST to find the K-th largest element.

    • Keep track of the count of visited nodes to determine the K-th largest element.

    • Return -1 if there is no K-th largest element in the BST.

  • Answered by AI
  • Q2. 

    Is Height Balanced Binary Tree Problem Statement

    Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:

    1. The left subtree is balanced.
    2. The right subtree is bala...
  • Ans. 

    Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.

    • Check if the left subtree is balanced

    • Check if the right subtree is balanced

    • Calculate the height difference between the left and right subtrees

    • Return 'True' if all conditions are met, otherwise return 'False'

  • Answered by AI
  • Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
  • Ans. 

    Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.

    • Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.

    • Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.

    • Orphan p...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .

  • Q1. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character in the string.

    • Update the start index of the window when a repeating character is found.

    • Calculate the maximum length of the window as you iterate through the string.

    • Return the maximum le

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Use binary search to efficiently search for integers in the rotated sorted array.

    • Handle the rotation of the array while performing binary search.

    • Return the index of the integer if found, else return -1.

  • Answered by AI
  • Q3. 

    Count Subarrays with Sum Divisible by K

    Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.

    Input:

    The first line of input contains an...
  • Ans. 

    Count subarrays with sum divisible by K in an array.

    • Iterate through the array and keep track of the prefix sum modulo K.

    • Use a hashmap to store the frequency of each prefix sum modulo K.

    • For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.

    • Handle the case when prefix sum itself is divisible by K.

    • Return the total count of subarrays with sum divisible by K.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.

  • Q1. 

    Ceil Value from BST Problem Statement

    Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.

    The ceil of an integer is defined as the s...

  • Ans. 

    Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.

    • Traverse the BST to find the closest value greater than or equal to the key.

    • Compare the key with the current node value and update the ceil value accordingly.

    • Recursively move to the left or right subtree based on the comparison.

    • Return the ceil value once the traversal is complete.

  • Answered by AI
  • Q2. 

    Design a Constant Time Data Structure

    Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:

    1. INSERT(key, value): Add or update t...
  • Ans. 

    Design a constant time data structure to maintain mappings between keys and values with various operations.

    • Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.

    • Keep track of the number of key-value pairs for GET_SIZE operation.

    • Check if the hash table is empty for IS_EMPTY operation.

    • Return true or false for SEARCH operation based on key existence.

    • Return the value associated...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Bhanzu Interview FAQs

How many rounds are there in Bhanzu Senior Software Developer interview?
Bhanzu interview process usually has 5 rounds. The most common rounds in the Bhanzu interview process are Technical, Coding Test and HR.
What are the top questions asked in Bhanzu Senior Software Developer interview?

Some of the top questions asked at the Bhanzu Senior Software Developer interview -

  1. Discuss past project, tech stack for 30 m...read more
  2. 1 system design ro...read more
  3. LLD round for 30 minu...read more

Recently Viewed

CAMPUS PLACEMENT

Pune University

INTERVIEWS

DXC Technology

No Interviews

INTERVIEWS

TCS

No Interviews

INTERVIEWS

GlobalLogic

No Interviews

INTERVIEWS

Novel Office

No Interviews

INTERVIEWS

Natco Pharma

No Interviews

INTERVIEWS

CapitalOne

No Interviews

INTERVIEWS

CitiusTech

No Interviews

INTERVIEWS

ThoughtWorks

No Interviews

INTERVIEWS

FIS

No Interviews

Tell us how to improve this page.

Bhanzu Senior Software Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Bhanzu Senior Software Developer Reviews and Ratings

based on 1 review

2.0/5

Rating in categories

1.0

Skill development

3.0

Work-life balance

4.0

Salary

1.0

Job security

1.0

Company culture

1.0

Promotions

1.0

Work satisfaction

Explore 1 Review and Rating
Sales Manager
117 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Development Associate
55 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Trainer
48 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Maths Teacher
25 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Maths Trainer
18 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Bhanzu with

Ola Cabs

3.4
Compare

Flipkart

4.0
Compare

Paytm

3.3
Compare

Zomato

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent