GEVME Manager Interview Questions and Answers

Q1. Tell me about yourself
Add your answer
Q2. About the job role and about the company
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

It was the first round. Was taken online and there were 2 invigilators from the company

Q1. 
Remove Duplicates from String Problem Statement
You are provided a string STR of length N, consisting solely of lowercase English letters.
Your task is to remove all duplicate occurrences of characters i...read more
Ans. 
Remove duplicate occurrences of characters in a given string.
• Use a hash set to keep track of characters seen so far.

• Iterate through the string and add non-duplicate characters to a new string.

• Return the new string as the result.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Face to face interview with a senior software developer

Q1. How can you cut a circular cake into 8 pieces using only 3 cuts?
Add your answer
Q2. 
Count Ways To Reach The N-th Stair Problem Statement
You are given a number of stairs, N. Starting at the 0th stair, you need to reach the Nth stair. Each time you can either climb one step or two steps. ...read more
Ans. 
The problem involves finding the number of distinct ways to climb to the N-th stair by taking either one or two steps at a time.
• Use dynamic programming to solve this problem efficiently.

• Define a recursive function to calculate the number of ways to reach each stair.

• Consider base cases for 0 and 1 stairs.

• Use memoization to store and reuse intermediate results to avoid redundant calculations.

• Return the result modulo 10^9
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Questions around my resume mainly and 1 coding question. Was taken by the engineering manager

Q1. 
Lowest Common Ancestor (LCA) Problem Statement
Understanding the concept of Lowest Common Ancestor (LCA) in graph theory and computer science is essential.
Consider a rooted tree ‘T’ containing ‘N’ nodes...read more
Ans. 
The Lowest Common Ancestor (LCA) problem involves finding the lowest node in a tree that is an ancestor of two given nodes.
• LCA is the lowest node in a tree that is an ancestor of both given nodes.

• The tree is rooted at node 1 for each test case.

• Paths from each node to the root are considered to find the LCA.

• Constraints include the number of test cases, nodes, queries, and node values.

• Time limit for the solution is 1 sec
Answered by AI
Add your answer

Q1. Pattern question
Add your answer
Q2. * pattern all basic to advanced
Add your answer

Q1. Skill and Aptitude for the position
Add your answer
Q2. Awareness of the platform
Add your answer
Q3. Awareness of the Saas market
Add your answer
Q4. Expectations of the Interviewee
Add your answer

Q1. - Javascript Question (Clouser, Hoisting, this etc)
Add your answer

Q1. React lifecycles, Hooks questions
Add your answer

Q1. Java oops concepts and garbage collector
Add your answer
Q2. Buy and sell stocks 2 of leetcode
Ans. 
Design an algorithm to buy and sell stocks to maximize profit
• Use a greedy approach to find the maximum profit by buying at the lowest price and selling at the highest price

• Keep track of the minimum price seen so far and update the maximum profit if a higher price is found

• Return the maximum profit that can be achieved
Answered by AI
Add your answer