plz tell me the exam date for clerks in sbi
Given a N by N matrix of both negative and positive integers. Write an efficient algorithm to find the sub-matrix with the largest sum of all the contained elements.
Discuss an algorithm to traverse a tree, depth first.
Write a function to efficiently convert a floating point number to a rational number. For example, given 0.125 return "1/8"
Write a function that takes an unsorted integer array, and returns a three element subset whose sum is zero.
Write a function that takes an array of integers and returns that array rotated by N positions. For example, if N=2, given the input array [1, 2, 3, 4, 5, 6] the function should return [5, 6, 1, 2, 3, 4]
Write a function that takes an array of integers and efficiently calculates and returns the Least Common Multiply in python.
Write a function that takes as input a binary tree, and prints out each level of the tree on a newline. For example: a / b c / / d e f will output: a b c d e f
Write a function that takes an integer and returns the smallest number that is greater than the given number which is a palendrome. For example, if the input was 111 the next palindromic number would be 121.
Given a circular list of integers (when you reach the end of the list you come back to the beginning), what is the most efficient algorithm to find the smallest integer in the list? For example: circular_list = [22, 52, 66, 82, 5, 8, 12, 19].