Name		Name	Last commit message	Last commit date
Latest commit History 139 Commits
Assignment: Recursion 1a:Sum of digits (recursive)		Assignment: Recursion 1a:Sum of digits (recursive)
BST and Binary Tree Assignment::Pair sum in a BST		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::Print nodes at distance k from node
BST and Binary Tree Assignment:Largest BST		BST and Binary Tree Assignment:Largest BST
BST and Binary Tree Assignment:replace with Sum of greater nodes		BST and Binary Tree Assignment:replace with Sum of greater nodes
Binary Search Trees: Print Elements in Range		Binary Search Trees: Print Elements in Range
Binary Search Trees:BST Class		Binary Search Trees:BST Class
Binary Search Trees:BST to Sorted LL		Binary Search Trees:BST to Sorted LL
Binary Search Trees:Check if a Binary Tree is BST		Binary Search Trees:Check if a Binary Tree is BST
Binary Search Trees:Construct BST From Sorted Array		Binary Search Trees:Construct BST From Sorted Array
Binary Search Trees:Create & Insert Duplicate Node		Binary Search Trees:Create & Insert Duplicate Node
Binary Search Trees:Find Path in BST		Binary Search Trees:Find Path in BST
Binary Search Trees:LCA of BST		Binary Search Trees:LCA of BST
Binary Search Trees:LCA of Binary Tree		Binary Search Trees:LCA of Binary Tree
Binary Search Trees:Pair sum BInary Tree		Binary Search Trees:Pair sum BInary Tree
Binary Search Trees:Path Sum Root to Leaf		Binary Search Trees:Path Sum Root to Leaf
Binary Search Trees:Search Node in BST		Binary Search Trees:Search Node in BST
ComplexNumbers		ComplexNumbers
DP - 1:Min Steps to One using DP		DP - 10BC0 1:Min Steps to One using DP
DP - 1:Minimum Count of Squares		DP - 1:Minimum Count of Squares
DP - 1:Number of Balanced BTs		DP - 1:Number of Balanced BTs
DP - 1:Number of Balanced BTs Using DP		DP - 1:Number of Balanced BTs Using DP
DP - 1:Staircase		DP - 1:Staircase
DP - 2:0 1 Knapsack		DP - 2:0 1 Knapsack
DP - 2:Edit Distance(Memoization and DP)		DP - 2:Edit Distance(Memoization and DP)
DP - 2:Knapsack(Memoization and DP)		DP - 2:Knapsack(Memoization and DP)
DP - 2:Loot Houses		DP - 2:Loot Houses
DP - 2:Maximum Square Matrix With All Zeros		DP - 2:Maximum Square Matrix With All Zeros
DP-2: Edit Distance		DP-2: Edit Distance
DP-2:Coin Tower		DP-2:Coin Tower
DP-2:Longest Increasing Subsequence		DP-2:Longest Increasing Subsequence
DP-2:Matrix Chain Multiplication		DP-2:Matrix Chain Multiplication
DP-2:Maximum Square Matrix With All Zeros		DP-2:Maximum Square Matrix With All Zeros
DP1:Min Steps to One		DP1:Min Steps to One
DynamicArray		DynamicArray
Fraction class		Fraction class
FractionUse class		FractionUse class
Graphs-2: Kruskal's Algorithm		Graphs-2: Kruskal's Algorithm
Graphs-2:Dijkstra's Algorithm		Graphs-2:Dijkstra's Algorithm
Graphs-2:Prim's Algo		Graphs-2:Prim's Algo
Graphs: Has Path		Graphs: Has Path
Graphs:All connected components		Graphs:All connected components
Graphs:BFS Traversal		Graphs:BFS Traversal
Graphs:Get Path - BFS		Graphs:Get Path - BFS
Graphs:Get Path - DFS		Graphs:Get Path - DFS
Graphs:Is Connected ?		Graphs:Is Connected ?
Hashmaps::Extract Unique characters		Hashmaps::Extract Unique characters
Hashmaps:Longest consecutive Sequence		Hashmaps:Longest consecutive Sequence
Hashmaps:Longest subset zero sum		Hashmaps:Longest subset zero sum
Hashmaps:Maximum Frequency Number		Hashmaps:Maximum Frequency Number
Hashmaps:Pair Sum to 0		Hashmaps:Pair Sum to 0
Hashmaps:Pairs with difference K		Hashmaps:Pairs with difference K
Hashmaps:Print Intersection		Hashmaps:Print Intersection
Linked List 1:AppendLastNToFirst		Linked List 1:AppendLastNToFirst
Linked List 1:Delete Node in LL		Linked List 1:Delete Node in LL
Linked List 1:Eliminate duplicates from LL		Linked List 1:Eliminate duplicates from LL
Linked List 1:Find a node in LL		Linked List 1:Find a node in LL
Linked List 1:Length of LL		Linked List 1:Length of LL
Linked List 1:Palindrome LinkedList		Linked List 1:Palindrome LinkedList
Linked List 1:Print ith Node		Linked List 1:Print ith Node
Linked List 1:Print reverse LinkedList		Linked List 1:Print reverse LinkedList
Linked List 2:Bubble Sort (Iterative) LinkedList		Linked List 2:Bubble Sort (Iterative) LinkedList
Linked List 2:Delete every N nodes		Linked List 2:Delete every N nodes
Linked List 2:Delete node (recursive)		Linked List 2:Delete node (recursive)
Linked List 2:Even after Odd LinkedList		Linked List 2:Even after Odd LinkedList
Linked List 2:Find a node in LL (recursive)		Linked List 2:Find a node in LL (recursive)
Linked List 2:Merge Sort		Linked List 2:Merge Sort
Linked List 2:Merge two sorted LL		Linked List 2:Merge two sorted LL
Linked List 2:Midpoint of Linked list		Linked List 2:Midpoint of Linked list
Linked List 2:Reverse LL (Iterative)		Linked List 2:Reverse LL (Iterative)
Linked List 2:Reverse LL (Recursive)		Linked List 2:Reverse LL (Recursive)
Linked List 2:Swap two Node of LL		Linked List 2:Swap two Node of LL
Linked List 2:kReverse		Linked List 2:kReverse
OOPS-4:Othello Move Function		OOPS-4:Othello Move Function
Polynomial class		Polynomial class
Priority Queues:Buy the ticket		Priority Queues:Buy the ticket
Priority Queues:Check Max-Heap		Priority Queues:Check Max-Heap
Priority Queues:In-place heap sort		Priority Queues:In-place heap sort
Priority Queues:K largest elements		Priority Queues:K largest elements
Priority Queues:Kth largest element		Priority Queues:Kth largest element
Priority Queues:Max Priority Queue		Priority Queues:Max Priority Queue
Priority Queues:Merge K sorted arrays		Priority Queues:Merge K sorted arrays
Priority Queues:Remove Min		Priority Queues:Remove Min
Priority Queues:Running median		Priority Queues:Running median
README.md		README.md
Recursion 1:All Indices of Number		Recursion 1:All Indices of Number
Recursion 1:Calculate Power		Recursion 1:Calculate Power
Recursion 1:Check Number in Array		Recursion 1:Check Number in Array
Recursion 1:First Index of Number		Recursion 1:First Index of Number
Recursion 1:Last Index of Number		Recursion 1:Last Index of Number
Recursion 1:Print Numbers		Recursion 1:Print Numbers
Recursion 1:Recursion 1		Recursion 1:Recursion 1
Recursion 1:Sum of Array		Recursion 1:Sum of Array
Recursion 1a:Check Palindrome (recursive)		Recursion 1a:Check Palindrome (recursive)
Recursion 1a:Count Zeros		Recursion 1a:Count Zeros
Recursion 1a:Geometric Sum		Recursion 1a:Geometric Sum
Recursion 1a:Multiplication (Recursive)		Recursion 1a:Multiplication (Recursive)
Recursion 1b:Pair star		Recursion 1b:Pair star
Recursion 1b:Remove X		Recursion 1b:Remove X
Recursion 1b:Replace pi (recursive)		Recursion 1b:Replace pi (recursive)

suchimaheshwari/Coding-ninjas-data-st.-through-java

Folders and files

Latest commit

History

Repository files navigation

Coding ninjas data structure through java all solutions

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Packages