data Structure

2 Articles 0 Followers

Trie Data Structure and implementation to insert,search, count, delete words from trie

14 Jan 2022 1 minute read 0 comments The Glitcher

Trie is a tree data structure which is used widely in google autocomplete, spell checker and prefix matching for ip routing in IP tables. It is also a very efficient data structure compared to hashtable in terms of storing and searching the strings...

Trie Data Structure and implementation to insert,search, count, delete words from trie

How to use List Comprehension in Python?

30 Jul 2021 2 minute read 0 comments Amit Kumar1

Hi Guys, In this tutorial I'm going to cover: 1. What is List Comprehension? 2. Advantages of List Comprehension. 3. How to understand and write efficient List Comprehension (we will mostly focus here). 1.What is List Comprehension? List C...