GeeksForGeeks Software Developer Interview Questions and Answers

Q1. DB Schema Design
Add your answer

Q1. REST API, SQL and SOLID Principles
Add your answer

Q1. Resume Based Round with Manager
Add your answer

Q1. It was basically a salary negotiation round.
Add your answer

Basic DSA questions were asked.

Q1. Discussion over React fundamentals.
Add your answer

Q1. Normal HR questions and negotiation
Add your answer

Q1. Basic react questions
Add your answer

Basic DSA Questions of array

Round duration - 60 minutes
Round difficulty - Easy

In the first inerview round, I was asked two problems, that were based on Data Structures. 

I realized a key point in this round : that sometimes, the interviewer is wrong, and you are right. Still, you should not argue with the interviewer, rather, just accept, and move on. 

This happened in the first coding problem itself, when, I actually used a "map" in c++. The interviewer asked me, to use an "unordered map" Instead of map, saying, that using an unordered map would make the insertion cost O(1) instead of O(log(n)). I refused to this by saying, that using unordered map is risky, as in case of a lot of collisions, it could go O(n). 

Still, the interviewer said, that I were wrong, and said that he had done some competitive programming himself, and he never faced a TLE verdict because of using unordered map. 

And I knew very well, that an Anti-Hash-Test could be created, to enforce a TLE verdict. The interviewer went on to saying that "every competitive programmer in the world would never use a map, rather, always use unordered map".

I slightly smiled to this, but agreed, and later cleared that interview, because of the smooth second problem.

Q1. Anagram Pairs
Pre-requisites: Anagrams are defined as words or names that can be formed by rearranging letters of another word. Such as "spar" can be formed by rearranging letters of "rasp&q...read more
Ans. Count Characters
Anagrams have a unique property: the counts of each distinct character present in both strings are the same. One way to check this is: 
1. Sort both strings, so that all the same characters come together
2. Then loop through both strings together and check each element in both strings one by one
3. If at any position, the characters are found to be different or if the lengths of the two strings are different, ...read more
Answered by CodingNinjas
View 1 more answer
Q2. Distribute N candies among K people
Sanyam has ‘N’ candies, he wants to distribute that into ‘K’ of his friends. He made his ‘K’ friends stand in line, in increasing order of his likeness. Not being so sma...read more
Ans. Brute Force
Here we can simply use the concept of brute force. 
 
• We initialize an array with 0 elements.
• Then we make a variable and initialize it with 1(let’s call it “increment”). This variable is used to keep track of the number of candies to be given to the current friend.
• We start with the first element and increase it by ‘increment’.
• Now we reduce the total number of candies by the variable ‘increment’. (N ...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 60 minutes
Round difficulty - Medium

I were asked several questions involving DBMS. I was given data of patients of entire country, and was asked to make a dataBase for the same.

Q1. DBMS
Create a Database, when you are given the data of all the patients of a country
Add your answer