3235. Check if the Rectangle Corner Is Reachable (Leetcode Hard)

Sdílet
Vložit
  • čas přidán 7. 09. 2024
  • Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real engineer solving a problem live - no cuts or edits!
    Problem: leetcode.com/p...
    Twitch: / larryny
    Discord: / discord
    Instagram: / larrysomewhere
    #leetcode #coding #programming

Komentáře • 4

  • @Algorithmist
    @Algorithmist  Před měsícem

    Did you get your corners covered?

  • @arjunkhanna2450
    @arjunkhanna2450 Před měsícem

    I almost did apply the exact same logic but still couldn't wrap my head around some corner cases. This video really helped me learn about how to go about solving a problem. Thanks :)

  • @jaideepkukkadapu2600
    @jaideepkukkadapu2600 Před měsícem

    Thanks for solving every week for us : )

  • @chetan8395
    @chetan8395 Před měsícem

    i am facing same issue with (x1,y1,r1) and (y1,x1,r1) , not able to submit , i think need to verify if mid point of intersection present in rectangle