- Basic Problems
- Pattern Problems
- Complexity
- Mathematics
- Bits-Manipulation
- Recursion
- Arrays
- Searching
- Sorting
- Matrix
- Hashing
- String
- OOPS-in-Java
- Linked List
- Stack
- Queue
- Deque
- Tree
- Binary Search Tree
- Heap
- Graph
- Greedy
- Backtracking
- Dynamic Programming
- Trie
- Segment-Trees
- Disjoint-Set
| S.No | Problem | Theory | Source Code |
|---|---|---|---|
| 1 | Pattern 1 | Article | Solution |
| 2 | Pattern 2 | Article | Solution |
| 3 | Pattern 3 | Article | Solution |
| 4 | Pattern 4 | Article | Solution |
| 5 | Pattern 5 | Article | Solution |
| 6 | Pattern 6 | Article | Solution |
| 7 | Pattern 7 | Article | Solution |
| 8 | Pattern 8 | Article | Solution |
| 9 | Pattern 9 | Article | Solution |
| 10 | Pattern 10 | Article | Solution |
| 11 | Pattern 11 | Article | Solution |
| 12 | Pattern 12 | Article | Solution |
| 13 | Pattern 13 | Article | Solution |
| 14 | Pattern 14 | Article | Solution |
| 15 | Pattern 15 | Article | Solution |
| 16 | Pattern 16 | Article | Solution |
| 17 | Pattern 17 | Article | Solution |
| 18 | Pattern 18 | Article | Solution |
| 19 | Pattern 19 | Article | Solution |
| 20 | Pattern 20 | Article | Solution |
| 21 | Pattern 21 | Article | Solution |
| 22 | Pattern 22 | Article | Solution |
| S.No | Problem | Theory | Source Code |
|---|---|---|---|
| 1 |
| S.No | Problem | Theory | Source Code |
|---|---|---|---|
| 1 | Print N to 1 without loop | Solution | Solution |
| 2 | Print 1 to n without using loops | Solution | Solution |
| 3 | Factorial | Solution | Solution |
| S.No | Problem | Theory | Source Code |
|---|---|---|---|
| 1 |
| S.No | Problem | Theory | Source Code |
|---|---|---|---|
| 1 |
| S.No | Problem | Theory | Source Code |
|---|---|---|---|
| 1 |
| S.No | Problem | Theory | Source Code |
|---|---|---|---|
| 1 |
| S.No | Problem | Theory | Source Code |
|---|---|---|---|
| 1 |
The Whole content management system is released under the under terms of the MIT License.