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
Tutorial from CupofCode 01. Check out their YouTube channel: https://www.youtube.com/channel/UCwptawgtdrxkG2kWY0OO5mQ
—
Learn to code for free and get a developer job: https://www.freecodecamp.org
Read hundreds of articles on programming: https://medium.freecodecamp.org
And subscribe for new videos on technology: https://youtube.com/subscription_center?add_user=freecodecamp
source
21 Comments
nandini r m
May 31, 2022 12:02 pmTheme should have been black
Handsome_Hero
May 31, 2022 12:02 pmWho cares
𝗛𝗔𝗖𝗧𝗘𝗖𝗛𝗜𝗘 ON INSTAGRAM
May 31, 2022 12:02 pmThe confidence you⬆️⬆️ take in your work is really inspiring and amazing, special thanks.🙏
Charles Peck
May 31, 2022 12:02 pmThanks for this amazing tutorial
Nav
May 31, 2022 12:02 pmanyone knows the background music track ?
Okra Vendakkai
May 31, 2022 12:02 pmlisten to this while sleeping to open the dark portal.
raj Muchahary
May 31, 2022 12:02 pmSir I'm a new to programming language. I wanna know what make Python easy then C, C++ ?
Érico N.
May 31, 2022 12:02 pmWhy the background music 🙄!!?! So annoying
Content Karishma
May 31, 2022 12:02 pmnice video 🙂
Blockchain Domain
May 31, 2022 12:02 pmLove the click bait thumbnail lol
stumit_tech
May 31, 2022 12:02 pmAt 15:01 when you said the bigo function was O(n**3) I stopped watching. The output value has nothing to do with scalability. The bigo function is O(1). Regardless of the value of n provided the function is and always will be:
45 * n * n * n + 20 * n * n + 19
It will always have 5 multiplations and 2 additions. The scale of operatons will remain the same whatever n is, hence O(1).
maryambanoo7
May 31, 2022 12:02 pmit was great, super useful. thanks a lot
Uponn1
May 31, 2022 12:02 pm27:16 this is something new, wasn't there at the 1st part 😀
lol
May 31, 2022 12:02 pmcan you share this Jupiter notebook somewhere?
Dr Kenny
May 31, 2022 12:02 pmreturn len(string) == len(dict.fromkeys([char for char in string.lower()]).keys())
unique charter boolean
Boxsewatio Doxsewstio
May 31, 2022 12:02 pmnice
Dom
May 31, 2022 12:02 pmTONG SENG YENG FAI CHENGS
Nitesh Kumar
May 31, 2022 12:02 pmI'm didnt watch your video and three time before see ad try to open the video but still add in starting so I'm unsubscribed your channel
Scott Dungy
May 31, 2022 12:02 pmIn your compare element method p2 should increment by 1 not 2 if a[p1] and b[p2] are equal otherwise if the first two values are equal it will miss the second
Subhobrata Mukharjee
May 31, 2022 12:02 pmAny has the notebook for this tutorial
Kasey Moloney
May 31, 2022 12:02 pmI have $60,000 how do I invest it?