## UHG(United Health Group) Interview Experience | Set 4 (On-Campus)

Eligibility criteria : 70 % OR 7 CGPA and above. Round 1.1 30 aptitude questions in 45 minutes .paper was bit tricky and was at… Read More »

- Rearrange numbers in an array such that no two adjacent numbers are same
- Shortest path from source to destination such that edge weights along path are alternatively increasing and decreasing
- Minimize the sum calculated by repeatedly removing any two elements and inserting their sum to the Array
- Minimum operations required to make every element greater than or equal to K
- Maximum possible sub-array sum after at most X swaps
- Reduce the array to a single integer with the given operation
- Print the final string when minimum value strings get concatenated in every operation

Eligibility criteria : 70 % OR 7 CGPA and above. Round 1.1 30 aptitude questions in 45 minutes .paper was bit tricky and was at… Read More »

A PriorityQueue is used when the objects are supposed to be processed based on the priority. It is known that a queue follows First-In-First-Out algorithm,… Read More »

Given an undirected, connected and weighted graph, find Minimum Spanning Tree (MST) of the graph using Prim’s algorithm. Input : Adjacency List representation of above… Read More »

Given a graph and a source vertex in graph, find shortest paths from source to all vertices in the given graph. Input : Source =… Read More »

Priority queues are a type of container adapters, specifically designed such that the first element of the queue is the greatest of all elements in… Read More »

A typical Priority Queue requires following operations to be efficient. Get Top Priority Element (Get minimum or maximum) Insert an element Remove top priority element… Read More »

Priority Queue is an extension of queue with following properties. Every item has a priority associated with it. An element with high priority is dequeued… Read More »

First of all, a very very big thanks to whole team of geeks for geeks. It is because of them only that I was able… Read More »