Arrays 3: Kadane's Algorithm | Must Do Coding Questions | Interview Preparation | GeeksForGeeks

Опубликовано: 04 Октябрь 2024
на канале: Krishna Teaches

10,210

156

This video contains Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, …
from geeksforgeeks platform.

website link:
https://www.geeksforgeeks.org/must-do...

Topics covered in this video series are:
1.Arrays
   • 1.1 ARRAYS | Must Do Coding Questions
2.String
   • 1.2 STRING | Must Do Coding Questions
3.Linked List
4.Stack and Queue
5.Tree and BST
6.Heap
7.Recursion
8.Hashing
9.Graph
10.Greedy
11.Dynamic Programming
12.Divide and Conquer
13.Backtracking
14.Bit Magic

Arrays:
3. Kadane's Algorithm:
Given an array arr of N integers. Find the contiguous sub-array with maximum sum.

Example:
Input:
N = 5
arr[] = {1,2,3,-2,5}
Output: 9
Explanation: Max subarray sum is 9 of elements (1, 2, 3, -2, 5) which is a contiguous subarray.

Code Link:
https://github.com/krishna-gavas/Comp...

Complete Playlist:
   • 1.1 ARRAYS | Must Do Coding Questions

Intro Music :
   • Video