'Coding has over 700 languages', '67% of programming jobs arenâ€™t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
UHG interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
UHG
3 rounds | 11 Coding problems
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, OOPS, SQL,Operating System
Tip

Tip 1 : Competitive Programming
Tip 2 : Do atleast 2 projects

Application process
Where: Campus
Eligibility: Above 70% marks
Resume tip

Tip 1 : To be precise, mention your technical skills, achievements, dont write anything unnecessary plus write your professional summary good mention your project details in not more than 2 lines and make sure those sentences make sense to reader.
Tip 2 : Resume should be not more than one page. Write everything within one page

Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date8 Aug 2019
Coding problem2

30 Aptitude problems and two coding questions

1. Count Inversions
Moderate
40m average time
55% success
0/80

#### For a given integer array/list 'ARR' of size 'N' containing all distinct values, find the total number of 'Inversions' that may exist.

View more
Problem approach

This problem is classic problem known as inversion count. I solved this problem using merge sort tree and got full points if we apply brute force on this then we will get time limit exceeded so we have to solve this in O(nlogn) complexity.

2. Maximum Subarray Sum
Moderate
25m average time
75% success
0/80

#### For example, given the array [34, -50, 42, 14, -5, 86], the maximum ...

View more
Problem approach

This problem in know as kadane's algorithm i solved this one using single for loop and passed successfully all the test cases.

02
Round
Medium
Face to Face
Duration90 minutes
Interview date7 Aug 2019
Coding problem6

Data structure and algorithms plus object oriented problems

1. Merge Sort
Easy
15m average time
85% success
0/40

#### Example :

View more
Problem approach

Step 1 : I wrote first merge sort algorithm then i explained the worst case complexity for this one.
Step 2 : Interviewer cross questioned me what is divide and conquer approach.
Step 3 : I gave the definition for divide and conquer method
Step 4 : Then I continued explaining quick sort algorithm
Step 5 : Interviewer asked me about worst case scenario for quick sort then i replied w...

View more
2. Write code for catching an exception .
Problem approach

Step 1 : I wrote a code for catching divide by zero exception
Step 2 : Then interviewer asked me about use of try catch finally and implement all in your code
Step 3 : Then I applied try first then catch statement for exception and then i wrote finally block .he was satisfied after my approach

3. What are access modifier explain all using code.
Problem approach

Step 1 : I gave definition for access modifiers public private and protected then i used these modifiers in my code that i wrote in C++.
Step 2 : He asked me if we are in same package then can we access using protected or not then i replied yes.
Step 3 : Then interviewer asked me to write code for friend function.
Step 4 : I was not able to write that code then he helped me to write th...

View more
4. Theoretical problem

What is hashing?
How to remove collision in hashing?

Problem approach

Tip 1 : Do practice about hash table data structure .
Tip 3 : Learn how to remove collision. what are linear probing and quadratic probing

Problem approach

Tip 1 : Clear your concept in object oriented programming
Tip 2 : Do practice on OOPs concept ( Abstraction,Encapsulation,Inheritance,Polymorphism)

6. Delete Node In A Linked List
Easy
15m average time
80% success
0/40

#### You are given a Singly Linked List of integers and a reference to the node to be deleted. Every node of the Linked List has a unique value written on it. Your task is to delete that nod...

View more
Problem approach

Step 1 : I wrote all condition for deletion in linked list first from the beginning of the linked list then between linked list and then deleting last node for linked list
Step 2 : Interviewer asked about complexity for each of them i replied for all three cases.
Step 3 : Then i explained it using diagram how we are implementing this algo
Step 4 : He found an error in my code when we h...

View more
03
Round
Easy
Face to Face
Duration60 miinutes
Interview date7 Aug 2019
Coding problem3

Database questions and discussion about projects

1. DBMS

What is normal form and explain BCNF.

Problem approach

Tip 1 : Do clear your concept of basic dbms topics like functional dependency and normal forms
Tip 2 : Do practice on Sql commands
Tip 3 : Read examples on each normal forms

2. DBMS

What is the difference between while keyword and having keyword?

Problem approach

Tip 1 : Do practice on sql commands
Tip 2 : Read about concepts of Sql like primary key candidate key foreign key
Tip 3 : Read concepts like DDL,DML,DCL

3. Project Explanation

Why machine learning project?
What are data frames?
Difference between classification and regression.

Problem approach

Tip 1 : Do atleast two major projects.
Tip 3 : Do have good knowledge of technologies and stacks that are using in project.

Start a Discussion
Similar interview experiences
4 rounds | 6 problems
Interviewed by UHG
356 views
SDE - 1
5 rounds | 12 problems
Interviewed by UHG
262 views
SDE - 1
4 rounds | 4 problems
Interviewed by UHG
382 views
SDE - 1
3 rounds | 4 problems
Interviewed by UHG
317 views
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
93449 views