Upload Button Icon Add office photos
Engaged Employer

i

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

InfoBeans Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

InfoBeans Java Developer Interview Questions and Answers

Updated 12 Jun 2023

InfoBeans Java Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. First round 1. find duplicates in the array 2. shadow and deep copy
Round 2 - One-on-one 

(1 Question)

  • Q1. Clear basics and coding

Interview questions from similar companies

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Explain dependency injection, indexes in sql, SOLID principles.
  • Ans. 

    Dependency injection is a design pattern where dependencies are injected into a class rather than created within the class itself.

    • Dependency injection helps in achieving loose coupling between classes.

    • It allows for easier testing and maintenance of code.

    • Example: Constructor injection, setter injection, and interface injection are common types of dependency injection.

    • Indexes in SQL are used to improve the performance of...

  • Answered by AI

Skills evaluated in this interview

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

I applied via Job Portal and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. SOLID principles
  • Q2. Microservice Architecture and Kafka

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared with core concepts.
Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. What is java and its features ?
  • Ans. 

    Java is a high-level programming language known for its platform independence and object-oriented features.

    • Java is platform-independent, meaning it can run on any device with a Java Virtual Machine (JVM)

    • It is object-oriented, allowing for the creation of reusable code and modular programs

    • Java is known for its robust standard library, providing a wide range of pre-built functionality

    • It supports multithreading, allowing ...

  • Answered by AI
  • Q2. What is java 8 and features
  • Ans. 

    Java 8 is a major release of the Java programming language with new features like lambda expressions, streams, and default methods.

    • Lambda expressions allow you to treat functionality as a method argument.

    • Streams provide a new abstraction to work with sequences of elements.

    • Default methods allow interfaces to have method implementations.

    • Date and Time API provides a new way to work with dates and times.

    • Optional class help

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
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 

(3 Questions)

  • Q1. Difference between Procedure, Packages and functions.
  • Ans. 

    Procedures, Packages and Functions are all subprograms in PL/SQL with different characteristics.

    • Procedures are subprograms that perform a specific task and may or may not return a value.

    • Functions are subprograms that always return a value and can be used in SQL statements.

    • Packages are a collection of related procedures, functions, variables, and other program constructs that can be used as a single unit.

    • Packages provid...

  • Answered by AI
  • Q2. If table or view does not exist what does it mean
  • Ans. 

    It means that the table or view does not exist in the database.

    • The query will fail and return an error message.

    • The application may crash or behave unexpectedly.

    • The table or view may have been deleted or renamed.

    • Check the spelling and syntax of the query.

    • Make sure the database connection is established and valid.

  • Answered by AI
  • Q3. Difference Between Views and Materialized Views
  • Ans. 

    Views are virtual tables while Materialized Views are physical tables.

    • Views are created using SELECT statement while Materialized Views are created using CREATE MATERIALIZED VIEW statement.

    • Views do not store data while Materialized Views store data.

    • Views are updated dynamically while Materialized Views are updated manually or automatically based on refresh settings.

    • Materialized Views are faster for read-heavy workloads...

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. Details explanation about the projects and the concepts what we used.

Interview Preparation Tips

Interview preparation tips for other job seekers - Always answer bold whatever maybe the questions explain in brief whatever you know and your answers should be to the point.

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

We were supposed to give test in any time between 3 PM to 9 PM.

  • Q1. 

    Total Unique Paths Problem Statement

    You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...

  • Ans. 

    The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the number of unique paths at each cell.

    • Initialize the first row and first column with 1 as there is only one way to reach them.

    • For each cell (i, j), the number of unique paths is the sum of paths...

  • Answered by AI
  • Q2. 

    Subtree Node Count Problem

    We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...

  • Ans. 

    Given a tree with N nodes, find the number of elements in each subtree rooted at every node.

    • Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.

    • Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.

    • The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 120 minutes
Round difficulty - Medium

Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM

Focus Areas: Problem solving and implementation of extensions.

The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
 

  • Q1. 

    River Crossing: Help Ninja Cross Over

    Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array S...

  • Ans. 

    Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.

    • Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.

    • Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.

    • Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 120 minutes
