🚀 Top Coding Interview Concepts – Part 2 💻

11. Stack 
A linear data structure that follows the LIFO (Last In, First Out) principle. The last element added is the first one removed.

12. Queue 
A linear data structure that follows the FIFO (First In, First Out) principle. The first element added is the first one removed.

13. Hash Table (Hash Map) 
A data structure that stores key-value pairs and provides fast insertion, deletion, and lookup using a hash function.

14. Tree 
A hierarchical data structure consisting of nodes connected by edges, commonly used to represent hierarchical relationships.

15. Binary Search Tree (BST) 
A special type of binary tree where values smaller than the root are stored on the left, and larger values on the right.

16. Graph 
A collection of nodes (vertices) connected by edges, used to model relationships such as social networks or maps.

17. Sorting 
The process of arranging data in a specific order, such as ascending or descending, to improve searching and processing.

18. Searching 
The process of finding a specific element within a collection of data using algorithms like Linear Search or Binary Search.

19. Time Complexity 
A measure of how the execution time of an algorithm grows as the input size increases, commonly represented using Big-O notation.

20. Space Complexity 
A measure of the amount of memory an algorithm requires relative to the input size, helping evaluate memory efficiency.

💬 Double Tap ❤️ for Part 3!