Google SDE Interview Questions, Process, and Tips

Basic aptitude questions, you can find on internet.

Q1. Question from trees and link list.
Add your answer
Q2. How you can optimise reversal process in a tree
Ans. 
To optimize reversal process in a tree, use iterative post-order traversal with a stack.
• Implement iterative post-order traversal using a stack to efficiently reverse the tree.

• Start by pushing the root node onto the stack.

• While the stack is not empty, pop a node, push its children onto the stack in reverse order, and then push the node itself.

• Repeat this process until all nodes have been visited and reversed.

• This method...read more
Answered by AI
Add your answer

Q1. Find minimum no. of increment operations to make array unique
Ans. 
To make an array of strings unique, count the number of duplicate elements and increment them accordingly.
• Iterate through the array and keep track of the frequency of each element.

• For each duplicate element, increment it to make the array unique.

• Return the total number of increment operations needed.
Answered by AI
Add your answer
Q2. Given a binary tree whose every node value is a number. find the sum of all the numbers that are formed from root to leaf paths
Ans. 
Sum all numbers formed from root to leaf paths in a binary tree
• Traverse the tree from root to leaf nodes, keeping track of the current number formed

• Add the current number to the sum when reaching a leaf node

• Recursively explore left and right subtrees
Answered by AI
Add your answer

Graph dp and tree related mid-hard

Q1. Longest increasing subsequence
Ans. 
Find the longest increasing subsequence in an array.
• Use dynamic programming to keep track of the longest increasing subsequence ending at each index.

• Iterate through the array and update the longest increasing subsequence for each index.

• Return the maximum length of the longest increasing subsequence found.
Answered by AI
Add your answer

Hard and technical question

Hard and tecnical questions

Q1. What do you do when you are free
Add your answer
Q2. What is your weakness
Add your answer