Can you solve this Twitter interview problem?

@that_swe_intern

7.0K followers · usually 4.5K views a post

Views

89.1K

Likes

5.4K

Comments

98

Shares

56

SoundTikTok sound · Trap, hip hop, dark beat ♪(963369)

Why it worked

The video provides high-value, actionable educational content for a specific niche (software engineering candidates) and uses a popular, recognizable platform (LeetCode) to build immediate credibility.

Summary

The creator walks through the solution to a LeetCode coding problem titled 'Valid Anagram'. He explains the logic, writes the Python code, and demonstrates that the solution is highly efficient.

Structure

1Present the coding challenge
2Define the problem requirements
3Walk through example cases
4Write the Python solution
5Verify the performance results

Call to action

Follow for more and comment down below if you would have passed this interview.

On-screen text

Can You Solve This Twitter Interview Problem? This problem should be easy! 242. Valid Anagram Example 1: Input: s = "anagram", t = "nagaram" Output: true Example 2: Input: s = "rat", t = "car" Output: false # (letter, count) for char in s: need[char] += 1 for char in t: need[char] -= 1 return all([cnt == 0 for cnt in need.values()]) Accepted Follow for more!

Original caption

Would you pass Twitter’s interview? Follow to level up in tech! #leetcode #techinterview #compscimajor #twitter #breakintotech

More from @that_swe_intern

More breakout videos from this creator.

Transcript

Can you solve this Twitter interview problem? Make sure that you know how to solve this because it's a basic problem that they expect you to know. All right, today we're covering valid anagram. Given two strings s and t, return true if t is an anagram of s, and false otherwise. An anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. All right, example one, if our strings are anagram and nagaram, then the output should be true because they both have the same exact letters. Example two, if our strings are rat and car, the output should be false because they contain different letters. All right, so to solve this question, we know that we need some counts, so let's set up a hash map. And this hash map will store our letter and its count. Then for each character inside s, we can increment the count of that letter. Then for each character inside t, we need to subtract from our letter counts. Finally, at the end, if all the counts were zero, then we know they had the same letters. All right, let's see if this works. And there we go, we beat 99% of Python submissions. All right, follow for more and comment down below if you would have passed this interview.