Google Sdet Interview Questions and Answers for Experienced

Given a 2D array of alphabets and a function to check valid English words, find all possible valid words adjacent to each other.

• Create a recursive function to traverse the 2D array and check for valid words

• Use memoization to avoid redundant checks

• Consider edge cases such as words with repeating letters

• Optimize the algorithm for time and space complexity

Insert a node at its correct position in a circular linked list containing sorted elements.

• Traverse the linked list until the correct position is found

• Handle the case where the value to be inserted is smaller than the smallest element or larger than the largest element

• Update the pointers of the neighboring nodes to insert the new node

• Consider the case where the linked list has only one node

Rain water tapping problem involves calculating the amount of water that can be trapped between given bars.

• Calculate the maximum height of bars on left and right of each bar.

• Calculate the amount of water that can be trapped between two bars using the minimum of the two maximum heights.

• Add up the amount of water trapped between all bars to get the total amount of water trapped.

Explanation of UART, SPI, CAN, I2C timing diagrams and frame formats.

• UART: asynchronous serial communication, start and stop bits, baud rate

• SPI: synchronous serial communication, master-slave architecture, clock polarity and phase

• CAN: differential serial communication, arbitration, error detection and correction

• I2C: synchronous serial communication, master-slave architecture, addressing, clock stretching