Maximum sum sub-array @mycodeschool
Maximum sum sub-array  @mycodeschool
Uploaded June 2014 | Updated November 2026, 3 hours ago
In this lesson, we have solved another famous programming interview question - finding maximum sub-array sum in an array.

See source codes here:
O(n^3) algorithm - gist.github.com/mycodeschool/9666221e7527935d8e1d
O(n^2) algorithm -
gist.github.com/mycodeschool/447854ea1844b1b42cd3
O(NlogN) algorithm -
gist.github.com/mycodeschool/8b4bcff69427c8a6f2aa
O(N) algorithm -
gist.github.com/mycodeschool/4b0b01e1d08932066301

See playlist on programming interview questions here:
youtube.com/playlist?list=PL2_aWCzGMAwLPEZrZIcNEq9ukGWPfLT4A

See series on time complexity here:
youtube.com/watch?v=V42FBiohc6c&list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn&index=2

Analysis of quicksort:
youtube.com/watch?v=3Bbm3Prd5Fo


You may also like/follow us on Facebook/Twitter:
facebook.com/MyCodeSchool
twitter.com/mycodeschool

Video creator : Ashwin Krish - intern at MyCodeSchool
Maximum sum sub-arrayData structures: Array implementation of QueueCount occurrences of a number in a sorted array with duplicates using Binary SearchData structures: Binary Search TreeIntroduction to sorting algorithmsTime Complexity analysis of recursion - Fibonacci SequenceData structures: Introduction to TreesData structures: Array implementation of stacksPointers and 2-D arraysReverse a linked list - Iterative methodPrint 2-D array in spiral orderFunction pointers and callbacks
mycodeschool |

Maximum sum sub-array

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER