[Java] Leetcode 677. Map Sum Pairs [Trie #1]

In this video, I'm going to show you how to solve Leetcode 677. Map Sum Pairs which is related to Trie.

Here’s a quick rundown of what you’re about to learn:

⭐️ Course Contents ⭐️
⌨️ (0:00) Question
⌨️ (0:29) Solution Explain
⌨️ (6:48) Code

In the end, you’ll have a really good understanding on how to solve Leetcode 677. Map Sum Pairs and questions that are similar to this Trie.

Now, if you want to get good at Trie, please checkout my Trie playlist.

[siddharthgupta]

Many thanks Eric! I searched everywhere to understand this problem, .

[annabellesun]

Thank you Eric, very clear to understand :D!!

[gigilorenzo]

bro please also talk about the intution behinf this.

[winifred]

Can you explain this problem using two pointer approach plz

[TahliaYeseniaJones]

I used brute force method to solve this problem

[דנִיאל-צק]

In the second solution, if I define dummy root point (e.g., Trie* root) instead of your choice (Trie root), and initialize root in insert() (e.g., if(!root) root = new Trie()), the code will fail. Could you tell me why? Thanks.

[Edith]

which tool do you use for creating videos and sharing blackboard it is very clear ! can you please let us know

[giorgi]

Thanks Sir. By the way, what is the name of the software you use for screen writing?