Round difficulty - Medium

Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.

  • Q1. 

    Middle of a Linked List

    You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.

    If there is an odd number of elements, return the ...

  • Ans. 

    Return the middle element of a singly linked list, or the one farther from the head if there are even elements.

    • Traverse the linked list with two pointers, one moving twice as fast as the other

    • When the fast pointer reaches the end, the slow pointer will be at the middle

    • Return the element pointed to by the slow pointer

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaIt was for 2020 undergraduateThought Works interview preparation:Topics to prepare for the interview - Object Oriented Programming, System Design, Operating System, DBMS, Data Structures and Algorithms (Dynamic Programming, Trees, LinkedList)Time required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Have good grasp on OOPS since they have a round named Pair Programming round which is focused upon this. 
Tip 2 : Write clean, modular and functional code.
Tip 3 : Practice Data Structures and Algorithms
Tip 4 : You should know breadth and depth of whatever is mentioned in your resume.
Tip 5 : Be loud and clear.

Application resume tips for other job seekers

Tip 1 : Make single page resume.
Tip 2 : Mention relevant things on resume.
Tip 3 : Do not put any false things on resume. Projects, internships you are mentioning be ready to answer questions related to it regarding what you solved, idea, databases, design.
Tip 4 : Contribute in open source, participate in hackathons.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Code paring round was conducted. they will assist you what there expectations are

Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Selected Selected

I appeared for an interview in Feb 2023.

Round 1 - Coding Test 

Stream program and spring boot, jpa etc

Round 2 - Technical 

(1 Question)

  • Q1. Stream api program
  • Ans. 

    Stream API is a powerful tool in Java for processing collections of objects.

    • Stream API provides a way to perform operations on collections in a functional style.

    • It supports operations like filter, map, reduce, and collect.

    • Example: List<String> names = Arrays.asList("Alice", "Bob", "Charlie"); names.stream().filter(name -> name.startsWith("A")).forEach(System.out::println);

  • Answered by AI
Round 3 - Coding Test 

Stream program and microservice architecture

Interview Preparation Tips

Interview preparation tips for other job seekers - only focus on stream api
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
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 tips
Round 2 - Aptitude Test 

Duration - 1 hour
Topics - Aptitude, Debug Code, Technical MCQ

Round 3 - Technical 

(1 Question)

  • Q1. They ask me the general questions for codding and the also ask question for angile framework

InfoBeans Interview FAQs

How many rounds are there in InfoBeans Java Developer interview?
InfoBeans interview process usually has 3 rounds. The most common rounds in the InfoBeans interview process are One-on-one Round and Resume Shortlist.
How to prepare for InfoBeans Java Developer 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 InfoBeans. The most common topics and skills that interviewers at InfoBeans expect are Java, Microservices, Multithreading, Spring and Spring Boot.
What are the top questions asked in InfoBeans Java Developer interview?

Some of the top questions asked at the InfoBeans Java Developer interview -

  1. first round 1. find duplicates in the array 2. shadow and deep c...read more
  2. clear basics and cod...read more

Tell us how to improve this page.

InfoBeans Java Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
InfoBeans Java Developer Salary
based on 6 salaries
₹3.2 L/yr - ₹14.6 L/yr
43% more than the average Java Developer Salary in India
View more details

InfoBeans Java Developer Reviews and Ratings

based on 2 reviews

3.4/5

Rating in categories

3.4

Skill development

4.2

Work-life balance

3.4

Salary

4.2

Job security

4.2

Company culture

3.4

Promotions

3.4

Work satisfaction

Explore 2 Reviews and Ratings
Software Engineer
405 salaries
unlock blur

₹2.8 L/yr - ₹14.6 L/yr

Senior Software Engineer
384 salaries
unlock blur

₹6.9 L/yr - ₹25 L/yr

QA Engineer
165 salaries
unlock blur

₹4 L/yr - ₹15 L/yr

Associate Software Engineer
123 salaries
unlock blur

₹2.6 L/yr - ₹9.8 L/yr

Senior QA Engineer
113 salaries
unlock blur

₹6 L/yr - ₹16 L/yr

Explore more salaries
Compare InfoBeans with

Xoriant

4.1
Compare

Photon Interactive

4.0
Compare

CitiusTech

3.4
Compare

Iris Software

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