In this Algorithm Course we will cover some major type of DS and it's different implementation also some sorting and searching techniques
The Backtracking is an algorithmic-technique to solve a problem by an incremental way. It uses recursive approach to solve the problems. We can say that the backtracking is used to find all possible combination to solve an optimization problem.
| S. No. | Topic | Solution |
|---|---|---|
| 1. | Find the number of island | C++ |
| 2. | N-Queens | Java |
| 3. | BST - Tree Traversals | C++ |
The Bitwise Algorithms are used to perform operations at bit-level or to manipulate bits in different ways. The bitwise operations are found to be much faster and are some times used to improve the efficiency of a program.
| S. No. | Topic | Solution |
|---|---|---|
| 1. | Binary Palindrome | C++ |
| 2. | Consecutive Ones | C++ |
| 3. | Rotate Bits | C++ |
| 4. | Swap Bits | C++ |
| 5. | Swap Nibble | C++ |
Dynamic programming (usually referred to as DP ) is a very powerful technique to solve a particular class of problems. It demands very elegant formulation of the approach and simple thinking and the coding part is very easy. The idea is very simple, If you have solved a problem with the given input, then save the result for future reference, so as to avoid solving the same problem again.. shortly 'Remember your Past' :) .
| S. No. | Topic | Solution |
|---|---|---|
| 1. | Longest Common Subsequence | C++ |
| 2. | Sum of Subset | C++ |
| S. No. | Topic | Solution |
|---|---|---|
| 1. | Adjacency List Representation of a Graph | C++ |
| 2. | Adjacency Matrix Representation of a Graph | C++ |
| 3. | Dijkstra Algorithm | C++ |
| 4. | Kruskals Algorithm | C++ |
| 5. | Prims Algorithm | Java |
| S. No. | Topic | Solution |
|---|---|---|
| 1. | Character Frequency in a string | C++ |
| 2. | Chocolate problem(number of possible ways to distribute chocolate) | C++ |
| 3. | Dilemma(Count the repetative occurence) | C++ |
| 4. | Highest Rating | C++ |
| 5. | Maximum value in a Heap | C++ |
| 6. | Maximum value in a Heap | C++ |
| 7. | Power Up | C++ |
| S. No. | Topic | Solution |
|---|---|---|
| 1. | Galois Zigzag(Cheating Exam) | C++ |
| 2. | Concatenating Primes(How many primes numbers can be made by concatenating the first n prime numbers) | C++ |
| 3. | Number of Palindrome(Count number of palindromes can be made from a given number) | C++ |
| 4. | Shortest Number | C++ |
| 5. | Smallest Multiple in Permuted Digits | C++ |
A tree is recursively defined as a set of one or more nodes where one node is designated as the root of the tree and all the remaining nodes can be partitioned into non-empty sets each of which is a sub-tree of the root.
| S. No. | Topic | Solution |
|---|---|---|
| 1. | Implementation of binary search tree | C++ |
| 2. | Implementation of binary tree | C++ |
| 3. | BST - Tree Traversals | C++ |
| 4. | BST - Level Order Traversal | C++ |
| 5. | BST - Sum of elements | C++ |
| 6. | Binary Tree - Find Max | C++ |
| 7. | BST - Height | C++ |
| 8. | BST - Diameter | C++ |
| 9. | BST - Common ancestor | C++ |
| 10. | BST - Sum of leaf nodes | C++ |
| 11. | BST - kth smallest element | C++ |