Leetcode 1852 | Distinct Numbers in Each Subarray | Sliding Window Technique
Hello everyone! Today we do Leetcode 1852: Distinct Numbers in Each Subarray. It requires a sliding window technique and the use of a HashMap but we go even deeper and use another data structure to be even more efficient!!!
__________________________________________________________________________
Intro/Ending Music by the best DJ - / djganu
__________________________________________________________________________
My favorite graph problems:
Course Schedule: https://leetcode.com/problems/course-...
Course Schedule II: https://leetcode.com/problems/course-...
Sequence Reconstruction: https://leetcode.com/problems/sequenc...
__________________________________________________________________________
My prep tools to ace my interviews:
MIT 6.006: • MIT 6.006 Introduction to Algorithms, Fall...
Free Code Camps Data Structures Easy to Advanced Course: • Data Structures Easy to Advanced Course - ...
The book that I used to ace my interviews - Cracking the Coding Interview: https://amzn.to/38V7aPB
The sites I used to practice interview problems:
Leetcode: https://leetcode.com/
Hackerrank: https://www.hackerrank.com/
CodeSignal: https://codesignal.com/ ________________________________________________________________________
My gear:
My laptop: https://amzn.to/386odPl
My mouse:https://amzn.to/3rYkhZ8
My keyboard: https://amzn.to/3oeagEM __________________________________________________________________________
Disclosure: This videos is not sponsored! All points shared are my own opinions :). Some of the links above are affiliate links.