Premium Employer

i

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

BONbLOC Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

BONbLOC Lead Software Engineer Interview Questions and Answers

Updated 19 Feb 2025

BONbLOC Lead Software Engineer Interview Experiences

2 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Difference between view and m-view
  • Ans. 

    View is a virtual table based on a SQL query, while materialized view (m-view) is a physical copy of the data from the query.

    • View is a virtual table that does not store data physically, while m-view is a physical copy of the data.

    • Views are updated dynamically when queried, while m-views need to be refreshed to update the data.

    • M-views are useful for improving query performance by pre-computing and storing results.

  • Answered by AI

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed before Feb 2024.

Round 1 - Coding Test 

Asked basic java questions

Interview Preparation Tips

Interview preparation tips for other job seekers - skip this company there is nothing here

Lead Software Engineer Interview Questions Asked at Other Companies

asked in Freshworks
Q1. Square Root with Decimal Precision Problem Statement You are prov ... read more
asked in Freshworks
Q2. Vertical Order Traversal Problem Statement You are given a binary ... read more
asked in Epsilon
Q3. If we have 2 tables with the same schema, one table has indexes a ... read more
asked in Freshworks
Q4. Power Calculation Problem Statement Given a number x and an expon ... read more
asked in Freshworks
Q5. Longest Unique Substring Problem Statement Given a string input o ... read more

Interview questions from similar companies

Round 1 - One-on-one 

(1 Question)

  • Q1. AlgoDS, Project Related and System Design
Round 2 - One-on-one 

(1 Question)

  • Q1. Project related and managerial questions
Round 3 - HR 

(3 Questions)

  • Q1. What are your salary expectations?
  • Q2. Share details of your previous job.
  • Q3. What are your strengths and weaknesses?

Interview Preparation Tips

Interview preparation tips for other job seekers - Brush the previous project deeply

I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Given a 2d matrix with some D doors and W walls, we need fill distance matrix with minimum distance to the nearest door
  • Ans. 

    Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.

    • Iterate through the matrix and find the doors

    • Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door

    • Update the distance matrix with the minimum distances

  • Answered by AI
  • Q2. Given a read-only array we want to find kth smallest element in unordered array with O(1) space
  • Ans. 

    Find kth smallest element in unordered array with O(1) space

    • Use the QuickSelect algorithm to partition the array and find the kth smallest element

    • Choose a pivot element and partition the array into two subarrays

    • Recursively partition the subarray that contains the kth smallest element

    • Repeat until the pivot element is the kth smallest element

    • Time complexity: O(n) average case, O(n^2) worst case

  • Answered by AI
  • Q3. Design question
  • Q4. Find friends of friend who already are not friends with you
  • Ans. 

    To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.

    • Get your list of friends

    • For each friend, get their list of friends

    • Exclude yourself and your friends from the final list of friends of friends

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Tips: Just walk the interviewer through the solution you're proposing.

Round: Other Interview
Experience: He started with a design question with how to stream an image such that all clients see the same image at the same time. You need to take care of delays, network problems. He kept on adding new elements like compression, streaming, utc time related issues, client rendering delays and so on.

Round: Other Interview
Experience: This was bar-raiser round.

Skills: Design, Algorithms And Data Structures, Graph Theory
College Name: IIT Madras

Skills evaluated in this interview

I was interviewed before Apr 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.

  • Q1. 

    Kth Largest Element Problem Statement

    Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.

    Example:

    Input:
    Array: [2,1,5,6,3,8], K ...
  • Ans. 

    Find the Kth largest element in an array of distinct positive integers.

    • Sort the array in non-increasing order

    • Return the Kth element from the sorted array

    • Handle multiple test cases

  • Answered by AI
  • Q2. 

    Orange Rotting Problem Statement

    Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:

    • Value 0: Represents an empty cell.
    • Value 1: Represents a fresh orang...
  • Ans. 

    The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.

    • Create a queue to store the rotten oranges and their time of rotting.

    • Iterate through the grid to find the initial rotten oranges and add them to the queue.

    • Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.

    • Continue until the queue is empty, ke...

  • Answered by AI
Round 2 - Face to Face 

Round duration - 45 minutes
Round difficulty - Easy

This was a design round.

Interview Preparation Tips

Eligibility criteriaAbove 8 CGPAUber interview preparation:Topics to prepare for the interview - Design, Algorithms And Data Structures, Graph Theory, 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 interviewRejected

Skills evaluated in this interview

I was interviewed before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

    • Use level-order input to construct the Binary Tree.

    • Traverse the Binary Tree recursively to generate the required traversals.

    • Ensure proper handling of null nodes represented by -1 in the input.

    • Return the three traversals as

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 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

I was interviewed before May 2021.

