clang-format on ------------------------------------------------SOLVE----------------------------------------------*/ This variation of ibnary search

Function to invert a given binary tree using preorder traversal

>>> invert_modulo(2, 5) 3 >>> invert_modulo(8,7) 1

Function to check whether a Binary Tree is BST or not.

You are required to complete below method */

check if stack is empty

Function to check if the candidate occurs more than n/2 times */

Function to check whether string is palindrome

* Internal method to test if a positive number is prime. * Not an efficient algorithm. */

Function to check if arr is sorted in ascending order or not

This function returns true if S is a subtree of T, otherwise false */

This function return boolean value to check whether the word/sentence is a palindrome or not.

Function to check if brackets are balanced or not.

To construct and return LCP */

Returns ((public key), (private key))\\ p, q should not be revealed anywhere.

Function to return max value that can be put in knapsack of capacity W.

arr : given array l : starting index of the array i.e 0 r : ending index of the array i.e size-1 k : find kth largest element and return using this fu

Solution for the problem statement.

Function to find the length of longest common subsequence in two strings.