- Time Complexity
- Mathematics
- Bits Manipulation
- Recursion
- Arrays
- Searching
- Sorting
- Matrix
- Hashing
- String
- Linked List
- Stack
- Queue
- Tree
- Binary Search Tree
- Heap
- Graph
- Greedy
- Backtracking
- Dynamic Programming
- Trie
π© π§ π₯
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | Absolute value | Theory | π© Easy | abs() | |||
2 | Celsius To Fahrenheit | Theory | π© Easy | Math | |||
3 | Roots of Quadratic equation | Theory | π© Easy | Math | |||
4 | Factorial Of Number | π© Easy | Math | ||||
5 | Count digits in a factorial | π© Easy | Factorial, Math | ||||
6 | Series GP | π© Easy | Basic Math | ||||
7 | Prime Number | π© Easy | Basic Math | ||||
8 | Exactly 3 Divisors | Theory | π© Easy | Basic Math | |||
9 | Addition Under Modulo | Theory | π© Easy | Modulo | |||
10 | Multiplication Under Modulo | Theory | π© Easy | Modulo | |||
11 | Modular Multiplicative Inverse | π© Easy | Modulo | ||||
12 | Trailing zeroes in factorial | π§ Medium | Logic | ||||
13 | Prime Factors | π§ Medium | Prime |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | Find first set bit | π© Easy | Bits, Modulo | ||||
2 | Rightmost different bit | π© Easy | XOR, Modulo | ||||
3 | Check whether K-th bit is set or not | π© Easy | XOR, Modulo | ||||
4 | Count total set bits | π§ Medium | RIght shift | ||||
5 | Bit Difference | π© Easy | Bits | ||||
6 | Number is sparse or not | π© Easy | Bits | ||||
7 | Longest Consecutive 1's | π© Easy | Bits | ||||
8 | Gray Code | π© Easy | Xor, Right Shift | ||||
9 | Gray to Binary equivalent | π© Easy | Xor, Right Shift | ||||
10 | Power of 2 | π© Easy | AND | ||||
11 | Swap all odd and even bits | π© Easy | OR | ||||
12 | Maximum AND Value | π§ Medium | AND |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | Print 1 to n without using loops | π© Easy | Recursion | ||||
2 | Sum Of Digits | π© Easy | Recursion | ||||
3 | Nth Fibonacci Number | π© Easy | Recursion | ||||
4 | Digital Root | π§ Medium | Recursion | ||||
5 | Fibonacci Using Recursion | π© Easy | Recursion | ||||
6 | Tower Of Hanoi | π§ Medium | Recursion | ||||
7 | Josephus problem | π§ Medium | Recursion |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | What is Multidimensional Arrays c++ | Video | π© Easy | Matrix, Array | |||
2 | Sum of upper and lower triangles | Solution | π© Easy | Matrix, Array | |||
3 | Transpose of Matrix | Solution | π© Easy | Matrix, Array | |||
4 | Rotate by 90 degree | Solution | π© Easy | Matrix, Array | |||
5 | Multiply the matrices | c++ | Solution | π© Easy | Matrix, Array | ||
6 | Spirally traversing a matrix | c++ | Solution | π§ Medium | Matrix, Array | ||
7 | Interchanging the rows of a Matrix | c++ | Solution | π© Easy | Matrix, Array | ||
8 | Matrix Interchange | Practice | π© Easy | Matrix, Array | |||
9 | Search in a row-column sorted Matrix | c++ | Solution | π§ Medium | Matrix, Array | ||
10 | Boolean Matrix | c++ | Solution | π§ Medium | Matrix, Array |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | What is Hashing Data structure | Theory | π© Easy | Hashing | |||
2 | Code of Hashing in c++ | c++ | Solution | π© Easy | Hashing | ||
3 | Direct Access Table | Theory | π© Easy | Hash | |||
4 | What is Hash Function and collision | Theory | π© Easy | Hash | |||
5 | What is chaining in collision handling | Theory | π© Easy | Hashing | |||
6 | What is unordered_set | c++ | Theory | π© Easy | Hash | ||
7 | What is unordered_map | c++ | GFG | Theory | π© Easy | Hash | |
8 | Non Repeating Element | c++ | Solution | π© Easy | Hashing | ||
9 | First Repeating Element | c++ | Solution | π© Easy | Hashing | ||
10 | Union of two arrays | Practice | π© Easy | Hashing | |||
11 | Intersection of Two Arrays | c++ | Solution | π© Easy | unordered_set | ||
12 | Key Pair | c++ | Solution | π© Easy | unordered_map | ||
13 | Subarray with sum 0 | c++ | Solution | π§ Medium | unordered_set | ||
14 | Winner of an election | c++ | Solution | π© Easy | unordered_map | ||
15 | Pairs with Positive Negative values | c++ | Solution | π© Easy | map, Vector | ||
16 | Print Anagrams Together / Group Anagrams | c++ | Solution | π§ Medium | unordered_map, string | ||
17 | Relative Sort Array / Sort an array according to the other | c++ | Solution | π§ Medium | Map | ||
18 | Custom Sort String | c++ | Solution | π§ Medium | map | ||
19 | Sort Array by Increasing Frequency | c++ | Solution | π© Easy | map, Lambda | ||
20 | Longest Consecutive Sequence | Practice | π§ Medium | map |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | Introduction to Linked list Playlist c++ | Theory | π© Easy | Linked List | |||
2 | Data structures Competitive Programming | Theory | π© Easy | DSA | |||
3 | Arrays in Data Structures | Theory | π© Easy | Arrays | |||
4 | Pointers in C++ with code Practice | Theory | π© Easy | Pointers | |||
5 | Struct in c++ | Theory | π© Easy | Struct |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | What is stack | GFG Link | Solution | π© Easy | Stack, Array | ||
2 | Implement stack using array | π© Easy | Stack, Array | ||||
3 | Implement Stack using Linked List | π© Easy | Stack, Linked List | ||||
4 | Implement Stack using Linked List | π© Easy | Stack, Linked List | ||||
5 | Remove All Adjacent Duplicates In String | π© Easy | Stack, string | ||||
6 | Remove All Adjacent Duplicates in String II | π§ Medium | Stack, string | ||||
7 | Valid Parentheses | π© Easy | Stack, string | ||||
8 | Implement two stacks in an array | π© Easy | Stack, Array | ||||
9 | Valid Parentheses | π© Easy | Stack, string | ||||
10 | Get min at pop | π© Easy | Stack, Array | ||||
11 | Min Stack | π© Easy | Stack, Array | ||||
12 | Delete middle element of a stack | π© Easy | Stack, STL | ||||
13 | Infix to Postfix | π© Easy | Stack | ||||
14 | Evaluate Reverse Polish Notation | π§ Medium | Stack, Evaluation of Postfix Expression | ||||
15 | Online Stock Span | π§ Medium | Stack, Stock span problem | ||||
16 | Next Greater Element II | π§ Medium | Stack, Array | ||||
17 | Largest Rectangle in Histogram | π₯ Hard | Stack, Array | ||||
18 | The Celebrity Problem | π§ Medium | Stack, Array |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | What is Queue | GFG Link | Solution | π© Easy | Queue, STL | ||
2 | Implement Queue using array | π© Easy | Queue, Array | ||||
3 | Implement Queue using Linked List | Scaler Topics Link | π© Easy | Queue, Linked List | |||
4 | Queue Reversal | π© Easy | Queue, Stack | ||||
5 | Queue using two Stacks | π© Easy | Queue, Stack | ||||
6 | Implement Queue using Stacks | π© Easy | Stack, Queue | ||||
7 | Stack using two queues | π© Easy | Stack, Queue | ||||
8 | Generate Binary Numbers | π© Easy | Queue | ||||
9 | Reverse First K elements of Queue | π© Easy | Queue, Stack | ||||
10 | Circular tour | π§ Medium | Queue, Sliding window |
Status | # | Question | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | What is Tree | Solution1, solution2 | π© Easy | Tree, Theory | |||
2 | What is Binary tree | solution | π© Easy | Tree, Binary Tree | |||
3 | How to code binary tree | c++ | Solution | π© Easy | Tree, Code | ||
4 | Properties of Binary tree | solution | π© Easy | Tree, Node | |||
5 | Types of Binary tree | solution | π© Easy | Binary Tree | |||
6 | Tree Traversal | solution1, solution2 | π© Easy | Traversal, Inorder | |||
7 | Code of Inorder Traversal | c++ | solution | π© Easy | Inorder Traversal | ||
8 | Code of Preorder and Postorder | c++ | Solution | π© Easy | Preorder, Postorder | ||
9 | Binary Tree Inorder Traversal | c++ | Solution | π© Easy | Recursion, Tree | ||
10 | Binary Tree Preorder Traversal | Practice | π© Easy | Recursion, Tree | |||
11 | Binary Tree Postorder Traversal | Practice | π© Easy | Recursion, Tree | |||
12 | Same Tree | c++ | Solution | π© Easy | Tree Traversal | ||
13 | Maximum Depth of Binary Tree | c++ | Solution | π§ Medium | Recursion, Tree | ||
14 | Children Sum Parent | c++ | Solution | π© Easy | Recursion, Tree | ||
15 | Binary Tree Level Order Traversal | c++ | Solution | π§ Medium | Queue, Tree | ||
16 | Level order traversal Line by Line | Practice | π© Easy | stack, Tree | |||
17 | Binary Tree Zigzag Level Order Traversal | c++ | Solution | π§ Medium | Queue, Tree | ||
18 | Maximum Width of Tree | π© Easy | Tree | ||||
19 | Balanced Binary Tree | c++ | Solution | π© Easy | Tree | ||
20 | Left View of Binary Tree | π© Easy | Tree | ||||
21 | Right View of Binary Tree | π© Easy | Tree | ||||
22 | Lowest Common Ancestor in a Binary Tree | π§ Medium | Tree | ||||
23 | Diameter of Binary Tree | π© Easy | Tree | ||||
24 | Vertical Width of a Binary Tree | π© Easy | Tree | ||||
25 | Mirror Tree | π© Easy | Tree | ||||
26 | Check if subtree | π§ Medium | Tree | ||||
27 | Make Binary Tree From Linked List | π§ Medium | Tree |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | Inorder traversal of a BST | π© Easy | BST, Tree | ||||
2 | Search in a Binary Search Tree | π© Easy | BST, Tree | ||||
2 | Insert in a Binary Search Tree | BST, Tree |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | Heap sort | Solution | π© Easy | Heap Basic | |||
2 | Kth Largest Element in an Array | Solution | π© Easy | Heap Basic | |||
3 | Kth Largest Element in a Stream | Solution | π© Easy | Heap Basic | |||
4 | Top K Frequent Elements | Solution | π© Easy | Heap Basic | |||
5 | Minimum Cost of ropes | Solution | π© Easy | Heap Basic | |||
6 | Find K Closest Elements | Solution | π§ Medium | Heap Medium | |||
7 | Merge k Sorted Arrays | Solution | π§ Medium | Heap Medium | |||
8 | Find median in a stream | Solution | π₯ Hard | Heap Hard |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | Graph Introduction | Solution | π© Easy | Graph Theory | |||
2 | Adjacency Matrix in graph | Solution | π© Easy | Graph Basic | |||
3 | Adjacency List in graph | Solution | π© Easy | Graph | |||
4 | How to code graph | Solution | π© Easy | Graph | |||
5 | BFS Of Graph | Solution | π© Easy | Graph Theory | |||
6 | Find If Path Exists in Graph | C++ | Solution | π© Easy | Graph BFS | ||
7 | Find the Town Judge | C++ | Solution | π© Easy | Graph BFS | ||
8 | DFS Of Graph | Solution | π© Easy | Graph Theory | |||
9 | Number of Islands | C++ | Solution | π§ Medium | Graph DFS | ||
10 | Flood Fill | C++ | Solution | π© Easy | Graph Theory | ||
11 | Detect cycle in undirected graph | Solution | π© Easy | Graph | |||
12 | Topological sort (Kahn's BFS) | C++ | Solution | π© Easy | Graph | ||
13 | Topological sort using DFS | C++ | Solution | π§ Medium | Graph DFS | ||
14 | Detect Cycle in a Directed Graph | C++ | Solution | π§ Medium | Graph GFG |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | Fibonacci Numbers - Top Down DP | π© Easy | Recursion |
Status | # | Title | Code | Document | Video | Difficulty | Tag |
---|---|---|---|---|---|---|---|
1 | Insert and Search | π§ Medium | Trie |