GitHub - NirmalSilwal/Data-Structure-and-Algorithm-Java-interview-kit: This repo has various data structures and algorithms implementations and problems around that for preparing the coding interviews. 🚀 👨‍💻💻 🚩

Day 1 Basic Programming Largest number, Loops demo, Function demo, Prime check, Simple interest, Sum of Natural numbers, Equal Remainder Day 2 Mathematics GCD of two number, Nth Fibonacci, Prime Checking, Reverse Number Day 3 Pattern printing square, left trianglular, right triangular, gunny, mirror, numeric triangular, numeric variation Day 4 Data types Binary to Decimal, Data Types, Decimal to Binary, Temperature conversion Day 5 Arrays Array Demo, Functions in Java, Maximum value in Array Day 6 Sorting & Searching Bubble sort, Insertion sort, Selection sort, Linear Search, Reverse Array, Maximum sum of subarray Day 7 Strings & Arrays ArrayList Demo, StringBuilder Demo, Strings Demo, String operations, 2D Array Demo, Spiral Print, Wave Print Day 8 Bit Manipulation Bit masking, Count N bits, Extract Nth bit, Power of two check, Right most set bit, Turn ON Bit, Two unique elements in Array, Two missing element Day 9 Famous Algos Maximum Subarray Sum, Kadane's Algo, Sieve of Eratosthenes, Sum of all sub-matrices, Merge Sorted Arrays Day 10 Recursion - I Factorial, Nth Fibonacci, Linear Search Recursive, Move all X at End recursively, Power of N, Print Decreasing, Print Increasing, Print Decreasing Increasing, Print with Skip, isSorted Array Day 11 Recursion - II Count Maze Path, String Permutations, Codes of String, Print Board Path, print Keypad Codes, Print Maze Path, Print String Subsequences Day 12 Recursion - III N Queen problem, Permutation with Swap, Print Lexicographical Order, Tower of Hanoi, Maze path with Hurdles Day 13 Backtracking Board Path with Ladders, Elephant total Paths, Suduko Solver, N Stairs Problem (ways to reach N stairs) Day 14 Searching & Sorting Binary Search, First Index of N, Last Index of N, Maximum Height Ladder, Search in 2D matrix, Quick Sort, Merge Sort Day 15 OOPS, Exception Handling Class, Objects, try catch demo, access specifier demo Day 15.1 OOPS, Stack Class demo, constructor demo, getter setter, Static variables, instance variables, Object array, Stack using Array Day 16 OOPS, Queue Access Specifier demo, Inheritance demo, Queue using Array, Absract demo, Polymorphism demo Day 17 Stack & Queues Dynamic Stack, Dynamic Queue, Queue using Stack enqueue efficient, Balance Paranthesis, Reverse Queue, Reverse Stack, Next Greater Element, Stack using Array, Queue using Array Day 18 LinkedList LinkedList implementation, Reverse LinkedList by reversing data iteratively, pointer recursively, list data by pointer Day 19 LinkedList, Stack, Queues Kth Node from Last Node, Count Distinct Rectangles, Detect cycle in LL, Revese LL, MergeSort to LL, Mid of LL Day 20 Binary Tree Binary Tree implementation, find element, height of BT, max data in BT, min data in BT, mirror BT, size of BT, Tree Traversals (preorder, inorder, postorder) Day 21 Binary Tree Diameter of tree, checks Balanced Tree, Left view, Right view, Root to Leaf traversal, Sum of Leaf nodes, Level order Traversals, Day 22 HashMap & Generics Hashmap demo, Generic concept demos Day 23 Heaps Heap implementation Day 24 Dynamic Programming Fibonacci problem iterative, recursive, DP approach Recursion Recursion Bubble Sort, N Factorial, First Index, Last Index, Nth Fibonacci, Power of N, Print skip Decreasing Increasing, check Sorted Array, print Increasing, print Decreasing, Sum of N terms