Preface
Consider the content of this site before this section as part 1. Next sections will be part 2. In part 2 we will cover 2 things.
Basic Data Structures
Problem Solving Concepts
These concepts are not to be confused to the concepts we studied in part 1. The concepts in part 1 were to make you ready for understanding these concepts. Although Data structure is also a concept in itself, sometimes concepts can be misinterpreted as DS. To make sure you don't get confuse b/w DS and concept, the concept will be marked as concept.
Below are the list of DS and Concepts we are going to cover in this Volume
Data Structures
Arrays
ArrayLists
Matrix / 2D Arrays and ArrayLists
LinkedLists
Stacks
Queues
Binary Tree
Binary Search Tree
Heap
HashMap
HashSet
Tries
Graphs
Strings
B Trees/ B+ Trees
Concepts
Bit Manipulation
Subarrays
Subsequence
Subset
Dynamic Programming
Sorting
Search
Hashing
Recursion
Backtracking
Pattern Matching