## Maximise the number of toys that can be purchased with amount K using min Heap

Given an array arr[] consisting of the cost of toys and an integer K depicting the amount of money available to purchase toys. The task… Read More »

- Building Heap from Array
- Find k closest numbers in an unsorted array
- Insertion and Deletion in Heaps
- Introduction to Data Structures | 10 most commonly used Data Structures
- Find the smallest positive number missing from an unsorted array : Hashing Implementation
- Rearrange numbers in an array such that no two adjacent numbers are same
- Uniform-Cost Search (Dijkstra for large Graphs)
- TIAA Internship Experience - Pool campus for Internship
- Minimize the sum calculated by repeatedly removing any two elements and inserting their sum to the Array
- Maximum possible sub-array sum after at most X swaps
- Reduce the array to a single integer with the given operation
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Maximise the number of toys that can be purchased with amount K using min Heap
- Pairing Heap
- Implementation of Non-Preemptive Shortest Job First using Priority Queue

Given an array arr[] consisting of the cost of toys and an integer K depicting the amount of money available to purchase toys. The task… Read More »

Read here for Shortest Job First Scheduling algorithm for same arrival times. Shortest job first (SJF) or shortest job next, is a scheduling policy that… Read More »

Pairing Heap is like a simplified form Fibonacci Heap. It also maintains the property of min heap which is parent value is less than its… Read More »

Given a string str consisting of lowercase alphabets and an integer K, you can perform the following operations on str Initialize an empty string X… Read More »

A data structure is a particular way of organizing data in a computer so that it can be used effectively. The idea is to reduce… Read More »

Given an array of integers. The task is to rearrange elements of the array such that no two adjacent elements in the array are same.… Read More »

Given an unsorted array with both positive and negative elements including 0. The task is to find the smallest positive number missing from the array… Read More »

Given an array arr[] of N integers and an integer X, the task is to find the maximum possible sub-array sum after applying at most… Read More »

Given an array arr[] of N integers from 1 to N. The task is to perform the following operations N – 1 times. Select two… Read More »

Given an unsorted array and two numbers x and k, find k closest values to x. Examples: Input : arr[] = {10, 2, 14, 4,… Read More »

Given an array of N elements. The task is to build a Binary Heap from the given array. The heap can be either Max Heap… Read More »

Deletion in Heap Given a Binary Heap and an element present in the given Heap. The task is to delete an element from this Heap.… Read More »

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 »

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 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 »