Google Software Development Engineer II Interview Questions and Answers

Q1. Predecessor of a node in bst
Ans. 
Predecessor of a node in a Binary Search Tree (BST) is the largest node in the left subtree of the given node.
• In a BST, the predecessor of a node can be found by going to the left child of the node and then traversing to the rightmost node in the subtree.

• If the left child of the node is null, then the predecessor will be the parent of the node or the ancestor node that is on the right side of the parent.

• Example: In a B...read more
Answered by AI
Add your answer

Q1. Cache low level design
Ans. 
Designing a cache system to improve performance by storing frequently accessed data in memory.
• Identify the data that needs to be cached based on frequency of access

• Choose an appropriate caching algorithm (LRU, LFU, etc.)

• Decide on the cache size and eviction policy

• Implement cache invalidation strategies to keep data up to date

• Consider thread safety and concurrency issues
Answered by AI
Add your answer

It is Hacker rank test ,asked 2 questions and needs to solve in 1 hour

Q1. Tested problem solving
Add your answer

Q1. Low level designing
Add your answer

Q1. It is managerial round
Add your answer

Oops
Basic DSA
Project Based Discussions
NodeJs/ReactJS Fundamental Questions

Advance Oops and DSA

Q1. 1.) Why would you like to work for ncr
Add your answer
Q2. 2.) What you know about Self Serve Checkout
Add your answer

Q1. Decode the string. if integer is present, expand it those many times. ab2[b3[ac]]de --> abbacacacbacacacde
Ans. 
Decode a string by expanding integers to repeat characters within brackets.
• Iterate through the string character by character

• If a digit is encountered, keep track of the number

• When encountering '[', push the current result and number onto the stack

• When encountering ']', repeat the substring inside brackets based on the number on top of the stack

• Continue until the entire string is decoded
Answered by AI
Add your answer
Q2. Maximum length of the subarray which has almost 2 distinct elements
Ans. 
Find the maximum length of a subarray with almost 2 distinct elements.
• Use a sliding window approach to keep track of the count of distinct elements in the subarray.

• Update the window size based on the number of distinct elements in the subarray.

• Keep track of the maximum length encountered so far.
Answered by AI
Add your answer

1 Question related to tree traversal and another related to finding median in streaming data.