i
Google Operations Center
Filter interviews by
Dsa algo question with 45 min time period
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There was 1 interview round.
Binary search tree can be searched recursively by comparing the search value with the node value.
Start at the root node
If the search value is less than the node value, search in the left subtree
If the search value is greater than the node value, search in the right subtree
If the search value is equal to the node value, return the node
If the search value is not found, return null
Top trending discussions
I applied via Approached by Company and was interviewed in Jun 2024. There were 3 interview rounds.
A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward.
Use dynamic programming to solve this problem efficiently.
Iterate through the string and expand around each character to find the longest palindrome.
Consider both odd and even length palindromes.
Example: Input 'babad', Output 'aba' or 'bab'.
Generate all possible subsequences of a given string.
Use recursion to generate all possible combinations of characters in the string.
At each step, include or exclude the current character to form subsequences.
Store each subsequence in an array of strings.
Find and print the longest substring with k unique characters in an array of strings.
Iterate through the array of strings and keep track of the longest substring with k unique characters.
Use a sliding window approach to efficiently find the longest substring.
Keep a hashmap to store the frequency of characters in the current window.
Update the window boundaries based on the number of unique characters.
Return the longest
I applied via campus placement at Maulana Azad National Institute of Technology (NIT), Bhopal and was interviewed in Jul 2024. There were 2 interview rounds.
3 questions easy-medium level leetcode problem I solved 2 completely and 3rd question partially (9/15 test cases passed) to move on to 2nd round
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
1. PEAK ELEMENT QUESTION.
2. COIN DENOMINATION
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
Create a pagination component using an API to display data for different pages.
Use API to fetch data for each page
Implement pagination logic to display data for each page
Allow users to navigate between pages
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There were 2 interview rounds.
Data structures, theoretical quesiton, past project discussion.
Data structure medium problem asked in the interview
I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.
Given some ant ui design to reacreate from scretch
Deep copy is a copy of an object that duplicates all of its attributes, including nested objects, rather than just copying references.
Deep copy creates a new object with its own unique memory space.
Changes made to the original object do not affect the deep copy.
Deep copy is often used when you need to modify an object without affecting the original.
Example: Using JSON.parse(JSON.stringify(object)) in JavaScript to crea
Interview experience
based on 5 reviews
Rating in categories
Senior Associate
279
salaries
| ₹3.7 L/yr - ₹13.6 L/yr |
Digital Media Specialist
115
salaries
| ₹5.3 L/yr - ₹12.2 L/yr |
Digital Marketing Specialist
90
salaries
| ₹5 L/yr - ₹15 L/yr |
Analyst
87
salaries
| ₹2.5 L/yr - ₹7.2 L/yr |
Senior Customer Support Associate
76
salaries
| ₹4 L/yr - ₹9 L/yr |
Amazon Development Centre India
Microsoft Corporation
IBM
Accenture