๐๐๐ ๐๐๐ญ๐ ๐๐ญ๐ซ๐ฎ๐๐ญ๐ฎ๐ซ๐๐ฌ ๐๐ง๐ ๐๐ฅ๐ ๐จ๐ซ๐ข๐ญ๐ก๐ฆ๐ฌ
2 min readNov 19, 2023
๐ DSA is one of the most important topics asked in interviews.
๐น๐๐ซ๐ซ๐๐ฒ๐ฌ: Elements of the same data type, organized in contiguous memory locations.
๐น๐๐ญ๐๐๐ค๐ฌ: Collection of elements that follows the Last-In-First-Out (LIFO) principle, meaning the last element added to the stack is the first one to be removed.
๐น๐๐ฎ๐๐ฎ๐๐ฌ: A collection of elements that follows the First-In-First-Out (FIFO) principle, meaning the first element added to the queue is the first one to be removed.
๐น๐๐ข๐ง๐ค๐๐ ๐ฅ๐ข๐ฌ๐ญ๐ฌ: A sequence of nodes that each contain a value and a reference to the next node in the list.
๐น๐๐ซ๐๐ฉ๐ก๐ฌ: A collection of nodes or vertices that are connected by edges or arcs, representing a network of relationships or connections.
๐น๐๐ซ๐๐: a data structure that consists of a collection of nodes connected by edges or branches, with a single root node at the top and child nodes branching out from it.
๐น๐๐ซ๐ข๐: A Trie (pronounced โtryโ) is a tree-based data structure that is commonly used for fast string matching and searching.
๐น๐๐๐ฌ๐ก: A hash table, also known as a hash map, is a data structure that stores data in an associati format, where data is accessed by its key rath T its index.
