GeeksForGeeks Software Developer Interview Questions and Answers

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 Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Determine if two strings are anagrams of each other by checking if they can be rearranged to form the other string.
• Create a frequency map of characters for both strings and compare them.

• Sort both strings and compare them.

• Use a set to store characters and their counts for each string, then compare the sets.
Answered by AI
Add your answer
Q2. 
Distribute N Candies Among K People
Explanation: Sanyam wishes to distribute 'N' candies among 'K' friends. The friends are arranged based on Sanyam's order of likeness. He initially distributes candies s...read more
Ans. 
Distribute N candies among K friends in Sanyam's order of likeness, incrementing distribution by K each round.
• Distribute candies starting from 1st friend, incrementing by K each round

• If remaining candies are fewer than what a friend is supposed to receive, stop distribution

• Output the number of candies each friend ends up with at the end of distribution
Answered by AI
Add your answer

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. How would you create a database to store the data of all the patients in a country?
Add your answer