└── README.md


/README.md:
--------------------------------------------------------------------------------
 1 | # Important-DSA-Topic-Problems
 2 | 
 3 | # Greedy
 4 | 
 5 | * Make a program for greedy knapsack problem
 6 | * Make a program to implement huffman encoding
 7 | * Make a program to sequence given jobs with deadlines to maximize profits
 8 | * Program for PRIMS algorithm without min heap
 9 | * Program for KRUSKALS algorithm
10 | * Program for DIJKSTRA algorithm
11 | * Program to implement a simple graph
12 | * Consider n-ropes with different length. Find algo to tie up all the rope into a single rope with min cost
13 | * Find max intervals from given intervals such that none of them are overlapping
14 | * Number of railway platforms
15 | * Rearrange the string such that same characters are d distance away
16 | 
17 | # Divide and Conquer
18 | 
19 | * Find a majority element using linear search that occurs more than n/2 times
20 | * Nuts and bolts problem
21 | * Write a custom C function to implement a pow function
22 | * Select an element in sorted rotated array
23 | * Count inversions in an array
24 | * Find the missing number in arithmetic progression
25 | * Given an array containing I's and O's in which all O's appear before all l's, count the number of l's in the array
26 | * Given an array with 2n integer in the formal al,a2,a3...bl,b2,b3.. Shuffle the array to albl a2b2 a3b3...
27 | * Given a sorted array of non repeated integers a[l--n].
28 | Check whether there is an index i for which afi]=i
29 | * Search an element in row wise and column wise sorted 2d array
30 | 
31 | 
32 | # Dynamic Programming
33 | 
34 | * Algorithm to find optimized soln for matrix chain multiplication
35 | * Compute Longest common subsequence between two strings
36 | * Multistage graph dynamic programming algorithm
37 | * 0/1 Knapsack dynamic programming algorithm
38 | * Find a subset in an array whose sum is w
39 | * Travelling salesman problem
40 | * All pair shortest path algorithm
41 | * Find the maximum sum sub array
42 | * Find the max sum increasing sub sequence
43 | * Find the longest subsequence in an array such that elements are consecutive
44 | * Given a binary matrix, find the largest square sub matrix with all l's
45 | * Find kth ugly number
46 | 
47 | # Pattern Matching
48 | 
49 | * Given a text and a pattern, find all occurences of a pattern in a given text.
50 | * Implement KMP algorithm to find all occurences of a pattern in a given text
51 | * Boyer-Moore algorithm for string finding patterns
52 | * Rabin-Karp for string finding patterns
53 | 
54 | 
55 | # Back Tracking
56 | 
57 | * Generate all permutations of a given string
58 | * Program to generate all strings of n bits
59 | * N-queens problem
60 | 
61 | 
62 |   
63 | 


--------------------------------------------------------------------------------