Kadane's Alogorithm | maximum subarray sum | Coding Challenge By Hariom 😎

I’m excited to announce the launch of the 100 Days Coding Challenge, designed for anyone who struggles with Data Structures and Algorithms (DSA) and wants to overcome the fear of solving DSA problems to get interview-ready.
This ultimate challenge will boost your confidence and prepare you for FAANG-level interviews. By solving just one problem a day, you’ll build consistency, strengthen your skills, and increase your self-confidence.
Join us on this life-changing coding journey, and invite others to take part in this transformative challenge!
• Code / Day
Here is the Problem Link
leetcode.com/p...
Tags -
kadane's alogorithm
100 days coding
faang interview questions
coding problems
complete DSA revision
complete DSA in 100 days
#coding #dsa #easycoding #gfg #leetcode

[@ShreyashIngle-r7x]

int maxSubArray(vector& nums) { int sum =0; int maxi = nums[0]; for(int i=0;i