Help Rohit
Description :-
Rohit live in Janakpuri and uses public transport to go to college that is on Dwarka. The transport from Janakpuri to Dwarka is of two types: cabs and rickshaws. The city has n rickshaws and m cabs, the rickshaws are numbered by integers from 1 to n, the ... Read More

Description :-
N Queen is a problem in which we placing N chess Queens on a N x N chessboard in such a way that no two queens attack each other diagonally, horizontally and vertically.
Input :-
The first line contains a single integer N - the number of Queens and the size ... Read More

In this problem, there can be two cases i.e either the subarray having maximum sum is obtained in a circular fashion or the subarray having maximum sum is obtained in a non-circular fashion.
The non-circular maximum sum subarray ca be obtained directly by KADANE’S ALGORITHM. But the subarray with circular fashion ... Read More