Path Crossing - Leetcode 1496 - Python

🚀 neetcode.io/ - A better way to prepare for Coding Interviews
🧑‍💼 LinkedIn: / navdeep-singh-3aaa14161
🥷 Discord: / discord
🐦 Twitter: / neetcode1
🐮 Support the channel: / neetcode
⭐ BLIND-75 PLAYLIST: • Two Sum - Leetcode 1 -...
💡 DYNAMIC PROGRAMMING PLAYLIST: • House Robber - Leetco...
Problem Link: leetcode.com/problems/path-cr...
0:00 - Read the problem
0:16 - Drawing Explanation
4:10 - Coding Explanation
leetcode 1496
#neetcode #leetcode #python

[@KUBD996]

Thanks for the video

[@Vancha112]

Easy problems keep this fun ^^

[@flatmapper]

Thank you!

[@CS_n00b]

Why is everything this month easy

[@shehza-d]

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

[@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.

[@sumayasuruvi534]

Easy problem 🎉

[@user-fg4xu8wn1y]

Nice bro me second

[@HeroHunter07]

Ok first comment

[@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 ?