HyperVerge Interview Questions, Process, and Tips

Round duration - 180 minutes
Round difficulty - Medium

It was a 3-hr coding round that started at around 6 PM. It had 2-3 coding questions. The test was on InterviewBit.

Q1. 
K-th Permutation Sequence of First N Natural Numbers
Determine the K-th permutation from a sequence of the first N natural numbers.
Input:
Integer T indicating the number of test cases followed by 'T' t...read more
Ans. 
The task is to find the Kth permutation of the sequence of first N natural numbers.
• Generate all possible permutations of the sequence of first N natural numbers

• Sort the permutations in lexicographical order

• Return the Kth permutation from the sorted list
Answered by AI
Add your answer
Q2. 
Palindromic Substrings Problem Statement
You are given a string 'STR'. Your task is to determine the total number of palindromic substrings present in 'STR'.
Example:
Input:
"abbc"
Output:
5
Explana...read more
Ans. 
The task is to find the total number of palindromic substrings in a given string.
• Iterate through each character in the string and consider it as the center of a potential palindrome

• Expand outwards from the center to check if the substring is a palindrome

• Count the number of palindromic substrings found
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Technical interview - comprised of discussion on projects, internships and solving DSA problems.
In my case major part was discussion on projects. I had done projects in Android, iOS and Web Dev. The interviewer himself was very experienced in these fields so he asked thorough questions to test my knowledge.
The DSA problems were at par with what was asked in the coding round, and he just wanted the pseudo-code.
The interview took place on Google Meet at around noon.

Q1. 
Longest Common Subsequence Problem Statement
Given two strings, S and T with respective lengths M and N, your task is to determine the length of their longest common subsequence.
A subsequence is a seque...read more
Ans. 
The problem is to find the length of the longest common subsequence between two given strings.
• A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.

• We can solve this problem using dynamic programming.

• Create a 2D array to store the lengths of the longest common subsequences for all possible prefixes of the two strings.

• It...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was very friendly. The first thing he told me was to relax because I was done with the hard part. This round consisted of general questions like - 
1. What do you consider to be your greatest strengths and weaknesses?
2. What do you plan to do in the upcoming years?
3. Will you want to pursue higher education?
4. How has your journey at your college been?
5. Do you think you’re a team player? Give some instances to prove it.
6. If I were to call your friends and ask them about your biggest weaknesses, what do you think they’ll say?

Very interestingly, after the last question, he asked me to name a few of my friends and asked for their phone numbers too.
I was very nervous about if he was actually going to call them and ask this question.