Round 1 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Find the k-th Node from the End of a Linked List

    Given the head node of a singly linked list and an integer 'k', this problem requires you to determine the value at the k-th node from the end of the linke...

  • Ans. 

    To find the k-th node from the end of a linked list, iterate through the list to determine the size, then traverse again to reach the k-th node from the end.

    • Iterate through the linked list to determine its size.

    • Calculate the position of the k-th node from the end based on the size of the list.

    • Traverse the list again to reach the k-th node from the end.

    • Return a pointer to the k-th node from the end.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

High level System Design

  • Q1. Can you design a system like Uber, explaining the various components and architecture involved?
  • Ans. 

    Designing a system like Uber involves components like user app, driver app, server, database, and algorithms for matching and routing.

    • User app for booking rides and tracking

    • Driver app for accepting rides and navigation

    • Server for handling requests and communication between apps

    • Database for storing user, driver, and ride information

    • Algorithms for matching riders with drivers and routing

  • Answered by AI
Round 3 - HR 

Round duration - 45 minutes
Round difficulty - Easy

Basic HR questions

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in HyderabadEligibility criteriaAbove 7 CgpaUber interview preparation:Topics to prepare for the interview - Data Structures, React JS, JavaScript, DBMS, AlgorithmsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Practise DSA/coding consistently
Tip 2 : Choose a tech stack and Make side hobby projects
Tip 3 : Give mock interviews for your preparation evaluation

Application resume tips for other job seekers

Tip 1 : Pointers about your current job responsibility
Tip 2 : Side Projects with Tech stack

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. They asked 3 Coding questions and 5 MCQ all of them were very simple. One was related to fibbonaci. Another one was like there was 2d array and at i,j sum till row i and sum till j was given and all the el...

Interview Preparation Tips

Interview preparation tips for other job seekers - I got all three questions correct and also I got a call from recruiter saying that be prepared for interview at tuesday but when i tried calling, He wasn't picking it up. Overall, It was a pathetic experience.

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

  • Q1. How can you check if two strings are anagrams of each other?
  • Ans. 

    Check if two strings are anagrams by comparing the sorted versions of the strings.

    • Sort both strings and compare if they are equal.

    • Use a hashmap to store the frequency of characters in each string and compare the maps.

    • Ignore spaces and punctuation when comparing the strings.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round 3 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute Of Technology, Silchar, Assam. I applied for the job as SDE - 1 in SiddharthnagarEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Basic Computer Science backgroundTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Add projects and Internships if you have done any and add only those things which you really know.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

  • Q1. 

    Detect Cycle in a Directed Graph

    You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...

  • Ans. 

    Detect cycle in a directed graph using depth-first search (DFS) algorithm.

    • Use DFS to traverse the graph and detect back edges indicating a cycle.

    • Maintain a visited array to keep track of visited nodes during traversal.

    • If a node is visited again during traversal and it is not the parent node, then a cycle exists.

    • Return true if a cycle is detected, false otherwise.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

  • Q1. 

    Next Smallest Palindrome Problem Statement

    Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.

    Explanation:

    You are given a number in string format, a...

  • Ans. 

    Find the next smallest palindrome greater than a given number represented as a string.

    • Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

    • Handle cases where the number is a palindrome or has all digits as '9'.

    • Consider both odd and even length numbers when finding the next palindrome.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

  • Q1. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaGood knowledge of Data Structures, Some great projects which are used by the usersAmazon interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, OS, Networking, OOPS, DevOpsTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart. 
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.

Final outcome of the interviewSelected

Skills evaluated in this interview

BONbLOC Interview FAQs

How many rounds are there in BONbLOC Lead Software Engineer interview?
BONbLOC interview process usually has 1 rounds. The most common rounds in the BONbLOC interview process are Technical and Coding Test.

Tell us how to improve this page.

BONbLOC Lead Software Engineer Interview Process

based on 2 interviews

Interview experience

2.5
  
Poor
View more
Join BONbLOC AI - IoT - Blockchain - IT Modernization

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Flipkart Interview Questions
4.0
 • 1.3k Interviews
Swiggy Interview Questions
3.8
 • 428 Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
Blinkit Interview Questions
3.7
 • 181 Interviews
Uber Interview Questions
4.2
 • 150 Interviews
Ola Cabs Interview Questions
3.4
 • 139 Interviews
Urban Company Interview Questions
3.4
 • 134 Interviews
Dunzo Interview Questions
3.4
 • 69 Interviews
View all
BONbLOC Lead Software Engineer Salary
based on 12 salaries
₹10.2 L/yr - ₹26 L/yr
36% less than the average Lead Software Engineer Salary in India
View more details

BONbLOC Lead Software Engineer Reviews and Ratings

based on 1 review

2.0/5

Rating in categories

3.0

Skill development

1.0

Work-life balance

3.0

Salary

1.0

Job security

1.0

Company culture

2.0

Promotions

2.0

Work satisfaction

Explore 1 Review and Rating
Senior Software Engineer
42 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
31 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Software Engineer
25 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Lead Software Engineer
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare BONbLOC with

Urban Company

3.4
Compare

Zomato

3.8
Compare

Swiggy

3.8
Compare

BigBasket

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview