GetMega Interview Questions and Answers

Round duration - 90 Minutes
Round difficulty - Medium

The first round was scheduled in the evening time.
First of all interviewer introduced himself and after my introduction 
He directly shoot first DSA question. The question was easy but conceptual. I have solved some question with same concept and he ask me to share the screen and code in online compiler. Finally I was able to get correct output with all the use cases and I was like "Half work done!"
Then he asked me very core concepts of JavaScript along with that Some Output based questions.
Then finally he asked me theory questions on React along with my experience in React. 
The interviewer was very helpful as well as polite. I don't think if he will not help me during interview I could crack the interview

Q1. 
Is the Sentence a Pangram?
Ninja is relocating to a place called NinjaGram, and for school admission, he is required to identify if a given sentence is a pangram. Your task is to assist Ninja in determini...read more
Ans. 
Yes, the sentence is a pangram if it includes every letter of the English alphabet at least once.
• Check if the sentence contains all 26 letters of the English alphabet.

• Convert the sentence to lowercase to simplify the checking process.

• Use a set to keep track of the letters present in the sentence.

• Iterate through the sentence and add each unique letter to the set.

• After iterating, check if the set contains all 26 letters.
Answered by AI
Add your answer

50 mcq were asked in 12 mins. Most of the candidates qualified this round.

3 coding questions of basic DSA were asked. Also few mcqs from Operating System, Networking and DBMS.

Q1. The technical round was of 40 mins. 3 standard questions from DSA were asked for which only approach was enough. Questions were from string, array and tree- Rotated string, Lowest common ancestor, etc.
Add your answer
Q2. Project related discussion regarding my role in the team.
Add your answer
Q3. A few HR questions related to family background. Why not go for higher studies like the rest of my family. Had to convince him that I saw more growth in working for an organisation.
Add your answer

Q1. My introduction then, standard HR questions like where do i see myself in coming yrs, why do i want to join the company, etc. It lasted 10 mins
Add your answer

50 questions in 12 minutes mostly test your arthimetic, logical knowledge.

3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.

Q1. Difference between sorting algorithms
Ans. 
Sorting algorithms are methods used to arrange elements in a specific order.
• Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.

• Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.

• For example, quick sort is generally faster than bubble sort for large data sets.
Answered by AI
View 1 more answer
Q2. BFS and DFS in trees and imlementing them
Ans. 
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
• BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.

• DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
Answered by AI
Add your answer
Q3. Sql questions and database questions
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Explain the college life
Add your answer

Question from Array,DP

Q1. Resume based only
Add your answer
Q2. Data structure and algorithms
Add your answer
Q3. Object oriented programmings
Add your answer

Q1. Behavioural questions
Add your answer

50 questions in 12mins

Q1. Basic DSA question in binary search and memoization
Add your answer

Q1. SQL based questions
Add your answer
Q2. Guesstimate on estimating # users on the application
Ans. 
Estimate the number of users on the application based on market research, user demographics, and industry trends.
• Consider the total addressable market (TAM) for the application

• Analyze user demographics and behavior to estimate adoption rate

• Look at industry benchmarks and competitor data for reference

• Use surveys, focus groups, and user feedback to gather insights

• Consider factors like market saturation, growth potential,
Answered by AI
Add your answer