Path Crossing - Leetcode 1496 - Python

[@Vancha112]

Easy problems keep this fun ^^

[@flatmapper]

Thank you!

[@KUBD996]

Thanks for the video

[@samarthjain5015]

I used list to keep track of all the points like [[0,0],[0,1]]. Doesn't lists have lookup O(n)? But it gave me 35ms.

[@CS_n00b]

Why is everything this month easy

[@shehza-d]

Well this was my first month doing LC and it's Steak 😅😂

[@sumayasuruvi534]

Easy problem 🎉

[@HeroHunter07]

Ok first comment

[@Kiyotaka-m3l]

Nice bro me second

[@anjanobalesh8046]

We can add a length check on the input too initially
If len(input)

[@js2000honda]

NS should be true

[@Akmabedinkadersafi-O]

This condition Will not Work

[@gnanaprakashm843]

How about this case
NSNS?

[@anjanobalesh8046]

@@Akmabedinkadersafi-O why

[@anjanobalesh8046]

@@js2000honda what is ns ?