## Recursive program to print reverse of a given string

Given a string, print it in reverse using recursion. For example, consider the input string “Techie Delight”. The output should be “thgileD eihceT”.

Coding made easy

Given a string, print it in reverse using recursion. For example, consider the input string “Techie Delight”. The output should be “thgileD eihceT”.

Given a sorted array of integers, find index of first or last occurrence of a given number. If the element is not found in the array, report that as well.

Given a circular sorted array of integers, search an element in it. Assume there are no duplicates in the array and the rotation is in anti-clockwise direction.

Given a sorted array of distinct positive integers, print all triplets that forms Arithmetic Progression with integral common difference. An Arithmetic Progression is a sequence of numbers such that the difference between the consecutive terms is constant. For instance, the sequence 5, 7, 9, 11, 13, 15, . . . is an arithmetic progression …

Given a circularly sorted array of integers, find the number of times the array is rotated. Assume there are no duplicates in the array and the rotation is in anti-clockwise direction.

Given a sorted array of integers and a target value, find out if a target exists in the array or not in O(log(n)) time. If target exists in the array, print index of it.

Given a sorted array of integers and a target, find out if a target exists in the array or not. If target exists in the array, print index of it.

Given a sorted array of distinct positive integers, print all triplets that forms Geometric Progression with integral common ratio. A Geometric Progression is a sequence of numbers where each term after the first is found by multiplying the previous one by a fixed, non-zero number called the common ratio. For example, the sequence 2, …

Given an M x M matrix, find maximum sum sub-matrix present in it.

Given a M x N matrix, calculate maximum sum submatrix of size k x k in a given M x N matrix in O(M*N) time. Here, 0 < k < M, N.

Given a M x N matrix and two coordinates (p, q) and (r, s) which represents top-left and bottom-right coordinates of a sub-matrix of the given matrix, calculate the sum of all elements present in the sub-matrix in O(1) time. Here, 0 < = p < r < M and 0