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.
- 0 Answers
- 1283 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
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 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.
The sum of three numbers is 20. The second number is 4 times the first number , and the sum of the first and third is8. Find the numbers.
Discuss an algorithm to traverse a tree, depth first.
Write a python program to count the number of digits in a number?
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].
What is the output when we execute list(“hello”)?
how are functions defined in python ?
How do you set a global variable inside a function?
Write a python program to swap the first and last value of a list?
How to print sum of the numbers starting from 1 to 100?
Write a python program to check if a string is a palindrome or not?
PHP Code 
