Great video sir! You made it so easy to understand because you showed WHY is it important to learn which made me much more interested in learning tries. Please keep making videos, and keep up the great work!
Great explaining, i have a question about the trieNode struct, most of the ressources that i have seen make two fields which are (struct TrieNode * child[26] and int endsofword) instead of 3 fields like you have explained, so what's the right implementation, please ?
@@uzairjavedakhtar3718 UNIT- P/NP: P and NP classes. Polynomial time verification. Reducibility. Some example reductions. Approximate algorithms: vertex-cover, TSP, set covering (overview only). With Complexity Analysis. UNIT - Special Topics Longest Common substring, Longest common subsequences, Multithreaded Algorithms - Basics: Computations DAG‘s, performance measures, scheduling, analysis. matrix multiplication, merge sort.Stencil based computations. pls try to cover these topics also sir..
