Merge two sorted subarrays A[start, mid - 1] and A[mid, finish - 1] into A[start, finish - 1] and return the number of inversions across A[start, mid

Returns the optimum value when we choose from items[0, k] and have a capacity of available_capacity.

* This method ensures that test data header matches with the signature of * the tested function. * * @param signature - test data header *

* This method ensures that test data header matches with the signature of * the tested function. * * @param signature - test data header *

Partition A[left, right] around pivot_idx, returns the new index of the pivot, new_pivot_idx, after partition. After partitioning, A[left, new_pivot_i

Builds a BST from preorder_sequence[start, end - 1].

Reconstructs the subtree that is rooted at subtreeIdx.

Computes the nodes from the rightmost leaf to the root.

* This method is invoked for each row * in a test data file (except the header). * It deserializes the list of arguments and * calls the user

* This method is invoked for each row * in a test data file (except the header). * It deserializes the list of arguments and * calls the user

Finds the candidates which may occur > n / k times.

Finds the candidates which may occur > n / k times.

Perform DFS to find a feasible path.