InterviewBit Problems
Kingdom War : Solved
About the Kingdom War : Solved category
(1)
Shortest 10 line dp solution O(n*m)
(1)
Easy Kadane's algorithm approach in C++
(1)
O(R*C) complexity using Kadane's Algorithm
(1)
Simple O(n^3) approach without DP
(1)
Easy Solution, Taking Max of Sum of Suffix Sums
(1)
Java solution with explanation, using kadanes
(1)
Solution in python 🐍 using kadane's
(1)
Very Easy and Short C++ Sol. with comments
(1)
O(n^3) as we do in finding submatrix with zero sum
(2)
O(M*N ) DP solution
(1)
Different method but an error in runtime
(3)
Error.! Its showing different answers when i am testing via "See Expected Output" and while submitting the code
(1)
My solution to the prob using a vector<vector<int>> of my own
(4)
The most simple solution
(1)
Easy Solution :)
(1)
Kingdom_War_DP_solution_O(rc)
(1)
next page →