Hyper Verge interview experience Real time questions & tips from candidates to crack your interview

Business Analyst

Hyper Verge
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: DBMS, OS, Programming basics, OOPS, Aptitude, Data Structures and algorithms
Tip
Tip

Tip 1 : Prepare your resume well and bold out the important skills/achievements
Tip 2 : Practice at least 150 medium level questions from online platforms
Tip 3 : Make sure to have 1 Major project and 2 Minor project in your resume

Application process
Where: Campus
Eligibility: 8.5 CGPA
Resume Tip
Resume tip

Tip 1 : Don't include local certifications
Tip 2 : Only write those skills which you possess or can talk about

Interview rounds

01
Round
Medium
Online Coding Interview
Duration180 minutes
Interview date24 Nov 2021
Coding problem2

It was conducted on evening 5 pm to 8 pm. We got a mail to login 30 minutes before the scheduled test. The test was proctored. there were 3 sections : aptitude, debugging and coding.

1. Median of two sorted arrays

Hard
25m average time
65% success
0/120
Asked in companies
ArcesiumLinkedInApple

Given two sorted arrays 'a' and 'b' of size 'n' and 'm' respectively.


Find the median of the two sorted arrays.


Median is defined as the middle value of a sorted list of numbers. In case the length of list is even, median is the average of the two middle elements.


The expected time complexity is O(min(logn, logm)), where 'n' and 'm' are the sizes of arrays 'a' and 'b', respectively, and the expected space complexity is O(1).


Example:
Input: 'a' = [2, 4, 6] and 'b' = [1, 3, 5]

Output: 3.5

Explanation: The array after merging 'a' and 'b' will be { 1, 2, 3, 4, 5, 6 }. Here two medians are 3 and 4. So the median will be the average of 3 and 4, which is 3.5.
Problem approach

I did it by first getting medians of the two sorted arrays and then comparing them.
Median = (max(ar1[0], ar2[0]) + min(ar1[1], ar2[1]))/2

Try solving now

2. Max Sum After 'K' Negations

Easy
15m average time
85% success
0/40
Asked in companies
CognizantSamsung R&D InstituteIntuit

You are given an array/list ‘arr’ of size ‘N’. Find the maximum sum of the elements of the array you can obtain after flipping the sign of exactly ‘K’ elements

For example :
Let arr = [-2, 0, 5, -1, 2]
and K = 4

We will output 10 as we replace -2 by 2, -1 by 1, 0 by 0, and 0 by 0.
Note :
We can apply the flip operation to the same element multiple times
Problem approach

This problem has a very simple solution.
Replace the minimum element arr[i] in the array by -arr[i] for the current operation. 
In this way, we can make sum of the array maximum after K operations.

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date25 Nov 2021
Coding problem3

It was an interview round where I was asked about both of my projects and the technologies used, motivation behind the project, difficulties faced and the internships which I mentioned in my resume. It consisted of some OS and DBMS questions and a problem to code.

1. Operating System

  • What is RAID structure in OS? What are the different levels of RAID configuration?
  • What is virtual memory?
  • Explain paging?
  • Define Page Replacement Algorithms?
Problem approach

Tip 1 : Focus on OS fundamentals

Tip 2 : Use internet to get some frequently asked questions of OS

2. DBMS

  • What are keys? Explain different kinds of keys.
  • What are joins?
  • What is normalization?
Problem approach

Tip 1 : Focus on DBMS fundamentals

Tip 2 : Use internet to get some frequently asked questions of DBMS

3. Check Palindrome

Easy
0/40
Asked in companies
EXL ServiceThalesOptum

Step 1 : Get the number to check for palindrome.

Step 2 : Hold the number in temporary variable.

Step 3 : Reverse the number.

Step 4 : Compare the temporary number with reversed number.

Step 5 : If both numbers are same, print "palindrome number"

Step 6 : Else print "not palindrome number"

Problem approach

Step 1 : Get the number to check for palindrome.

Step 2 : Hold the number in temporary variable.

Step 3 : Reverse the number.

Step 4 : Compare the temporary number with reversed number.

Step 5 : If both numbers are same, print "palindrome number"

Step 6 : Else print "not palindrome number"

Try solving now
03
Round
Easy
HR Round
Duration30 minutes
Interview date26 Nov 2021
Coding problem1

HR welcomed me and asked about my past life and achievements. It was a normal HR Round

1. Basic HR Questions

  • Tell me about yourself
  • What are your biggest achievements till now?
  • What motivated you to join Hyper Verge?
  • Where do you see yourself in 5 years
Problem approach

Tip 1 : Prepare beforehand your weaknesses and strengths
Tip 2 : Tell the interviewer about how will you turn your weaknesses into strengths
Tip 3 : Always maintain a decent smile on face

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - Intern
3 rounds | 4 problems
Interviewed by Hyper Verge
3715 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
1632 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
1100 views
0 comments
0 upvotes
company logo
System Engineer
2 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
878 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Business Analyst
3 rounds | 8 problems
Interviewed by Paytm (One97 Communications Limited)
752 views
0 comments
0 upvotes
company logo
Business Analyst
3 rounds | 5 problems
Interviewed by Paytm (One97 Communications Limited)
1026 views
0 comments
0 upvotes