Google Trainee Interview Questions and Answers

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

Ages, trains, profit losss, hcf lcm, clock, simple interest 30 min

Array string sorting algorithm

Q1. Questions on my resume. what is join? What is out of memory error? Can it be resolved after getting it? One programming question in java? Then some followup questions based on above?
Add your answer

Q1. Find the highest element from a BST and implement insertion operation of BST.
Ans. 
To find the highest element in a BST, perform a right traversal until reaching the rightmost leaf node.
• Perform a right traversal starting from the root node until reaching the rightmost leaf node to find the highest element.

• Implement the insertion operation by comparing the value to be inserted with each node and traversing left or right accordingly.

• Ensure that the BST property is maintained during insertion by placing...read more
Answered by AI
Add your answer
Q2. Heap Sort with Max Heap
Ans. 
Heap Sort is a comparison-based sorting algorithm that uses a binary heap data structure.
• Heap Sort involves building a max heap from the input array, then repeatedly removing the maximum element and rebuilding the heap.

• The time complexity of Heap Sort is O(n log n) in the worst case scenario.

• Example: Given an array [4, 10, 3, 5, 1], after applying Heap Sort, the sorted array would be [1, 3, 4, 5, 10].
Answered by AI
Add your answer

Q1. Delete nth element from end in a LINKEDLIST.
Ans. 
To delete the nth element from the end in a LinkedList, we can use two pointers approach.
• Use two pointers - one to traverse the list and another to keep track of the nth element from the end.

• Calculate the distance between the two pointers and delete the node at the second pointer.
Answered by AI
Add your answer
Q2. Reverse a LinkedLis
Ans. 
To reverse a LinkedList, iterate through the list and change the direction of pointers.
• Iterate through the LinkedList and keep track of the previous, current, and next nodes.

• Update the pointers to reverse the direction of the nodes.

• Repeat until the end of the list is reached.
Answered by AI
Add your answer

Q1. Java Collection framework, java 8 features
Add your answer

Q1. Give three date functions?
Ans. 
Three date functions in Java are getDate(), getMonth(), and getYear().
• getDate() - Returns the day of the month represented by this Date object.

• getMonth() - Returns the month represented by this Date object.

• getYear() - Returns the year represented by this Date object.
Answered by AI
Add your answer

Q1. How is your work divided?
Add your answer

Q1. Expected compensation
Add your answer

Prepare moderate level of aptitude

Strings and multithreading code

Q1. About java collections
Add your answer
Q2. Hash maps, arrays, hash sets
Add your answer