Google Trainee Interview Questions and Answers

They are asking C programming output question

They prefer Java language for logical thinking programming round

Q1. Collections framework, Explain why you chose a particular collection instead of other with example scenario based
Add your answer
Q2. Explain your project
Ans. 
Developed a web application for online shopping with features like user authentication, product search, and order management.
• Implemented user authentication using Spring Security

• Utilized Hibernate for database operations

• Designed front-end using AngularJS for dynamic user interface
Answered by AI
Add your answer

Q1. How can a Spring Boot project be created to develop an API that returns specified data?
Ans. 
A Spring Boot project can be created to develop an API by setting up a new Spring Boot project, defining API endpoints, and implementing the necessary logic.
• Create a new Spring Boot project using Spring Initializr

• Define API endpoints using @RestController annotation

• Implement the logic to return specified data in the API endpoints

• Use @GetMapping, @PostMapping, @PutMapping, @DeleteMapping annotations to map HTTP methods
Answered by AI
Add your answer
Q2. What is the code to print a right-angled triangle of numbers based on a given input number?
Ans. 
Use nested loops to print a right-angled triangle of numbers based on input.
• Use two nested loops to control the rows and columns of the triangle.

• Increment the number to be printed in each row.

• Example: If input is 5, the output would be: 1, 12, 123, 1234, 12345
Answered by AI
Add your answer

It is easy to crack the first round with the basic topics of aptitude.

Must learn string,array,pointer and others to clear this round

Easy to solve math related que

Somewhat difficult in constraints

Normal code snippets , English question and Aptitude question like time, relation etc

Q1. Code of recursion
Ans. 
Recursion is a programming technique where a function calls itself to solve a problem.
• Recursion involves breaking down a problem into smaller subproblems and solving them recursively.

• Base case is important to prevent infinite recursion.

• Examples: factorial calculation, Fibonacci sequence generation.
Answered by AI
Add your answer
Q2. Code of merge sort
Ans. 
Merge sort is a divide and conquer algorithm that recursively divides the array into two halves, sorts them, and then merges them back together.
• Divide the array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer