Python Algorithms for Interviews

21 Comments



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
    • blank
      nandini r m
      May 31, 2022 12:02 pm Reply

      Theme should have been black

    • blank
      Handsome_Hero
      May 31, 2022 12:02 pm Reply

      Who cares

    • blank
      𝗛𝗔𝗖𝗧𝗘𝗖𝗛𝗜𝗘 ON INSTAGRAM
      May 31, 2022 12:02 pm Reply

      The confidence you⬆️⬆️ take in your work is really inspiring and amazing, special thanks.🙏

    • blank
      Charles Peck
      May 31, 2022 12:02 pm Reply

      Thanks for this amazing tutorial

    • blank
      Nav
      May 31, 2022 12:02 pm Reply

      anyone knows the background music track ?

    • blank
      Okra Vendakkai
      May 31, 2022 12:02 pm Reply

      listen to this while sleeping to open the dark portal.

    • blank
      raj Muchahary
      May 31, 2022 12:02 pm Reply

      Sir I'm a new to programming language. I wanna know what make Python easy then C, C++ ?

    • blank
      Érico N.
      May 31, 2022 12:02 pm Reply

      Why the background music 🙄!!?! So annoying

    • blank
      Content Karishma
      May 31, 2022 12:02 pm Reply

      nice video 🙂

    • blank
      Blockchain Domain
      May 31, 2022 12:02 pm Reply

      Love the click bait thumbnail lol

    • blank
      stumit_tech
      May 31, 2022 12:02 pm Reply

      At 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).

    • blank
      maryambanoo7
      May 31, 2022 12:02 pm Reply

      it was great, super useful. thanks a lot

    • blank
      Uponn1
      May 31, 2022 12:02 pm Reply

      27:16 this is something new, wasn't there at the 1st part 😀

    • blank
      lol
      May 31, 2022 12:02 pm Reply

      can you share this Jupiter notebook somewhere?

    • blank
      Dr Kenny
      May 31, 2022 12:02 pm Reply

      return len(string) == len(dict.fromkeys([char for char in string.lower()]).keys())

      unique charter boolean

    • blank
      Boxsewatio Doxsewstio
      May 31, 2022 12:02 pm Reply

      nice

    • blank
      Dom
      May 31, 2022 12:02 pm Reply

      TONG SENG YENG FAI CHENGS

    • blank
      Nitesh Kumar
      May 31, 2022 12:02 pm Reply

      I'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

    • blank
      Scott Dungy
      May 31, 2022 12:02 pm Reply

      In 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

    • blank
      Subhobrata Mukharjee
      May 31, 2022 12:02 pm Reply

      Any has the notebook for this tutorial

    • blank
      Kasey Moloney
      May 31, 2022 12:02 pm Reply

      I have $60,000 how do I invest it?

Leave us a comment