N-queens problem (Backtracking) - Inside code

Sdílet
Vložit
  • čas přidán 27. 03. 2022
  • Source code: gist.github.com/syphh/e607806...
    🔴 Learn graph theory algorithms: inscod.com/graphalgo
    ⚙ Learn dynamic programming: inscod.com/dp_course
    💡 Learn to solve popular coding interview problems: inscod.com/50problems_course
    ⌛ Learn time and space complexity analysis: inscod.com/complexity_course
    🔁 Learn recursion: inscod.com/recursion_course
    NB: This video is ad-free, you can choose to support Inside code by purchasing one of the courses above or dropping a super thanks!
    NB2: Discounts of courses above are permanent
    I also post content on LinkedIn (inscod.com/linkedin) and Instagram (inscod.com/instagram)
  • Věda a technologie

Komentáře • 22

  • @frogloki882
    @frogloki882 Před rokem +3

    So suprised to see that you have only 20k subscribers.The content is too good.

  • @grandparick3176
    @grandparick3176 Před 2 lety +1

    This is amazing. Specially the visual presentation and how you explained in details.

  • @pai.sudhindra
    @pai.sudhindra Před 2 lety +3

    💯 🔥 So greatly done in explaining and animation. Thanks 🙌

  • @sallaklamhayyen9876
    @sallaklamhayyen9876 Před 3 měsíci

    Brilliant explanation = thank you so much🥰

  • @mrboyban
    @mrboyban Před 2 lety

    Couldn't have come at a better time. Follow you on Udemy but didn't find this problem there
    Many thanks for posting it !

  • @user-en5er8oe4r
    @user-en5er8oe4r Před 7 měsíci

    your videos deserve more views

  • @florinmatei8846
    @florinmatei8846 Před 2 lety

    Alrite, it is time now for me to play again , the smart one. I was imagining some study in the recent past of my unemploied nobody here but I dont know if it really works nor how well, if it does doing anything more like it. Inspired by the Jacobi technique to solve aproximatively for linear eqs systems we might try iteratve , high precisons yet polynomial order complexty, to compute , in the end of the algo running, the whole amount of the number of solutions for some 20 per 20 board for the N-queens problem. But , as a knowing rule on these computers, nothing gets too easy. :-) And the most important, congratulations for Your work here!

  • @AviPars
    @AviPars Před 2 lety

    Great programming channel... maybe speed it up 1.25 x and add background music and then you are there

  • @balaeinstein8710
    @balaeinstein8710 Před 2 lety

    great animation . Thank you

  • @LucaS-ri3zq
    @LucaS-ri3zq Před rokem

    bro thank you for this amazing video

  • @microhacker2411
    @microhacker2411 Před 2 lety +1

    What tools are used to create animations and simulations?
    This is great. Keep going! 💖💖❤❤

    • @insidecode
      @insidecode  Před 2 lety +4

      Animations with PowerPoint and for the last animation (process when n=5) I made it with Python by generating an image for each state of the board during the process then sticking them to make a video

    • @microhacker2411
      @microhacker2411 Před 2 lety +2

      @@insidecode There is a lot of work. Awesome.

  • @meditationdanny701
    @meditationdanny701 Před 2 lety

    In the case 1 the complexity should be nPr not nCr as we need to arrange n queens on n^2 space

    • @insidecode
      @insidecode  Před 2 lety +1

      But the order of queens doesn't matter