Python Algorithms for Interviews

Learn about common algorithm concepts in Python and how to solve algorithm challenges you may encounter in an interview.

⭐️Contents⭐️
⌨️ (0:00:00) Big O Notation
⌨️ (0:22:08) Big O Examples
⌨️ (0:43:01) Array Sequences
⌨️ (0:53:23) Dynamic Arrays
⌨️ (1:06:26) Array Algorithms
⌨️ (1:20:40) Largest Sum
⌨️ (1:31:27) How to Reverse a String
⌨️ (1:57:32) Array Analysis
⌨️ (2:00:00) Array Common Elements
⌨️ (2:28:54) Minesweeper
⌨️ (3:08:16) Frequent Count
⌨️ (3:16:58) Unique Characters in Strings
⌨️ (3:28:35) Non-Repeat Elements in Array

--

[CoolCoder_]

such a king. I dropped out of college because I cant afford it, and now I am learning my passion for free. Thank you so much!

[leonid]

1:20:40 explanation: the wording of the problem is confusing but his solution is still correct. What you are actually looking for is at which point of the array the total of the array is at the maximum height. It helps to graph this to better visualize it. original numbers [ 7, 1, 2, -1, 3, 4, 10, -12, 3, 21, -19] possible peaks where numbers are summed. [ 8, 10, 9, 12, 16, 26, 14, 17, 38, 19] If you graph this out you will see several local maximums such as 10, 26 and 38.

[soapsydoopsy]

This is best of python video I saw till date with explanation and perfect debugging which helped me understand the stuff I missed. And TBT I take around a week to month to complete a video of this time range. This I did in just 3 days. Too awesome to let it wait. Thanks

[LrdKGB]

@CupofCode 01 is the best instructor so far 👍

[bhishanpoudel]

Awesome tutorial at nice speed. Especially I liked the pycharm debugging examples rather than just jupyter-notebook typings.

[theegreatestever]

Wow I actually get Big O notation now after all this time. Thank you for this series and I am gonna be putting timestamps for myself here
Day 1 - 43:04

[BayesianBrain]

Thank you for this. This is helping me sharpen my fundamentals for my YouTube technical interview.

[davidadu-tenkorang]

So much in love with this tuto. A great tutorial for a confused beginner.

[sonhills]

Omg, this cant come at a better time than now. Thank you

[swimmingshi]

In array common elements, if you put p2 += 2, then input list with for example, [1, 3, 4, 5, 6, 7, 8], [1, 3, 7, 8, 9, 10]. you get result of [1, 7] which clearly wrong, because the algorithm is skipping p2[1] which p1[1] equals to.

It should be revised as p2 += 1

[raphaelgregorio]

kontennya tidak pernah membosankan, , semoga sukses dan sehat selalu supaya bisa selalu berbagi konten²

[thesohelshaikh]

⭐️Contents⭐️
⌨️ (0:00:00) Big O Notation
⌨️ (0:22:08) Big O Examples
⌨️ (0:43:01) Array Sequences
⌨️ (0:53:23) Dynamic Arrays
⌨️ (1:06:26) Array Algorithms
⌨️ (1:20:40) Largest Sum
⌨️ (1:31:27) How to Reverse a String
⌨️ (1:57:32) Array Analysis
⌨️ (2:00:00) Array Common Elements
⌨️ (2:28:54) Minesweeper
⌨️ (3:08:16) Frequent Count
⌨️ (3:16:58) Unique Characters in Strings
⌨️ (3:28:35) Non-Repeat Elements in Array

[gabrielburgos]

This is great, also, love the Mass Effect menu music

[vinothkumar-uidp]

You have done all the hard work for splitting the string "s" and returned reversed(s) instead of reversed(words) @ 1.47.00 :)

[mdkaiserali]

you are an angel for us ....love from india

[azr]

Just what I need right now. Comprehensive and clear. Thank you :)

[marekprovaznik]

Correct me if I'm wrong but I think there's a little bug on line 23 in 59:12. I think there should be count[letter] = -1 rather than count[letter] = 1 because this way function returns True for anagram("Clint Eastwood", "Old WEST ActionKK") even if the K letter is not in the first sentence at all.

[moratakki]

I just like how background music changes at 27:30 from chill to mission impossible vibes

[vinothkumar-uidp]

On "Non-Repeat Elements in Array" problem, if item[1] == y[0][1]: will produce the first item's count which can't be one when there are no unique chars in a string e.g "aa bb". It must be replaced with "if item[1] == 1"

[williamthompson]

The explanation for the Largest Sum algorithm is a little vague. He says that the the algorithm is looking for the "maximum sum of the array", but the algorithm doesn't take subarrays into account. It seems that the algorithm is starting from the first element, and then seeing how far you can iterate down the array to get the maximum, before adding new elements decreases your current_sum.