Tries decoded with Apoorv

Introducing Tries, Developing a Trie with Basic Data Structures, Differentiating Tries from Trees, Coding a Trie and Solving Medium/Hard LeetCode questions

About this event

Bad programmers worry about the code.

Good ones worry about data structure and their relationships.

- Linus Torvalds

Strings can essentially be viewed as the most important and common topics for a variety of programming problems. All the content presented to us in textual form can be visualized as nothing but just strings. Formally defining, a trie, also called digital tree or prefix tree, is a kind of search tree โ€” an ordered tree data structure used to store a dynamic set or associative array where the keys are usually strings.

Tries form one of the most important concepts in DSA (Data Structures and Algorithms).

Knowing and being able to use trie to solve questions in placement exams will help an individual gain an edge over other applicants and will also increase their chances of getting placed.

๐Ÿ“Œ Agenda

โœ… Introducing Tries

โœ… Developing a Trie with Basic Data Structures

โœ… Differentiating Tries with Trees

โœ… Coding a Trie

โœ… Solving Medium/Hard LeetCode questions

The code-along session will be presided over by Apoorv Singh Chauhan. Few notable points about him:

- Incoming SDE Intern at Microsoft

- Competitive Programming Lead at Google DSC VIT Chennai

- Specialist at CodeForces

- 5 star on CodeChef

Make sure to join the session, get a firsthand understanding of an important concept of DSA, code-along with an intuitive Competitive Programmer and ace your placement rounds!