LeetCode Interview Questions and Answers

Q1. Project discussion
Add your answer
Q2. Technical Project discussion
Add your answer

Q1. Question on anagram whether we can form with given strings
Add your answer
Q2. Play random song from list without repetition
Ans. 
Use Fisher-Yates shuffle algorithm to play songs randomly without repetition.
• Create an array of songs

• Use Fisher-Yates shuffle algorithm to shuffle the array

• Play the first song in the shuffled array

• Remove the first song from the array

• Repeat steps 3-4 until all songs have been played
Answered by AI
Add your answer
Q3. Reverse the linked list
Ans. 
Reverse a linked list
• Iterate through the linked list and change the direction of the pointers

• Keep track of the previous, current, and next nodes

• Set the head of the linked list to the last node after reversing
Answered by AI
Add your answer
Q4. Range sum with the queries
Add your answer
Q5. Hashing on 2d matrix counting max 1
Ans. 
Hashing algorithm to count maximum number of 1s in a 2D matrix.
• Create a hash table to store the count of 1s in each row.

• Traverse through each row and update the count in the hash table.

• Find the row with the maximum count of 1s in the hash table.

• Return the count of 1s in that row.
Answered by AI
Add your answer
Q6. React interviews hooks
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

Round 1 -> Coding interview -> ask 2 Leetcode problems
Round 2-> HR

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

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

Q1. Basic react questions
Add your answer

Basic DSA Questions of array

In first round, interviewer asked 2 coding questions and to write code on the call itslef.

Q1. HLD - High level Design
Add your answer
Q2. Design a system similar to BookMyShow
Ans. 
Design a system similar to BookMyShow for booking tickets for events and movies.
• User registration and login system

• Event and movie listing with details and show timings

• Seat selection and booking process

• Payment gateway integration

• Booking history and ticket download option
Answered by AI
Add your answer

Q1. LLD - Low level design
Add your answer

Q1. Database schema design
Add your answer