GeeksforGeeks interview experience Real time questions & tips from candidates to crack your interview

Intern

GeeksforGeeks
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Journey
My coding journey started in the first year of college. In the beginning, I concentrated on mainly two things: Language Fundamentals (C and C++ in my case) and Logic building (via implementing different algorithms manually). Then, in my second year, I focused on problem solving at GeeksforGeeks and Leetcode. By the end of the third semester, I was feeling confident enough to apply for internship at GeeksforGeeks. I applied for the off-campus internship opportunity at GeeksforGeeks and got selected there for a role of Associate Mentor Intern.
Application story
I applied to this internship opportunity through GeeksforGeeks LinkedIn Page. They always post different internship opportunity alerts in GeeksforGeeks in their LinkedIn Posts.
Why selected/rejected for the role?
I attempted all the coding questions given to me and explained my approach clearly with a discussion of time and space complexity. This was the reason for which I got selected.
Preparation
Duration: 6 months
Topics: Dynamic Programming, OOPS, Data Structures (Arrays, Graphs, Trees, Stack), Algorithms
Tip
Tip

Tip 1 : Prepare DSA for atleast 5-6 months on a regular basis before internship/placement opportunity.
Tip 2 : Having prior teaching experience is a plus point but not necessary.
Tip 3 : Improve your problem solving skills by solving same problem in different ways.

Application process
Where: Linkedin
Eligibility: Eligibility: No CGPA criteria
Resume Tip
Resume tip

Tip 1: 2-3 Projects.
Tip 2: Any kind of achievements mentioned will be a part of discussion in interview (either Academic achievement or any contest rank or anything else).

Interview rounds

01
Round
Easy
Face to Face
Duration30 minutes
Interview date13 Jun 2022
Coding problem2

Timing: Evening
Environment: Pretty chill environment
Focus: This interview round was majorly focused on resume discussion and Algorithms. The Interviewer asked me two DSA based problems and expected me to write the code and discuss the space and time complexity.

1. Missing Number

Moderate
30m average time
70% success
0/80
Asked in companies
FacebookAppleAmazon

You are given an array/list ‘BINARYNUMS’ that consists of ‘N’ distinct strings which represent all integers from 0 to N in binary representation except one integer. This integer between 0 to ‘N’ whose binary representation is not present in list ‘BINARYNUMS’ is called ‘Missing Integer’.

Your task is to find the binary representation of that ‘Missing Integer’. You should return a string that represents this ‘Missing Integer’ in binary without leading zeros.

Note

1. There will be no leading zeros in any string in the list ‘BINARYNUMS’.

Example:

Consider N = 5 and the list ‘binaryNums’=  [“0”, “01”, “010”, “100”, “101”].  This list consists of the binary representation of numbers [0, 1, 2, 4, 5]. Clearly, the missing number is 3 and its binary representation will be “11”. So you should return string “11”.
Problem approach

In the beginning, I explained the approach where I'll be taking each number from 1 to N and checking for its availability.
The Interviewer asked me to optimise the solution.
Then I gave solution with summation approach. Missing number: ((N * (N+1)) / 2) - (Sum of N-1 numbers).

Try solving now

2. Left View Of Binary Tree

Moderate
30m average time
60% success
0/80
Asked in companies
MicrosoftSalesforceJP Morgan

You have been given a Binary Tree of 'n' nodes, where the nodes have integer values



Example :
If the input tree is as depicted in the picture: 

alt text

The Left View of the tree will be:  2 35 2 
Problem approach

Step 1: Define a function called leftView() that accepts the root of the Binary Tree as an argument.
Step 2: Initialize a list called result to store the left view of the Binary Tree.
Step 3: If the root is None, return an empty list.
Step 4: Define a function called dfs() that accepts the root of the Binary Tree, the current level, and the list result as arguments.
Step 5: Inside the dfs() function, check if the current level is greater than or equal to the length of the result list. If it is, then append the current node's value to the result list.
Step 6: After performing Step 5, Recursively call the dfs() function for the left child of the current node, passing the level as the current level plus 1.
Step 7: After performing Step 6, Recursively call the dfs() function for the right child of the current node, passing the level as the current level plus 1.
Step 8: Call the dfs() function with the root of the Binary Tree, the level as 0, and the result list as arguments.
Step 9: Return the result list.

Try solving now
02
Round
Easy
HR Round
Duration30 minutes
Interview date13 Jun 2022
Coding problem1

Timing: Evening
Environment: Pretty chill environment
Focus: This interview round was majorly focused on resume discussion and behavioural questions.
Interviewer also I asked question regarding of my prior projects (that were mentioned in my resume). Then I was asked to describe my previous internship experiences.

1. Basic HR Questions

Can you describe a project you worked on that required you to work outside your comfort zone?

Problem approach

Tip 1: Make sure to use examples of the projects that were mentioned in the resume.
Tip 2: Describe in detail what made your project to move outside your comfort zone.
Tip 3: Also tell how you overcome the problem and finally finished your project.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by GeeksforGeeks
1428 views
0 comments
0 upvotes
company logo
Software Engineer
4 rounds | 6 problems
Interviewed by GeeksforGeeks
798 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 8 problems
Interviewed by GeeksforGeeks
15200 views
1 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by GeeksforGeeks
787 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Intern
2 rounds | 2 problems
Interviewed by Microsoft
1063 views
0 comments
0 upvotes
company logo
Intern
2 rounds | 2 problems
Interviewed by Adobe
734 views
0 comments
0 upvotes
company logo
Intern
3 rounds | 4 problems
Interviewed by Oracle
981 views
0 comments
0 upvotes