Prakhar Software Solutions Java Developer Interview Questions and Answers for Freshers

Q1. Am middle class. I am greatly interested in your company and would like to know if there is any way I can do the best in career development and I am in 4th year of btech and I am very proud 👏 to be a part...read more
Add your answer

Q1. My dream to work with google company. Please complete my dream. Please please give me a chance. Thanks
Add your answer
Q2. I want to a chance to work for your company.
Add your answer

Q1. Questions were asked mainly on java 8 1.streams,map,filter,sort 2.Some exception handling 3.Do u know docker,kubernetes 4.findBy method in java 8 streams 5.Features added in java 8
Add your answer

Q1. Salary expectations
Add your answer

Q1. Introduction self
Add your answer

Numerical Reasoning, verbal, abstract, logical, spatial, and duration was 30-45min

There was 2 coding question and some code snippets MCQ.

Q1. There was some basics question on DSA, DBMS, and OOPS. Operating system.
Add your answer
Q2. 1->like what is the process behind storing variables in memory? 2-> What is the need for oops? 3-> what is compile time polymorphism and how is it different from runtime.? 4-> what is DBMS. 5->diff b/w mal...read more
Ans. 
Interview questions for Software Developer
• Variables are stored in memory through a process called memory allocation

• OOPs is needed for better code organization, reusability, and encapsulation

• Compile-time polymorphism is achieved through function overloading while runtime polymorphism is achieved through virtual functions

• DBMS stands for Database Management System and is used to manage and organize data

• Malloc and calloc a...read more
Answered by AI
Add your answer
Q3. Question were asked from
Add your answer

Round duration - 75 Minutes
Round difficulty - Hard

Online Round - 2 questions. 
75 minutes

Q1. Construct the Lexicographically Largest Valid Sequence
You are given a positive integer N. Your task is to create the lexicographically largest sequence of length 2*N - 1 containing integers between 1 to N...read more
Ans. Backtracking Approach
Approach:
 
In this approach, we will be trying to find the valid sequence using backtracking. We will be creating our sequence from left to right and will be trying to fix the biggest possible integer yet to be used at the current position. We are fixing the biggest integer first because that will give us the lexicographically largest sequence that is possible. For every position, we will be fi...read more
Answered by CodingNinjas
Add your answer
Q2. Zuma Game
You have several balls on the table in the form of a string named 'BOARD'. The colors of the balls can be red(R), blue(B), green(G), white(W), and yellow(Y). You also have several balls i...read more
Ans. Recursive Approach
The idea here is to use recursion. At each step, we plan to insert the remaining balls in the string hand to the string board. Now the question arises, in which position do we have to insert the ‘i’th character of the string hand? The answer is simple; we have to insert ‘i’th character to all the positions on board to get all possible answers. That’s why we are using the recursive approach. After inse...read more
Answered by CodingNinjas
Add your answer

Round duration - 40 Minutes
Round difficulty - Hard

1 Coding problem and 1 OOP problem

Q1. Ninja and Chocolates
Ninja is hungry and wants to eat his favorite chocolates but his mother won’t let him eat since he has already eaten enough chocolates. There are ‘N’ jars filled with chocolates. His m...read more
Ans. Brute Force
The brute force approach to this problem is that we continuously iterate on the speed of eating chocolates till Ninja can eat all the chocolates within ‘M’ Minutes.
 
Algorithm:
1. Make a variable ‘sum’, which will store the sum of all chocolates which are present in all N jars.
2. Now to find the starting speed, we’ll use the fact that our required speed has to be greater than the average speed(sum/M), else the ...read more
Answered by CodingNinjas
View 1 more answer
Q2. OOP Question
Virtual function and abstract class
Add your answer

Round duration - 40 minutes
Round difficulty - Hard

Resume based problems, OOPs, DBMS, OS problems

Q1. OS Questions
Virtual memory ? Usage , example4
Threads, Processes , differences.
Add your answer
Q2. System Design Question
Design linkedin kind platform
Add your answer

Round duration - 15 Minutes
Round difficulty - Hard

Typical HR interview round. Short and crisp

Q1. Basic HR Questions
Are you reliable? or Can I trust you with responsibilities? 
What are the three things that are most important for you in a job? 
What was the toughest decision you ever had to ma...read more
Ans. 
Tip 1 : Be quick and direct.
Answered by CodingNinjas
Add your answer