LeetCode #242: Valid Anagram | Beginner's Coding Interview

preview_player
Показать описание
A step-by-step explanation of #LeetCode question 242: Valid Anagram
0:00 Problem overview
1:09 Code walkthrough
4:27 Variations

#programming #algorithms #coding
  1. Algo Engine
  2. programming
  3. leetcode
  4. coding
  5. algorithms
  6. faang
Рекомендации по теме
Valid Anagram - 0:12:01

Valid Anagram - Leetcode 242 - Python

LeetCode 242. Valid 0:06:23

LeetCode 242. Valid Anagram Solution Explained - Java

Google Interview Question! 0:00:54

Google Interview Question! | Valid Anagram - Leetcode 242

LeetCode 242. Valid 0:16:00

LeetCode 242. Valid Anagram - Interview Prep Ep 135

LeetCode 242: Valid 0:03:58

LeetCode 242: Valid Anagram [Python]

LeetCode 242 - 0:05:22

LeetCode 242 - Valid Anagram | Java Solution

LeetCode: 242. Valid 0:05:27

LeetCode: 242. Valid Anagram - Python

242. Valid Anagram 0:04:56

242. Valid Anagram - Leetcode (Python)

Valid Anagram - 0:03:44

Valid Anagram - Leetcode 242 - Hashmaps & Sets (Python)

Valid Anagram | 0:08:33

Valid Anagram | LeetCode problem 242

LeetCode 242. Valid 0:10:53

LeetCode 242. Valid Anagram Solution Explained - Java

LeetCode #242 - 0:14:22

LeetCode #242 - Valid Anagram

LeetCode #242: Valid 0:05:24

LeetCode #242: Valid Anagram | Beginner's Coding Interview

Valid Anagram | 0:03:24

Valid Anagram | Решение на Python | LeetCode 242

LeetCode 242 - 0:03:40

LeetCode 242 - Valid Anagram Solution Explained (JavaScript)

Leetcode 242 - 0:00:28

Leetcode 242 - Valid Anagram

Determine if two 0:08:22

Determine if two strings/phrases are valid Anagrams | Study Algorithms

Leetcode 242 Valid 0:00:36

Leetcode 242 Valid Anagram

Valid Anagram - 0:04:26

Valid Anagram - LeetCode 242 - JavaScript

Valid Anagram - 0:10:30

Valid Anagram - LeetCode 242 - Python

Leetcode 242. Valid 0:06:10

Leetcode 242. Valid Anagram [Java] P.S. with additional follow up solution

Leetcode 242 - 0:06:40

Leetcode 242 - Valid Anagram

LeetCode 242 - 0:11:05

LeetCode 242 - Valid Anagram - C++

242 Valid Anagram. 0:09:26

242 Valid Anagram. Leetcode.com. Решение на Java

Комментарии
Автор

pls put more videos and more problems solutions sir please

Shivaji_
Автор

You’re really good man! Don’t stop making videos!

dnm
Автор

I understand your videos better than neetcode lol

josephinehan
Автор

Big fan of the channel and your videos! Another implementation you can do is to write a counter helper function that creates a dict and iterates through. Then return Counter(s) == Counter(t) in the main function.

rojerdu
Автор

What if we just did collections.Counter(string) for each and return the comaprison result ?
Like is it worse in time or space complexity? as per my understanding its O(n) in both same as your code?
or is it frowned upon during interviews?

srx
Автор

You said you could use an array instead of a dictionary ( like a -> 0, b -> 1, etc ). But how can you get the number of each character in the string, like what the dicitonary does, right it counts how many time you see a char in the string, you can't do that with an array where the index is set. Doesn't make sense.

aqualinespirit