## Rearrange numbers in an array such that no two adjacent numbers are same

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 »

- Find k closest numbers in an unsorted array
- Building Heap from Array
- Insertion and Deletion in Heaps
- Find m-th smallest value in k sorted arrays
- Maximum number of leaf nodes that can be visited within the given budget
- Find the smallest positive number missing from an unsorted array : Hashing Implementation
- Find the shortest distance between any pair of two different good nodes
- 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
- Rearrange numbers in an array such that no two adjacent numbers are same
- Maximum possible sub-array sum after at most X swaps
- Reduce the array to a single integer with the given operation

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 »

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 »

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 »

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 »

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 »

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 »