Determine the two Strings Are Close | leetcode 1657

Показать описание

1) 0:00 Explaining the problem out loud
2) 1:28 Algorithm walkthrough
3) 7:00 Coding it up
4) 12:00 Time complexity

TC : O(max( l1, l2 ))
SC:O(1)

Рекомендации по теме

Комментарии

Thank you for this nice detailed explanation. Please keep it up.

omnamahshivaya

it's failing for the test case: and

sakshamsrivastava

Is there any way to be guided personally .

ushmitadutta

hashsets don't allow duplicates, so isn't this solution missing something ?
consider the case that 2 strings has the same chars and has the same frequencies but one of the frequencies is repeated differently in both strings, for example
string1 : aaabbbcc, string2: aaabbcc
so both char sets will be equal and both int(occurrences) sets will be equal (2, 3), (2, 3) but this actually should produce false

abdelrahmankamal

Hey man, How can be the SC be 1?. you are creating 6 containers (2 arrays, 4 sets) and in the worst case, you will push all the chars in all the containers. How can it be O(1)?. Isn’t something like O(6*N?.

RajatSingh-dgov

Determine the two Strings Are Close | leetcode 1657

Java Tutorial - 10 - Determining if Two Strings are Equal

To Check whether two strings are Anagrams

Leetcode 1657. Determine if Two Strings Are Close

Check if two strings are anagrams

Determine if Two Strings Are Close | Live Coding with Explanation | Leetcode #1657

Check if two strings are anagrams

Check Two Strings are Anagram Or Not using Sort and Equals in Java

Check Whether Two Strings Are Anagram Of Each Other | C++ Program

Strings in Java | Vishwa Mohan | Day-16

Isomorphic Strings - Leetcode 205 - Python

Valid Anagram - Leetcode 242 - Python

Java Program To Check Whether Two Strings are Anagram Or Not? Java Interview Questions and Answers

Check if two strings are k-anagrams or not | GeeksforGeeks

Anagram | Check whether two strings are Anagram of each other | Java

Greatest Common Divisor of Strings - Leetcode 1071 - Python

How to check if Two Strings are Anagrams in Python

Leetcode | Easy | 2068. Check Whether Two Strings are Almost Equivalent | Hash Table | Javascript

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

Interleaving Strings - Dynamic Programming - Leetcode 97 - Python

Check if two given strings are isomorphic to each other | GeeksforGeeks

Check Two Strings are Anagrams or Not - Java Code

Java Tutorial 11 - Comparing Two Strings

Isomorphic Strings (LeetCode 205) | Full solution using a HashMap | Easy to understand

Check if two strings have a common substring | GeeksforGeeks