Maximum sum sub-array
By mycodeschool
Community Score: 50% | 399.1K views | 12y
0 community ratings: null thumbs up, null thumbs down
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 - https://gist.github.com/mycodeschool/9666221e7527935d8e1d O(n^2) algorithm - https://gist.github.com/mycodeschool/447854ea1844b1b42cd3 O(NlogN) algorithm - https://gist.github.com/mycodeschool/8b4bcff69427c8a6f2aa O(N) algorithm - https://gist.github.com/mycodeschool/4b0b01e1d08932066301 See playlist on programming interview questions here: https://www.youtube.com/playlist?list=PL2_aWCzGMAwLPEZrZIcNEq9ukGWPfLT4A See series on time complexity here: https://www.youtube.com/watch?v=V42FBiohc6c&list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn&index=2 Analysis of quicksort: https://www.youtube.com/watch?v=3Bbm3Prd5Fo You may also like/follow us on Facebook/Twitter: https://www.facebook.com/MyCodeSchool https://twitter.com/mycodeschool Video creator : Ashwin Krish - intern at MyCodeSchool
Tags: Maximum Subarray Problem, programming interview, coding, Array Data Structure, Computer Programming (Professional Field), yt:cc=on, Software, interview, Technology, software
More from mycodeschool
- Introduction to programming and programming languages: C Programming Tutorial 01 — Score: 50%
- Graph Representation part 03 - Adjacency List — Score: 50%
- Graph Representation part 02 - Adjacency Matrix — Score: 50%
- Graph Representation part 01 - Edge List — Score: 50%
- Data structures: Properties of Graphs — Score: 50%
- Data structures: Introduction to graphs — Score: 50%