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].
No Answer is Posted For this Question
Be the First to Post Answer
What is the output, suppose list1 is [1, 3, 2], what is list1 * 2 ?
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.
Write a function, tokenize_string(input_string, delimiter_list) that returns a list of strings that are separated by the delimiters. For example: tokenize_string("How now, Mrs. Brown Cow") returns ['How', 'now', 'Mrs', 'Brown', 'Cow']
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.
how are functions defined in python ?
Write a python program to check if a string is a palindrome or not?
Write a program to reverse a number in python?
Write a python program to check common letters in two input strings?
Write a function that takes an unsorted integer array, and returns a three element subset whose sum is zero.
If basic HR function like recruitment, training are outsoureced then, why do companies have their own HR department?
Write a python program to check if a number is a prime number?
Write a python program to print table of a given number?