Permutation in String - Leetcode 567 - Fixed Sliding Window (Python)
ฝัง
- เผยแพร่เมื่อ 12 ก.ย. 2024
- Master Data Structures & Algorithms for FREE at AlgoMap.io/
Code solutions in Python, Java, C++ and JS for this can be found at my GitHub repo here: github.com/gah...
Complete DSA Pathway Zero to Hero: • Data Structures & Algo...
Please check my playlists for free DSA problem solutions:
• Fundamental DSA Theory
• Array & String Questions
• 2 Pointers Questions
• Sliding Window Questions
• Binary Search Questions
• Stack Questions
• Linked List Questions
• Tree Questions
• Heap Questions
• Recursive Backtracking...
• Graph Questions
• Dynamic Programming (D...
My Data Science & ML TH-cam Playlist: • Greg's Path to Become ...
Learn Python and Data Science FASTER at mlnow.ai :)
University of California DSA Certificate on Coursera: bit.ly/3CYR6wR
Longest Substring Without Repeating Characters (Sliding Window Algorithm) - • Longest Substring With...
Best Courses for Analytics:
---------------------------------------------------------------------------------------------------------
+ IBM Data Science (Python): bit.ly/3Rn00ZA
+ Google Analytics (R): bit.ly/3cPikLQ
+ SQL Basics: bit.ly/3Bd9nFu
Best Courses for Programming:
---------------------------------------------------------------------------------------------------------
+ Data Science in R: bit.ly/3RhvfFp
+ Python for Everybody: bit.ly/3ARQ1Ei
+ Data Structures & Algorithms: bit.ly/3CYR6wR
Best Courses for Machine Learning:
---------------------------------------------------------------------------------------------------------
+ Math Prerequisites: bit.ly/3ASUtTi
+ Machine Learning: bit.ly/3d1QATT
+ Deep Learning: bit.ly/3KPfint
+ ML Ops: bit.ly/3AWRrxE
Best Courses for Statistics:
---------------------------------------------------------------------------------------------------------
+ Introduction to Statistics: bit.ly/3QkEgvM
+ Statistics with Python: bit.ly/3BfwejF
+ Statistics with R: bit.ly/3QkicBJ
Best Courses for Big Data:
---------------------------------------------------------------------------------------------------------
+ Google Cloud Data Engineering: bit.ly/3RjHJw6
+ AWS Data Science: bit.ly/3TKnoBS
+ Big Data Specialization: bit.ly/3ANqSut
More Courses:
---------------------------------------------------------------------------------------------------------
+ Tableau: bit.ly/3q966AN
+ Excel: bit.ly/3RBxind
+ Computer Vision: bit.ly/3esxVS5
+ Natural Language Processing: bit.ly/3edXAgW
+ IBM Dev Ops: bit.ly/3RlVKt2
+ IBM Full Stack Cloud: bit.ly/3x0pOm6
+ Object Oriented Programming (Java): bit.ly/3Bfjn0K
+ TensorFlow Advanced Techniques: bit.ly/3BePQV2
+ TensorFlow Data and Deployment: bit.ly/3BbC5Xb
+ Generative Adversarial Networks / GANs (PyTorch): bit.ly/3RHQiRj
Become a Member of the Channel! bit.ly/3oOMrVH
Follow me on LinkedIn! / greghogg
Full Disclosure:
Please note that I may earn a commission for purchases made at the above sites! I strongly believe in the material provided; I only recommend what I truly think is great. If you do choose to make purchases through these links; thank you for supporting the channel, it helps me make more free content like this!
Master Data Structures & Algorithms For FREE at AlgoMap.io!
This is a more clear explanation than Neetcode. Solidified the concept right away. Thanks!
OMG! This is the clearest explanation I have seen! Really hope you keep making videos!
Really glad to hear that
Better than Neetcode's explanation on the same problem, and more simple/ straightforward too! Came here cuz the neetcode one was too confusing and long
After watching 3 other videos, this is the clearest of them all, finally understood this problem. Fantastic explanations, pls don't stop making leetcode videos.
Another video you explained better than anyone else! Thanks greg!
Very clear and detailed line by line explanation which helped me to understand the algorithm better. Thank you for your efforts !!!!
The count array gets rid of the permutation problem and the sliding window trick gives a nicely scalable iteration. Edit: watched to the end... Nice
This is an epic explanation! Thank you!
Glad to hear it, thanks a ton!!
Really helpful and well explained
Glad to hear it, thanks a ton!
Simple and elegant, thank you for the great video
You're very welcome :)
It's easy to understand, thank you!
Why we build up s2 count array in the first for loop? Why can't we just build it from start in the second loop?
It's just easier this way iirc
drawing tool name please
Good video
elegant.
just do this
class Solution:
def checkInclusion(self, s1: str, s2: str) -> bool:
check = Counter(s1)
temp = {}
k=len(s1)
for i in range(len(s2)):
if i
confusing solution
again, why don't you stick to dictionaries lol
you just got a new sub, thank you