## Minimize the sum calculated by repeatedly removing any two elements and inserting their sum to the Array

Given N elements, you can remove any two elements from the list, note their sum and add the sum to the list. Repeat these steps… Read More »

## TIAA Internship Experience – Pool campus for Internship

I applied to TIAA through college internship process. Round 1: Online Test The test was conducted on CoCubes platform. The test consisted of aptitude and… Read More »

## Uniform-Cost Search (Dijkstra for large Graphs)

Uniform-Cost Search is a variant of Dijikstra’s algorithm. Here, instead of inserting all vertices into a priority queue, we insert only source, then one by… Read More »

## Find the shortest distance between any pair of two different good nodes

Given a weighted undirected connected graph with N nodes and M edges. Some of the nodes are marked as good. The task is to find… Read More »

## Find m-th smallest value in k sorted arrays

Given k sorted arrays of possibly different sizes, find m-th smallest value in the merged array. Examples: Input: m = 5 arr[][] = { {1,… Read More »

## Maximum number of leaf nodes that can be visited within the given budget

Given a binary tree and an integer b representing budget. The task is to find the count of maximum number of leaf nodes that can… Read More »

## K-th Greatest Element in a Max-Heap

Given a max-heap of size n, find the kth greatest element in the max-heap. Examples: Input : maxHeap = {20, 15, 18, 8, 10, 5,… Read More »

## K’th Least Element in a Min-Heap

Given a min-heap of size n, find the kth least element in the min-heap. Examples: Input : {10, 50, 40, 75, 60, 65, 45} k… Read More »

## Max Heap in Java

A max-heap is a complete binary tree in which the value in each internal node is greater than or equal to the values in the… Read More »

## Double ended priority queue

A double ended priority queue supports operations of both max heap (a max priority queue) and min heap (a min priority queue). The following operations… Read More »

## Canonical Huffman Coding

Huffman Coding is a lossless data compression algorithm where each character in the data is assigned a variable length prefix code. The least frequent character… Read More »

## Maximums from array when the maximum decrements after every access

Given an integer K and an array of integers arr, the task is to find the maximum element from the array and after every retrieval… Read More »

## Sum and product of k smallest and k largest composite numbers in the array

Given an integer k and an array of integers arr, the task is to find the sum and product of k smallest and k largest… Read More »

## Sum and product of k smallest and k largest prime numbers in the array

Given an integer k and an array of integers arr, the task is to find the sum and product of k smallest and k largest… Read More »

## Average of max K numbers in a stream

Given a list of ‘N’ numbers, and an integer ‘K’. The task is to print the average of max ‘K’ numbers after each query where… Read More »