I am targeting to practice 5 Questions/day for the 20 days from geeksforgeeks website. So, I will get a total of 100 Questions at end of this.
1> Union of two arrays [Array 1] [Point 1]
2> Sort an array of 0s, 1s and 2s [Array 2] [Points 2]
3> Chocolate Distribution Problem [Array 3] [Points 2]
4> Common elements [Array 4] [Points 2]
5> Kth Smallest Element [Array 5] [Points 4]
1> Kadane's Algorithm [Array 6] [Points 4]
2> Longest consecutive subsequence [Array 7] [Points 4]
3> Max Circular Subarray Sum [Array 8] [Points 8]
4> Rotate Matrix by 90 degree [Matrix 1] [Point 1]
5> Spiral Traversal on Matrix [Matrix 2] [Points 2]
1> Median in row-wise Sorted Matrix [Matrix 3] [Points 4]
2> Maximum size rectangle [Matrix 4] [Points 4]
3> Kth Element in Matrix [Matrix 5] [Points 4]
4> All Permuatations of given String [String 1] [Point 1]
5> Longest Repeating Subsequence [String 2] [Points 2]
1> Longest Palindorme in a String [String 3] [Points 4]
2> Find the string in grid [String 4] [Points 2]
3> Isomorphic Strings [String 5] [Points 2]
4> Parenthesis Checker [String 6] [Points 4]
5> Word Wrap problem [String 7] [Points 4]
1> Word break problem [String 8] [Points 4]
2> First and last occurrences of X [Searching & Sorting 1] [Point 1]
3> Count Squares [Searching & Sorting 2] [Point 1]
4> Majority Element [Searching & Sorting 3] [Point 1]
5> Product Array puzzle [Searching & Sorting 4] [Points 2]
1> K-th element of two sorted arrays [Searching & Sorting 5] [Points 2]
2> Inversion of array [Searching & Sorting 6] [Points 2]
3> Sort by Set Bit Count [Searching & Sorting 7] [Points 2]
1> Merge without Extra Space [Searching & Sorting 8] [Points 8]
2> Find the Duplicates in array [Searching & Sorting 9] [Points 2]
3> Maximum Intervals Overlap [Searching & Sorting 10] [Points 4]
4> Linked List Matrix [Linked List 1] [Points 2]
5> Linked List in Zig Zag way [Linked List 2] [Points 2]
6> Reverse a Linked List [Linked List 3] [Points 2]
7> Delete Middle of Linked List [Linked List 4] [Points 2]
1> Intersection Point in Y Shapped Linked Lists [Linked List 5] [Points 4]
2> Reverse a Linked List in groups of given size [Linked List 6] [Points 4]
3> Remove loop in Linked List [Linked List 7] [Points 4]
4> QuickSort on Doubly Linked List [Linked List 8] [Points 8]
5> Implement stack using array [Stack 1] [Point 1]
1> Special Stack [Stack 2] [Points 2]
2> Evaluation of Postfix Expression [Stack3] [Points 2]
3> Parenthsis Checker [Stack 4] [Points 4]
4> Longest valid Parentheses [Stack 5] [Points 8]
5> Implement Queue using array [Queue 1] [Point 1]
1> Reverse First K elements of Queue [Queue 2] [Points 2]
2> Queue using two Stacks [Queue 3] [Points 2]
3> Minimum Cost of ropes [Queue 4] [Points 4]
4> Circular tour [Queue 5] [Points 4]
5> Height of Binary Tree [Tree 1] [Point 1]
1> Mirror Tree [Tree 2] [Points 2]
2> Diameter of Binary Tree [Tree 3] [Points 2]
3> Min distance between two given nodes of a Binary Tree [Tree 4] [Points 4]
4> Tree from Postorder and Inorder [Tree 5] [Points 4]
5> Maximum Path Sum between 2 Leaf Nodes [Tree 6] [Points 8]
1> Minimum element in BST [Binary Search Tree 1] [Point 1]
2> Search a node in BST [Binary Search Tree 2] [Point 1]
3> Lowest Common Ancestor in a BST [Binary Search Tree 3] [Points 2]
4> Kth largest element in BST [Binary Search Tree 4] [Points 2]
5> Check for BST [Binary Search Tree 5] [Points 4]
1> Delete a node from BST [Binary Search Tree 6] [Points 4]
2> Largest BST [Binary Search Tree 7] [Points 4]
3> Fixing Two nodes of a BST [Binary Search Tree 8] [Points 8]
4> k largest elements [Heap 1] [Point 1]
5> Binary Heap Operations [Heap 2] [Points 2]
1> Merge K sorted linked lists [Heap 3] [Points 4]
2> Find median in a stream [Heap 4] [Points 8]
3> Sum of dependencies in a graph [Graph 1] [Point 1]
4> Shortest path from 1 to n [Graph 2] [Point 1]
5> BFS of graph [Graph 3] [Points 2]
1> DFS of graph [Graph 4] [Points 2]
2> Detect cycle in a directed graph [Graph 5] [Points 4]
3> Find the number of islands [Graph 6] [Points 4]
4> Alien Dictionary [Graph 7] [Points 8]
5> Find the maximum flow [Graph 8] [Points 8]
1> Minimize the sum of product [Greedy 1] [Point 1]
2> Activity Selection [Greedy 2] [Points 2]
3> Fractional Knapsack [Greedy 3] [Points 2]
4> Max length chain [Greedy 4] [Points 4]
5> Implementing Dijkstra [Greedy 5] [Points 4]
1> Number of Paths [Recursion & Backtracking 1] [Point 1]
2> Permutation with Spaces [Recursion & Backtracking 2] [Points 2]
3> Flood Fill Algorithm [Recursion & Backtyracking 3] [Points 2]
4> Number of paths in a matrix with k coins [Recursion & Backtracking 4] [Points 4]
5> Combination Sum [Recursion & Backtracking 5] [Points 4]
1> N-Queen Problem [Recursion & Backtracking 6] [Points 8]
2> Count Numbers Contaning 4 [Dynamic Programming 1] [Point 1]
3> Print First n Fibbonacci numbers [Dynamic Programming 2] [Point 1]
4> Rod Cutting problem [Dynamic Programmming 3] [Points 2]
5> Count all possible paths from top left to bottom right [Dynamic Programming 4] [Points 2]
1> Total Decoding Messages [Dynamic Programming 5] [Points 4]
2> Longest Common Substring [Dynamic Programming 6] [Points 4]
3> Interleaved Strings [Dynamic Programming 7] [Points 4]
4> Wildcard Pattern Matching [Dynamic Programming 8] [Points 4]
5> Boolean Parenthesization [Dynamic Programming 9] [Points 8]
1> Distinct Palindromic Substrings [Dynamic Programming 10] [Points 8]
2> Count total set bits [Bit Magic 1] [Points 4]
3> Maximum subset XOR [Bit Magic 2] [Points 4]
4> Factorials of large numbers [Mathematics 1] [Points 4]
5> Container With Most Water [Combintorics 1] [Points 4]