├── Assignment: Recursion 1a:Sum of digits (recursive) ├── BST and Binary Tree Assignment::Pair sum in a BST ├── BST and Binary Tree Assignment::Print nodes at distance k from node ├── BST and Binary Tree Assignment:Largest BST ├── BST and Binary Tree Assignment:replace with Sum of greater nodes ├── Binary Search Trees: Print Elements in Range ├── Binary Search Trees:BST Class ├── Binary Search Trees:BST to Sorted LL ├── Binary Search Trees:Check if a Binary Tree is BST ├── Binary Search Trees:Construct BST From Sorted Array ├── Binary Search Trees:Create & Insert Duplicate Node ├── Binary Search Trees:Find Path in BST ├── Binary Search Trees:LCA of BST ├── Binary Search Trees:LCA of Binary Tree ├── Binary Search Trees:Pair sum BInary Tree ├── Binary Search Trees:Path Sum Root to Leaf ├── Binary Search Trees:Search Node in BST ├── ComplexNumbers ├── DP - 1:Min Steps to One using DP ├── DP - 1:Minimum Count of Squares ├── DP - 1:Number of Balanced BTs ├── DP - 1:Number of Balanced BTs Using DP ├── DP - 1:Staircase ├── DP - 2:0 1 Knapsack ├── DP - 2:Edit Distance(Memoization and DP) ├── DP - 2:Knapsack(Memoization and DP) ├── DP - 2:Loot Houses ├── DP - 2:Maximum Square Matrix With All Zeros ├── DP-2: Edit Distance ├── DP-2:Coin Tower ├── DP-2:Longest Increasing Subsequence ├── DP-2:Matrix Chain Multiplication ├── DP-2:Maximum Square Matrix With All Zeros ├── DP1:Min Steps to One ├── DynamicArray ├── Fraction class ├── FractionUse class ├── Graphs-2: Kruskal's Algorithm ├── Graphs-2:Dijkstra's Algorithm ├── Graphs-2:Prim's Algo ├── Graphs: Has Path ├── Graphs:All connected components ├── Graphs:BFS Traversal ├── Graphs:Get Path - BFS ├── Graphs:Get Path - DFS ├── Graphs:Is Connected ? ├── Hashmaps::Extract Unique characters ├── Hashmaps:Longest consecutive Sequence ├── Hashmaps:Longest subset zero sum ├── Hashmaps:Maximum Frequency Number ├── Hashmaps:Pair Sum to 0 ├── Hashmaps:Pairs with difference K ├── Hashmaps:Print Intersection ├── Linked List 1:AppendLastNToFirst ├── Linked List 1:Delete Node in LL ├── Linked List 1:Eliminate duplicates from LL ├── Linked List 1:Find a node in LL ├── Linked List 1:Length of LL ├── Linked List 1:Palindrome LinkedList ├── Linked List 1:Print ith Node ├── Linked List 1:Print reverse LinkedList ├── Linked List 2:Bubble Sort (Iterative) LinkedList ├── Linked List 2:Delete every N nodes ├── Linked List 2:Delete node (recursive) ├── Linked List 2:Even after Odd LinkedList ├── Linked List 2:Find a node in LL (recursive) ├── Linked List 2:Merge Sort ├── Linked List 2:Merge two sorted LL ├── Linked List 2:Midpoint of Linked list ├── Linked List 2:Reverse LL (Iterative) ├── Linked List 2:Reverse LL (Recursive) ├── Linked List 2:Swap two Node of LL ├── Linked List 2:kReverse ├── OOPS-4:Othello Move Function ├── Polynomial class ├── Priority Queues:Buy the ticket ├── Priority Queues:Check Max-Heap ├── Priority Queues:In-place heap sort ├── Priority Queues:K largest elements ├── Priority Queues:Kth largest element ├── Priority Queues:Max Priority Queue ├── Priority Queues:Merge K sorted arrays ├── Priority Queues:Remove Min ├── Priority Queues:Running median ├── README.md ├── Recursion 1:All Indices of Number ├── Recursion 1:Calculate Power ├── Recursion 1:Check Number in Array ├── Recursion 1:First Index of Number ├── Recursion 1:Last Index of Number ├── Recursion 1:Print Numbers ├── Recursion 1:Recursion 1 ├── Recursion 1:Sum of Array ├── Recursion 1a:Check Palindrome (recursive) ├── Recursion 1a:Count Zeros ├── Recursion 1a:Geometric Sum ├── Recursion 1a:Multiplication (Recursive) ├── Recursion 1b:Pair star ├── Recursion 1b:Remove X ├── Recursion 1b:Replace pi (recursive) ├── Recursion 1b:String to Integer ├── Recursion 1b:Tower of Hanoi ├── Recursion 2: Return subset of an array ├── Recursion 2:Binary Search (Recursive) ├── Recursion 2:Check AB ├── Recursion 2:Merge Sort Code ├── Recursion 2:Print Keypad Combinations Code ├── Recursion 2:Print Permutations - String ├── Recursion 2:Print Subset Sum to K ├── Recursion 2:Print Subsets of Array ├── Recursion 2:Print all Codes - String ├── Recursion 2:Quick Sort Code ├── Recursion 2:Remove Duplicates Recursively ├── Recursion 2:Replace Character Recursively ├── Recursion 2:Return Keypad Code ├── Recursion 2:Return Permutations - String ├── Recursion 2:Return all codes - String ├── Recursion 2:Return subsets sum to K ├── Recursion 2:Staircase ├── Stacks and Queues:Minimum bracket Reversal ├── Test 1:Does s contain t ? ├── Test 1:Split Array ├── Time and Space Complexity Analysis:Check array rotation ├── Time and Space Complexity Analysis:Duplicate in array ├── Time and Space Complexity Analysis:Find the Unique Element ├── Time and Space Complexity Analysis:Pair sum in array ├── Time and Space Complexity Analysis:Print Array intersection ├── Time and Space Complexity Analysis:Rotate array ├── Time and Space Complexity Analysis:Triplet Sum ├── Tries and Huffman Coding:Auto complete ├── Tries and Huffman Coding:Count Words in Trie ├── Tries and Huffman Coding:Palindrome Pair ├── Tries and Huffman Coding:Pattern Matching └── Tries and Huffman Coding:Search word in Trie /Assignment: Recursion 1a:Sum of digits (recursive): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Assignment: Recursion 1a:Sum of digits (recursive) -------------------------------------------------------------------------------- /BST and Binary Tree Assignment::Pair sum in a BST: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/BST and Binary Tree Assignment::Pair sum in a BST -------------------------------------------------------------------------------- /BST and Binary Tree Assignment::Print nodes at distance k from node: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/BST and Binary Tree Assignment::Print nodes at distance k from node -------------------------------------------------------------------------------- /BST and Binary Tree Assignment:Largest BST: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/BST and Binary Tree Assignment:Largest BST -------------------------------------------------------------------------------- /BST and Binary Tree Assignment:replace with Sum of greater nodes: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/BST and Binary Tree Assignment:replace with Sum of greater nodes -------------------------------------------------------------------------------- /Binary Search Trees: Print Elements in Range: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees: Print Elements in Range -------------------------------------------------------------------------------- /Binary Search Trees:BST Class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees:BST Class -------------------------------------------------------------------------------- /Binary Search Trees:BST to Sorted LL: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees:BST to Sorted LL -------------------------------------------------------------------------------- /Binary Search Trees:Check if a Binary Tree is BST: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees:Check if a Binary Tree is BST -------------------------------------------------------------------------------- /Binary Search Trees:Construct BST From Sorted Array: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees:Construct BST From Sorted Array -------------------------------------------------------------------------------- /Binary Search Trees:Create & Insert Duplicate Node: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees:Create & Insert Duplicate Node -------------------------------------------------------------------------------- /Binary Search Trees:Find Path in BST: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees:Find Path in BST -------------------------------------------------------------------------------- /Binary Search Trees:LCA of BST: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees:LCA of BST -------------------------------------------------------------------------------- /Binary Search Trees:LCA of Binary Tree: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees:LCA of Binary Tree -------------------------------------------------------------------------------- /Binary Search Trees:Pair sum BInary Tree: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees:Pair sum BInary Tree -------------------------------------------------------------------------------- /Binary Search Trees:Path Sum Root to Leaf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees:Path Sum Root to Leaf -------------------------------------------------------------------------------- /Binary Search Trees:Search Node in BST: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Binary Search Trees:Search Node in BST -------------------------------------------------------------------------------- /ComplexNumbers: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/ComplexNumbers -------------------------------------------------------------------------------- /DP - 1:Min Steps to One using DP: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP - 1:Min Steps to One using DP -------------------------------------------------------------------------------- /DP - 1:Minimum Count of Squares: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP - 1:Minimum Count of Squares -------------------------------------------------------------------------------- /DP - 1:Number of Balanced BTs: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP - 1:Number of Balanced BTs -------------------------------------------------------------------------------- /DP - 1:Number of Balanced BTs Using DP: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP - 1:Number of Balanced BTs Using DP -------------------------------------------------------------------------------- /DP - 1:Staircase: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP - 1:Staircase -------------------------------------------------------------------------------- /DP - 2:0 1 Knapsack: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP - 2:0 1 Knapsack -------------------------------------------------------------------------------- /DP - 2:Edit Distance(Memoization and DP): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP - 2:Edit Distance(Memoization and DP) -------------------------------------------------------------------------------- /DP - 2:Knapsack(Memoization and DP): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP - 2:Knapsack(Memoization and DP) -------------------------------------------------------------------------------- /DP - 2:Loot Houses: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP - 2:Loot Houses -------------------------------------------------------------------------------- /DP - 2:Maximum Square Matrix With All Zeros: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP - 2:Maximum Square Matrix With All Zeros -------------------------------------------------------------------------------- /DP-2: Edit Distance: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP-2: Edit Distance -------------------------------------------------------------------------------- /DP-2:Coin Tower: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP-2:Coin Tower -------------------------------------------------------------------------------- /DP-2:Longest Increasing Subsequence: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP-2:Longest Increasing Subsequence -------------------------------------------------------------------------------- /DP-2:Matrix Chain Multiplication: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP-2:Matrix Chain Multiplication -------------------------------------------------------------------------------- /DP-2:Maximum Square Matrix With All Zeros: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP-2:Maximum Square Matrix With All Zeros -------------------------------------------------------------------------------- /DP1:Min Steps to One: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DP1:Min Steps to One -------------------------------------------------------------------------------- /DynamicArray: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/DynamicArray -------------------------------------------------------------------------------- /Fraction class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Fraction class -------------------------------------------------------------------------------- /FractionUse class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/FractionUse class -------------------------------------------------------------------------------- /Graphs-2: Kruskal's Algorithm: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Graphs-2: Kruskal's Algorithm -------------------------------------------------------------------------------- /Graphs-2:Dijkstra's Algorithm: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Graphs-2:Dijkstra's Algorithm -------------------------------------------------------------------------------- /Graphs-2:Prim's Algo: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Graphs-2:Prim's Algo -------------------------------------------------------------------------------- /Graphs: Has Path: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Graphs: Has Path -------------------------------------------------------------------------------- /Graphs:All connected components: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Graphs:All connected components -------------------------------------------------------------------------------- /Graphs:BFS Traversal: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Graphs:BFS Traversal -------------------------------------------------------------------------------- /Graphs:Get Path - BFS: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Graphs:Get Path - BFS -------------------------------------------------------------------------------- /Graphs:Get Path - DFS: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Graphs:Get Path - DFS -------------------------------------------------------------------------------- /Graphs:Is Connected ?: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Graphs:Is Connected ? -------------------------------------------------------------------------------- /Hashmaps::Extract Unique characters: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Hashmaps::Extract Unique characters -------------------------------------------------------------------------------- /Hashmaps:Longest consecutive Sequence: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Hashmaps:Longest consecutive Sequence -------------------------------------------------------------------------------- /Hashmaps:Longest subset zero sum: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Hashmaps:Longest subset zero sum -------------------------------------------------------------------------------- /Hashmaps:Maximum Frequency Number: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Hashmaps:Maximum Frequency Number -------------------------------------------------------------------------------- /Hashmaps:Pair Sum to 0: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Hashmaps:Pair Sum to 0 -------------------------------------------------------------------------------- /Hashmaps:Pairs with difference K: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Hashmaps:Pairs with difference K -------------------------------------------------------------------------------- /Hashmaps:Print Intersection: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Hashmaps:Print Intersection -------------------------------------------------------------------------------- /Linked List 1:AppendLastNToFirst: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 1:AppendLastNToFirst -------------------------------------------------------------------------------- /Linked List 1:Delete Node in LL: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 1:Delete Node in LL -------------------------------------------------------------------------------- /Linked List 1:Eliminate duplicates from LL: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 1:Eliminate duplicates from LL -------------------------------------------------------------------------------- /Linked List 1:Find a node in LL: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 1:Find a node in LL -------------------------------------------------------------------------------- /Linked List 1:Length of LL: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 1:Length of LL -------------------------------------------------------------------------------- /Linked List 1:Palindrome LinkedList: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 1:Palindrome LinkedList -------------------------------------------------------------------------------- /Linked List 1:Print ith Node: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 1:Print ith Node -------------------------------------------------------------------------------- /Linked List 1:Print reverse LinkedList: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 1:Print reverse LinkedList -------------------------------------------------------------------------------- /Linked List 2:Bubble Sort (Iterative) LinkedList: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:Bubble Sort (Iterative) LinkedList -------------------------------------------------------------------------------- /Linked List 2:Delete every N nodes: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:Delete every N nodes -------------------------------------------------------------------------------- /Linked List 2:Delete node (recursive): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:Delete node (recursive) -------------------------------------------------------------------------------- /Linked List 2:Even after Odd LinkedList: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:Even after Odd LinkedList -------------------------------------------------------------------------------- /Linked List 2:Find a node in LL (recursive): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:Find a node in LL (recursive) -------------------------------------------------------------------------------- /Linked List 2:Merge Sort: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:Merge Sort -------------------------------------------------------------------------------- /Linked List 2:Merge two sorted LL: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:Merge two sorted LL -------------------------------------------------------------------------------- /Linked List 2:Midpoint of Linked list: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:Midpoint of Linked list -------------------------------------------------------------------------------- /Linked List 2:Reverse LL (Iterative): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:Reverse LL (Iterative) -------------------------------------------------------------------------------- /Linked List 2:Reverse LL (Recursive): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:Reverse LL (Recursive) -------------------------------------------------------------------------------- /Linked List 2:Swap two Node of LL: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:Swap two Node of LL -------------------------------------------------------------------------------- /Linked List 2:kReverse: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Linked List 2:kReverse -------------------------------------------------------------------------------- /OOPS-4:Othello Move Function: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/OOPS-4:Othello Move Function -------------------------------------------------------------------------------- /Polynomial class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Polynomial class -------------------------------------------------------------------------------- /Priority Queues:Buy the ticket: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Priority Queues:Buy the ticket -------------------------------------------------------------------------------- /Priority Queues:Check Max-Heap: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Priority Queues:Check Max-Heap -------------------------------------------------------------------------------- /Priority Queues:In-place heap sort: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Priority Queues:In-place heap sort -------------------------------------------------------------------------------- /Priority Queues:K largest elements: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Priority Queues:K largest elements -------------------------------------------------------------------------------- /Priority Queues:Kth largest element: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Priority Queues:Kth largest element -------------------------------------------------------------------------------- /Priority Queues:Max Priority Queue: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Priority Queues:Max Priority Queue -------------------------------------------------------------------------------- /Priority Queues:Merge K sorted arrays: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Priority Queues:Merge K sorted arrays -------------------------------------------------------------------------------- /Priority Queues:Remove Min: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Priority Queues:Remove Min -------------------------------------------------------------------------------- /Priority Queues:Running median: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Priority Queues:Running median -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/README.md -------------------------------------------------------------------------------- /Recursion 1:All Indices of Number: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1:All Indices of Number -------------------------------------------------------------------------------- /Recursion 1:Calculate Power: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1:Calculate Power -------------------------------------------------------------------------------- /Recursion 1:Check Number in Array: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1:Check Number in Array -------------------------------------------------------------------------------- /Recursion 1:First Index of Number: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1:First Index of Number -------------------------------------------------------------------------------- /Recursion 1:Last Index of Number: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1:Last Index of Number -------------------------------------------------------------------------------- /Recursion 1:Print Numbers: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1:Print Numbers -------------------------------------------------------------------------------- /Recursion 1:Recursion 1: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1:Recursion 1 -------------------------------------------------------------------------------- /Recursion 1:Sum of Array: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1:Sum of Array -------------------------------------------------------------------------------- /Recursion 1a:Check Palindrome (recursive): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1a:Check Palindrome (recursive) -------------------------------------------------------------------------------- /Recursion 1a:Count Zeros: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1a:Count Zeros -------------------------------------------------------------------------------- /Recursion 1a:Geometric Sum: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1a:Geometric Sum -------------------------------------------------------------------------------- /Recursion 1a:Multiplication (Recursive): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1a:Multiplication (Recursive) -------------------------------------------------------------------------------- /Recursion 1b:Pair star: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1b:Pair star -------------------------------------------------------------------------------- /Recursion 1b:Remove X: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1b:Remove X -------------------------------------------------------------------------------- /Recursion 1b:Replace pi (recursive): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1b:Replace pi (recursive) -------------------------------------------------------------------------------- /Recursion 1b:String to Integer: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1b:String to Integer -------------------------------------------------------------------------------- /Recursion 1b:Tower of Hanoi: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 1b:Tower of Hanoi -------------------------------------------------------------------------------- /Recursion 2: Return subset of an array: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2: Return subset of an array -------------------------------------------------------------------------------- /Recursion 2:Binary Search (Recursive): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Binary Search (Recursive) -------------------------------------------------------------------------------- /Recursion 2:Check AB: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Check AB -------------------------------------------------------------------------------- /Recursion 2:Merge Sort Code: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Merge Sort Code -------------------------------------------------------------------------------- /Recursion 2:Print Keypad Combinations Code: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Print Keypad Combinations Code -------------------------------------------------------------------------------- /Recursion 2:Print Permutations - String: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Print Permutations - String -------------------------------------------------------------------------------- /Recursion 2:Print Subset Sum to K: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Print Subset Sum to K -------------------------------------------------------------------------------- /Recursion 2:Print Subsets of Array: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Print Subsets of Array -------------------------------------------------------------------------------- /Recursion 2:Print all Codes - String: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Print all Codes - String -------------------------------------------------------------------------------- /Recursion 2:Quick Sort Code: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Quick Sort Code -------------------------------------------------------------------------------- /Recursion 2:Remove Duplicates Recursively: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Remove Duplicates Recursively -------------------------------------------------------------------------------- /Recursion 2:Replace Character Recursively: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Replace Character Recursively -------------------------------------------------------------------------------- /Recursion 2:Return Keypad Code: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Return Keypad Code -------------------------------------------------------------------------------- /Recursion 2:Return Permutations - String: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Return Permutations - String -------------------------------------------------------------------------------- /Recursion 2:Return all codes - String: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Return all codes - String -------------------------------------------------------------------------------- /Recursion 2:Return subsets sum to K: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Return subsets sum to K -------------------------------------------------------------------------------- /Recursion 2:Staircase: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Recursion 2:Staircase -------------------------------------------------------------------------------- /Stacks and Queues:Minimum bracket Reversal: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Stacks and Queues:Minimum bracket Reversal -------------------------------------------------------------------------------- /Test 1:Does s contain t ?: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Test 1:Does s contain t ? -------------------------------------------------------------------------------- /Test 1:Split Array: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Test 1:Split Array -------------------------------------------------------------------------------- /Time and Space Complexity Analysis:Check array rotation: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Time and Space Complexity Analysis:Check array rotation -------------------------------------------------------------------------------- /Time and Space Complexity Analysis:Duplicate in array: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Time and Space Complexity Analysis:Duplicate in array -------------------------------------------------------------------------------- /Time and Space Complexity Analysis:Find the Unique Element: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Time and Space Complexity Analysis:Find the Unique Element -------------------------------------------------------------------------------- /Time and Space Complexity Analysis:Pair sum in array: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Time and Space Complexity Analysis:Pair sum in array -------------------------------------------------------------------------------- /Time and Space Complexity Analysis:Print Array intersection: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Time and Space Complexity Analysis:Print Array intersection -------------------------------------------------------------------------------- /Time and Space Complexity Analysis:Rotate array: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Time and Space Complexity Analysis:Rotate array -------------------------------------------------------------------------------- /Time and Space Complexity Analysis:Triplet Sum: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Time and Space Complexity Analysis:Triplet Sum -------------------------------------------------------------------------------- /Tries and Huffman Coding:Auto complete: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Tries and Huffman Coding:Auto complete -------------------------------------------------------------------------------- /Tries and Huffman Coding:Count Words in Trie: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Tries and Huffman Coding:Count Words in Trie -------------------------------------------------------------------------------- /Tries and Huffman Coding:Palindrome Pair: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Tries and Huffman Coding:Palindrome Pair -------------------------------------------------------------------------------- /Tries and Huffman Coding:Pattern Matching: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Tries and Huffman Coding:Pattern Matching -------------------------------------------------------------------------------- /Tries and Huffman Coding:Search word in Trie: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/suchimaheshwari/Coding-ninjas-data-st.-through-java/HEAD/Tries and Huffman Coding:Search word in Trie --------------------------------------------------------------------------------