Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by BlueBinaries Engineering and Solutions Team. If you also belong to the team, you can get access from here
3.1

based on 111 Reviews

Filter interviews by

BlueBinaries Engineering and Solutions Software Development Engineer Interview Questions and Answers

Updated 15 Aug 2023

BlueBinaries Engineering and Solutions Software Development Engineer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed before Aug 2022.

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 tips
Round 2 - Technical 

(1 Question)

  • Q1. Logical java questions, java 8 questions, collections, questions on Springboot and hibernate.
Round 3 - Technical 

(1 Question)

  • Q1. Techno Managerial round, managerials questions, code quality, junit test cases .
Round 4 - HR 

(1 Question)

  • Q1. Behaviour questions, why you want to join, salary expectations.

Interview Preparation Tips

Interview preparation tips for other job seekers - Only mention those skills in your resume which you have good knowledge.

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Jul 2022. There were 4 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 tips
Round 2 - Coding Test 

Medium level coding questions were asked

Round 3 - Technical 

(3 Questions)

  • Q1. Implementation of Breadth First Search
  • Ans. 

    Breadth First Search is a graph traversal algorithm that explores all the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.

    • Start by visiting the root node and then visit all the neighbor nodes at the present depth level before moving on to the nodes at the next depth level.

    • Use a queue data structure to keep track of the nodes to be visited.

    • Mark each node as visited to avoid re...

  • Answered by AI
  • Q2. Implementation of Depth First Search
  • Ans. 

    Depth First Search is a graph traversal algorithm that explores as far as possible along each branch before backtracking.

    • Start at a node and explore as far as possible along each branch before backtracking

    • Use a stack to keep track of nodes to visit

    • Mark visited nodes to avoid revisiting them

    • Can be implemented recursively or iteratively

  • Answered by AI
  • Q3. Implementation of Inorder Traversal of a Binary Tree
  • Ans. 

    Inorder traversal of a binary tree involves visiting the left subtree, then the root, and finally the right subtree.

    • Start at the root node

    • Recursively traverse the left subtree

    • Visit the current node

    • Recursively traverse the right subtree

    • Repeat until all nodes are visited

  • Answered by AI
Round 4 - Technical 

(2 Questions)

  • Q1. Swap Alternative nodes of a Linked list
  • Ans. 

    Swap alternative nodes of a linked list

    • Iterate through the linked list and swap the data of alternate nodes

    • Use temporary variables to store data during swapping

    • Ensure to handle cases where the linked list has an odd number of nodes

  • Answered by AI
  • Q2. Reverse a Linked list
  • Ans. 

    Reverse a linked list by changing the next pointers of each node

    • Start with three pointers: current, prev, and next

    • Iterate through the linked list, updating the next pointer of each node to point to the previous node

    • Update prev, current, and next pointers for each iteration

    • Example: 1 -> 2 -> 3 -> 4 -> null, after reversing: 4 -> 3 -> 2 -> 1 -> null

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Referral

Round 1 - Coding Test 

Java internals, coding questions 2sum

Round 2 - Technical 

(2 Questions)

  • Q1. Hld of your previous project
  • Ans. 

    Developed a web-based project management tool for tracking tasks and deadlines.

    • Used React.js for front-end development

    • Implemented RESTful APIs for backend using Node.js and Express

    • Utilized MongoDB for database storage

    • Incorporated authentication and authorization features for user security

  • Answered by AI
  • Q2. Question related to self build projects
Round 3 - HR 

(2 Questions)

  • Q1. Salary negotiation
  • Q2. Location constrain if any
  • Ans. 

    Open to relocation for the right opportunity

    • Willing to relocate for the right job opportunity

    • Flexible with location for the right role

    • Open to considering different locations for the right position

  • Answered by AI
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Please inquire about the fundamentals of computer science, including object-oriented programming, data structures and algorithms, database management systems, and computer networks.

Interview Preparation Tips

Interview preparation tips for other job seekers - coding test (DSA 3 questions easy-medium , SQL 2 question)
Interview T1 ->T2
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

DSA, SQL, Problem Solving, Technical, Data Structures and Algorithms

Round 2 - Technical 

(2 Questions)

  • Q1. Write an SQL Query for retrieving something
  • Ans. 

    SQL query to retrieve data from a database

    • Use SELECT statement to specify the columns to retrieve

    • Use FROM clause to specify the table to retrieve data from

    • Use WHERE clause to filter the results based on conditions

  • Answered by AI
  • Q2. Write a program to achieve something
  • Ans. 

    Program to sort an array of integers in ascending order

    • Use a sorting algorithm like bubble sort, selection sort, or insertion sort

    • Iterate through the array and compare adjacent elements to swap if necessary

    • Repeat the process until the array is sorted

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well

