Crowdsource by Google - Jaipur Community interview experience Real time questions & tips from candidates to crack your interview
Software Developer
Crowdsource by Google - Jaipur Community
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Journey
I initially aimed to join the defence forces, but I couldn't join the NDA due to a physical issue. Afterwards, I took the JEE Mains exam and enrolled in a B.Tech college.
Application story
This company visited our campus for placements, open to every student from the Computer Science and IT departments with a CGPA of more than 8.
Why selected/rejected for the role?
I was rejected because I was unable to answer all the questions confidently; therefore, I believe I did not qualify.
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, Data Science and Data Analytics
Tip 1: Participate in live contests on coding platforms as much as possible.
Tip 2: Practice previous interview questions.
Tip 3: Thoroughly revise Computer Science subjects like DBMS and OOPS.
Application process
Where: Campus
Eligibility: 6.5 and above
Tip 1: Start your resume with a brief summary or objective statement that highlights your qualifications and career goals. Keep it concise and impactful, summarizing your key strengths and areas of expertise.
Tip 2: Instead of merely listing job responsibilities, emphasize your achievements and the impact you made in previous roles. Quantify your accomplishments where possible, using numbers and metrics to demonstrate the results of your work. This approach helps showcase your abilities and differentiate yourself from other candidates.
Interview rounds
01
Round
Easy
Video Call
Duration60 minutes
Interview date28 Jan 2023
Coding problem2
In addition to DSA questions, the technical interview also included inquiries related to DBMS. We were asked to demonstrate our knowledge of database concepts such as normalization, indexing, querying, and transaction management. The interviewer gauged our ability to design efficient database schemas and optimize query performance.
1. Array Of Doubled Pair
Moderate
20m average time
80% success
0/80
Alice and Bob were playing the game. Alice challenged to bob to solve the following problem. The problem description is as follows:
Given an integer array 'ARR' of even length 'N', find if it is possible to reorder the array such that such that 'ARR[2 * i + 1]' = 2 * 'ARR[2 * i]' for every 0 <= 'i' < 'N' / 2.
Your task is to help bob to solve the task given by Alice to him.
EXAMPLE:
Input: ARR = [4, 3, 2, 6]
Output: true
Explanation: Given array can be transformed like this [3, 6, 2, 4] which follows the rule 'ARR[2 * i + 1]' = 2 * 'ARR[2 * i]' for every 0 <= i < 'N' / 2.
Problem approach
Sort the array in ascending order.
Initialize an empty dictionary to keep track of the count of each element in the array.
Iterate through the sorted array.
For each element, check if its double (2 * element) exists in the dictionary and has a count greater than zero.
If yes, decrease the count of both the element and its double in the dictionary.
If no, check if the element itself exists in the dictionary and has a count greater than zero.
If yes, decrease the count of the element in the dictionary.
If no, return False as there is no valid pair.
If you successfully iterate through the entire array without returning False, return True.
2. Maximum Sum Path Of A Binary Tree
Hard
25m average time
75% success
0/120
Asked in companies
You are given a binary tree having 'n' nodes. Each node of the tree has an integer value.
Your task is to find the maximum possible sum of a simple path between any two nodes (possibly the same) of the given tree.
A simple path is a path between any two nodes of a tree, such that no edge in the path is repeated twice. The sum of a simple path is defined as the summation of all node values in a path.
02
Round
Easy
Video Call
Duration60 minutes
Interview date28 Jan 2023
Coding problem2
1. Intersection Of Two Sorted Arrays
Easy
10m average time
90% success
0/40
Asked in companies
You are given two arrays 'A' and 'B' of size 'N' and 'M' respectively. Both these arrays are sorted in non-decreasing order. You have to find the intersection of these two arrays.
Intersection of two arrays is an array that consists of all the common elements occurring in both arrays.
Note :
1. The length of each array is greater than zero.
2. Both the arrays are sorted in non-decreasing order.
3. The output should be in the order of elements that occur in the original arrays.
4. If there is no intersection present then return an empty array.
Problem approach
Create two dictionaries, dict1 and dict2, to store the frequency of each element in both arrays.
Iterate through the first array and update dict1 with the frequency of each element.
Iterate through the second array and check if each element exists in dict1. If it does, decrease its frequency in dict1 and add it to the result array.
Finally, return the result array containing the common elements.
2. Next Greater Element
Easy
10m average time
90% success
0/40
Asked in companies
You are given an array 'a' of size 'n'.
Print the Next Greater Element(NGE) for every element.
The Next Greater Element for an element 'x' is the first element on the right side of 'x' in the array, which is greater than 'x'.
If no greater elements exist to the right of 'x', consider the next greater element as -1.
For example:
Input: 'a' = [7, 12, 1, 20]
Output: NGE = [12, 20, 20, -1]
Explanation: For the given array,
- The next greater element for 7 is 12.
- The next greater element for 12 is 20.
- The next greater element for 1 is 20.
- There is no greater element for 20 on the right side. So we consider NGE as -1.
Problem approach
Create an empty stack and a result array of the same length as the input array, initialized with -1 values.
Iterate through the input array from right to left.
While the stack is not empty and the current element is greater than the element at the top of the stack, pop elements from the stack and update their corresponding positions in the result array with the current element.
Push the current element onto the stack.
Finally, return the result array.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4898 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
1042 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6638 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3638 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Developer
5 rounds | 14 problems
Interviewed by Microsoft
Selected 4029 views
1 comments
0 upvotes
Software Developer
6 rounds | 12 problems
Interviewed by SAP Labs
Selected 2912 views
0 comments
0 upvotes
Software Developer
3 rounds | 3 problems
Interviewed by Amazon
Selected 1270 views
0 comments
0 upvotes