Google UI UX Developer Interview Questions and Answers

Q1. Some basic html, css, js and reactjs questions..
Add your answer
Q2. Basic questions from html css js and reactjs
Add your answer

Round duration - 1 hour
Round difficulty - Medium

Q1. 
First Missing Positive Problem Statement
You are provided with an integer array ARR of length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round was the online coding test conducted on the platform Mettl. The languages allowed were C, C++, Java and Python. There were three questions. One was of graphs (Depth-first search), other was a big integer problem and the third was a string problem.

Q1. 
Graph Coloring Problem Statement
You are provided with a graph consisting of N vertices, numbered from 1 to N, and M edges. Your task is to color the graph using two colors, Blue and Red, such that no two...read more
Ans. 
Given a graph with vertices and edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.
• Check if the graph is bipartite using graph coloring algorithm like BFS or DFS.

• If the graph is bipartite, return 'Possible' with a valid coloring assignment.

• If the graph is not bipartite, return 'Impossible'.
Answered by AI
Add your answer
Q2. 
String Compression Problem Statement
Write a program to perform basic string compression. For each character that repeats consecutively more than once, replace the consecutive duplicate occurrences with t...read more
Ans. 
Write a program to compress a string by replacing consecutive duplicate characters with the character followed by the number of repetitions.
• Iterate through the string and count consecutive occurrences of each character

• Append the character and its count to a new string

• Return the compressed string if it is shorter than the original, else return the original string

• Handle edge cases like single characters or when compresse...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a pen and paper subjective interview round. You were expected to write full code on paper. Make sure you use proper names for the variables and write comments explaining very clearly what the code does. Also, try writing code in good handwriting which can be understood by the interviewer.

Q1. Find the total number of palindromic substrings in a given string.
Ans. 
Count total palindromic substrings in a given string.
• Iterate through each character in the string and consider it as the center of a palindrome. Expand outwards to find all palindromic substrings.

• Use dynamic programming to efficiently check if a substring is a palindrome.

• Consider both odd-length and even-length palindromes.

• Example: Input 'ababa', output 7 (a, b, a, b, a, aba, aba)
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The interview took place in the morning and the interviewer was very friendly.

Q1. 
Count Inversions Problem Statement
Let A[0 ... n-1] be an array of n distinct positive integers. An inversion of A is a pair of indices (i, j) such that i < j and A[i] > A[j]. Given an integer array...read more
Ans. 
Count the number of inversions in an array of distinct positive integers.
• Use merge sort algorithm to count inversions efficiently.

• Divide the array into two halves and recursively count inversions in each half.

• Merge the two sorted halves while counting split inversions.

• Time complexity can be optimized to O(n log n) using merge sort.

• Example: For input A = [2, 4, 1, 3, 5], the output should be 3.
Answered by AI
Add your answer
Q2. 
Sum Tree Conversion Problem Statement
Transform a given binary tree into a sum tree where each node is replaced by the sum of its immediate children's values. Leaf nodes should be replaced with 0. Then, p...read more
Ans. 
Convert a binary tree into a sum tree by replacing each node with the sum of its children's values, and return the preorder traversal.
• Traverse the tree recursively and replace each node with the sum of its children's values

• Leaf nodes should be replaced with 0

• Perform a preorder traversal on the transformed sum tree to get the final result
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

The HR Interview round was held in the morning and it was right after my technical interview.