Algorithms Maximum Sum Rectangle in a Matrix Given a 2D array, we need to find the subarray with the maximum sum of its elements. We solve this using Dynamic Programming in O(N^3) where brute force takes O(N^5)
Algorithms 8 Queens Problem using Branch and Bound In the backtracking approach of solving 8 queens problem, we maintain an 8x8 binary matrix for keeping track of safe cells and update it each time we place a new queen.
Algorithms 8 Queens Problem using Backtracking In this article, we will solve the 8 queens problem using backtracking which will take O(N!) time complexity. We demonstrate it with code.
