DSA-in-December

✨ Day 25: Trie & Huffman Coding ✨

📌 Trie data structure is defined as a Tree based data structure that is used for storing some collection of strings and performing efficient search operations on them. The word Trie is derived from reTRIEval, which means finding something or obtaining it.

📌 Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, lengths of the assigned codes are based on the frequencies of corresponding characters.

✏️ 𝗙𝗼𝗿 𝗯𝗲𝘁𝘁𝗲𝗿 𝘂𝗻𝗱𝗲𝗿𝘀𝘁𝗮𝗻𝗱𝗶𝗻𝗴 𝗿𝗲𝗳𝗲𝗿 𝗳𝗼𝗹𝗹𝗼𝘄𝗶𝗻𝗴 𝗮𝗿𝘁𝗶𝗰𝗹𝗲𝘀 ;

Huffman Coding

1. https://www.geeksforgeeks.org/huffman-coding-greedy-algo-3/amp/
2. https://www.programiz.com/dsa/huffman-coding
3. https://www.tutorialspoint.com/Huffman-Coding-Algorithm

Trie

1. https://www.geeksforgeeks.org/introduction-to-trie-data-structure-and-algorithm-tutorials/amp/
2. https://www.javatpoint.com/trie-data-structure
3. https://www.scaler.com/topics/data-structures/trie-data-structure/

📽️ 𝗧𝘂𝘁𝗼𝗿𝗶𝗮𝗹 𝗟𝗶𝗻𝗸𝘀;

Huffman Coding

1. https://youtu.be/0kNXhFIEd_w
2. https://youtu.be/uDS8AkTAcIU

Trie

1. https://youtu.be/dOXfffhl4uI
2. https://youtu.be/m9zawMC6QAI
3. https://www.youtube.com/watch?v=dBGUmUQhjaM&list=PLgUwDviBIf0pcIDCZnxhv0LkHf5KzG9zp
4. https://www.youtube.com/watch?v=soJgGe1CQHw

👨‍💻 𝗤𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝗶𝗻𝗴 𝗥𝗼𝘂𝗻𝗱: 👇

1. https://leetcode.com/problems/implement-trie-prefix-tree/
2. https://bit.ly/3ocRQW0
3. https://www.codingninjas.com/codestudio/problem-details/pattern-matching_1229403
4. https://leetcode.com/problems/palindrome-pairs/
5. https://leetcode.com/problems/encode-and-decode-tinyurl/solutions/302761/c-using-huffman-coding/