Skills evaluated in this interview

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

(1 Question)

  • Q1. Move negative elements to right side of array
  • Ans. 

    Move negative elements to right side of array

    • Iterate through the array and swap negative elements to the right side

    • Use two pointers approach to keep track of positive and negative elements

    • Maintain the order of elements while moving negatives to the right side

  • Answered by AI

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
Not Selected
Round 1 - Aptitude Test 

25 questions , 1 hour

Round 2 - Coding Test 

1 coding , 2 logical question

Round 3 - One-on-one 

(2 Questions)

  • Q1. For loop , 2 logical
  • Q2. About final year projrct
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Job Fair and was interviewed in Jul 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Coding is important three problems and mcqs of java and testing

Round 2 - Technical 

(2 Questions)

  • Q1. Oops concepts were asked
  • Q2. Java questions static jvm and all

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare java very well coding is important
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
No response

I applied via Naukri.com and was interviewed in Jun 2024. There were 4 interview rounds.

Round 1 - Aptitude Test 

Number series , probablity , relations

Round 2 - Coding Test 

String, pattern and one prime number questions

Round 3 - Technical 

(2 Questions)

  • Q1. Bit and byte comparison
  • Ans. 

    A bit is the smallest unit of data in computing, while a byte is made up of 8 bits.

    • A bit can have a value of 0 or 1, representing off or on respectively.

    • A byte is made up of 8 bits, allowing for a larger range of values (0-255).

    • Bytes are commonly used to represent characters in text, with each character typically taking up one byte.

    • Bits are often used in Boolean logic operations and for representing binary numbers.

  • Answered by AI
  • Q2. About projects and roles
Round 4 - HR 

(2 Questions)

  • Q1. Asked about the family background
  • Q2. About company and their projects

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well
Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Medium to hard questions based on arrays, dp

Round 2 - Technical 

(2 Questions)

  • Q1. Quick sort algorithm
  • Ans. 

    Quick sort is a popular sorting algorithm that uses divide and conquer strategy.

    • Divides array into smaller sub-arrays based on a pivot element

    • Recursively sorts sub-arrays

    • Combines sorted sub-arrays to get final sorted array

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

    • Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]

  • Answered by AI
  • Q2. Modified rotate a matrix
  • Ans. 

    Rotate a matrix by 90 degrees in place

    • Transpose the matrix

    • Reverse each row of the transposed matrix

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - study well and at the end, they would not hire anyone

Skills evaluated in this interview

BlueBinaries Engineering and Solutions Interview FAQs

How many rounds are there in BlueBinaries Engineering and Solutions Software Development Engineer interview?
BlueBinaries Engineering and Solutions interview process usually has 4 rounds. The most common rounds in the BlueBinaries Engineering and Solutions interview process are Technical, Resume Shortlist and HR.
How to prepare for BlueBinaries Engineering and Solutions Software Development Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at BlueBinaries Engineering and Solutions . The most common topics and skills that interviewers at BlueBinaries Engineering and Solutions expect are Embedded C, ASIC, Android, Application Programming and Automotive.
What are the top questions asked in BlueBinaries Engineering and Solutions Software Development Engineer interview?

Some of the top questions asked at the BlueBinaries Engineering and Solutions Software Development Engineer interview -

  1. Logical java questions, java 8 questions, collections, questions on Springboot...read more
  2. Techno Managerial round, managerials questions, code quality, junit test case...read more

Tell us how to improve this page.

29% less than the average Software Development Engineer Salary in India
View more details

BlueBinaries Engineering and Solutions Software Development Engineer Reviews and Ratings

based on 3 reviews

2.5/5

Rating in categories

2.5

Skill development

2.5

Work-Life balance

2.5

Salary & Benefits

2.2

Job Security

2.5

Company culture

2.2

Promotions/Appraisal

2.5

Work Satisfaction

Explore 3 Reviews and Ratings
Lead Engineer
40 salaries
unlock blur

₹10.2 L/yr - ₹25.3 L/yr

System Engineer
39 salaries
unlock blur

₹4.4 L/yr - ₹16 L/yr

Senior Systems Engineer
29 salaries
unlock blur

₹6.7 L/yr - ₹16 L/yr

Software Engineer
29 salaries
unlock blur

₹4 L/yr - ₹12.5 L/yr

Senior Engineer
25 salaries
unlock blur

₹8 L/yr - ₹19 L/yr

Explore more salaries
Compare BlueBinaries Engineering and Solutions with

Tech Mahindra

3.6
Compare

TCS

3.7
Compare

Infosys

3.7
Compare

Wipro

3.7
Compare

Calculate your in-hand salary

Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary
Did you find this page helpful?
Yes No
write
Share an Interview