Algorithms Kadane's Algorithm for largest subarray sum Kadane's Algorithm is commonly known for Finding the largest sum of a subarray in linear time O(N). We have presented 3 variants of Kadane's Algorithm along with in-depth explanation of basic ideas.
Software Engineering Reducing Time limit of code in Java In this article, we have explored how to make a Java code execute faster by handling Input and Output better. The ways we presented are Scanner class, BufferedReader class, User-defined FastReader Class and Reader Class.
Software Engineering 2D Arrays in Java In this article, we have focused on 2D array in Java which is a variant of the usual 1D array by introducing a new dimension. We have demonstrated different operations with 2D arrays.
Software Engineering 2D Array List in Java An Array List is a dynamic version of array and is supported in Java's collection library. In this article, we have focused on 2D array list in Java along with different methods applicable on it like indexOf.
