Pragmatic Play Software Development Engineer Intern Interview Questions and Answers

The aptitude test was relatively straightforward, consisting of both aptitude and technical questions, with a difficulty level ranging from easy to medium.

Q1. Was asked to write a code on basic DSA concept
Add your answer
Q2. Then was asked basic questions on DSA and SQL
Add your answer

Q1. What is the D/W Rest and GraphQL APIS?
Ans. 
D/W Rest and GraphQL APIs are two different types of APIs used for communication between software systems.
• D/W Rest API is a standard protocol for accessing and manipulating data over the web using HTTP.

• GraphQL API is a query language for APIs and a runtime for executing those queries with your existing data.

• Rest APIs are more commonly used and follow a stateless client-server architecture.

• GraphQL APIs allow clients to ...read more
Answered by AI
Add your answer
Q2. REST uses fixes endpoint;..............etc.
Ans. 
REST uses fixed endpoints to define the resources that can be accessed through the API.
• RESTful APIs use fixed URLs to access resources

• Each endpoint corresponds to a specific resource or action

• Endpoints are defined in the API documentation

• Example: GET /users retrieves a list of users
Answered by AI
Add your answer

Q1. Can you please introduce yourself?
Ans. 
I am a Software Development Engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
• 5 years of experience in software development

• Proficient in Java, Spring, and Angular

• Strong problem-solving skills

• Experience in developing web applications

• Good team player
Answered by AI
Add your answer
Q2. What type of questions are being asked?
Add your answer

Q1. What is the implementation of Merge Sort in Java?
Ans. 
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, recursively sorts them, and then merges the sorted halves.
• Divide the input array into two halves

• Recursively sort the two halves

• Merge the sorted halves back together
Answered by AI
Add your answer
Q2. What is the implementation of the Quick Sort algorithm in Java?
Ans. 
Quick Sort is a popular sorting algorithm that uses a divide-and-conquer approach to sort elements in an array.
• Choose a pivot element from the array.

• Partition the array into two sub-arrays: elements less than the pivot and elements greater than the pivot.

• Recursively apply the same process to the sub-arrays.

• Combine the sorted sub-arrays to get the final sorted array.
Answered by AI
Add your answer

Q1. Design tinyurl system design
Add your answer

Asked to write a bank application - which includes adding,removing,transferring of money

Q1. They ask me about my previous job description details and education details
Add your answer
Q2. About carrier goals
Add your answer
Q3. About my responsibility in side the current company
Add your answer

Q1. They ask me about core concept of react js and next js
Add your answer
Q2. Ask me about core concepts of mongo Db and Node js
Add your answer

Q1. They told me about company curriculum, goals and ethics
Add your answer

Queue question - create queue from array

Q1. Working structure preference
Add your answer
Q2. Salary preference
Add your answer
Q3. No more questions
Add your answer