Heap sort is a Heap data structure based comparison sorting technique where we first find the maximum element and place the maximum element at the end. We repeat the same process for remaining elements.
When a write request comes to any node in a Cassandra cluster, the node is called Coordinator for the request and acts as a proxy between the client and the replicas throughout the request cycle.
Find index that divides an array into two subarrays of equal sum, The task is to find the index that divides the array into two subarrays of equal sum. If the array can not be divided in equal sum the method should return -1
Given an array A with length n, the task is to find duplicates within a given range k in the array. We can solve this problem in O(n) time using O(n) extra space.
Given two sorted arrays, A1, A2 the task is to merge them in a sorted manner. We can solve this problem in O(n1+n2) time and O(n1+n2) extra space.