This repository focuses on interview baseed algorithmic practices for Data Structures using Python, C++, Java and TypeScript.
- Array + Backtracking
- Array + BFS
- Array + Binary_Index_Tree
- Array + Binary_Search
- Array + Bit_Manipulation
- Array + DFS
- Array + Dynamic_Programming
- Array + Greedy
- Array + Hash_Table
- Array + Math
- Array + Prefix_Sum
- Array + Queue
- Array + Simple
- Array + Sliding_Window
- Array + Sorting
- Array + Specific_Algorithms
- Array + Stack
- Array + Two_Pointers
- Strings + Backtracking
- Strings + BFS
- Strings + Bit_Manipulation
- Strings + DFS
- Strings + Dynamic_Programming
- Strings + Greedy
- Strings + Hash_Table
- Strings + Math
- Strings + Queue
- Strings + Recursion
- Strings + Simple
- Strings + Sliding_Window
- Strings + Sorting
- Strings + Stack
- Strings + Trie
- Strings + Two_Pointers
- Linked_List + Hash_Table
- Linked_List + Math
- Linked_List + Queue
- Linked_List + Recursion
- Linked_List + Simple
- Linked_List + Sorting
- Linked_List + Two_Pointers
- BST + DFS
- BST + Dynamic_Programming
- BST + Queue
- BST + Stack
- BST + Tree_Property
- Binary_Tree + BFS
- Binary_Tree + DFS
- Binary_Tree + DnC
- Binary_Tree + Dynamic_Programming
- Binary_Tree + Traversal
- Binary_Tree + Trie
- Graphs + BFS
- Graphs + DFS
- Graphs + Queue
- Graphs + Specific_Algorithms
- Graphs + Topological_Sort
- Graphs + Two_Pointer
- Graphs + Union_Find
- Matrix + Array
- Matrix + BFS
- Matrix + Binary_Search
- Matrix + DFS
- Matrix + Dynamic_Programming
- Matrix + Hash_Table
- Matrix + Prefix_Sum
- Matrix + Queue
- Matrix + Simulation
- Matrix + Two_Pointers
- Queue_Stack + DFS
- Queue_Stack + Hash_Table
- Queue_Stack + Simple
- Math + Array
- Math + Backtracking
- Math + Binary_Search
- Math + Bit_Manipulation
- Math + Dynamic_Programming
- Math + Greedy
- Math + Puzzle
- Math + Queue
- Math + Recursion
- Math + Simple
- Math + Sliding_Window
- Math + Stack
- Math + String
- Math + Two_Pointers