Skip to content
BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

230 Commits
Array
Array
 
 
BST
BST
 
 
Binary Tree
Binary Tree
 
 
DynamicProg
DynamicProg
 
 
Graph
Graph
 
 
Greedy
Greedy
 
 
Heap
Heap
 
 
Linked List
Linked List
 
 
Sorting Algo
Sorting Algo
 
 
Trie
Trie
 
 
(Rod cutting)Maximise number of cuts in a rod if it can be cut only in given 3 sizes
(Rod cutting)Maximise number of cuts in a rod if it can be cut only in given 3 sizes
 
 
4sum(Uncomplete).java
4sum(Uncomplete).java
 
 
AggressiveCow.java
AggressiveCow.java
 
 
Anagram String
Anagram String
 
 
BIT Manipulation Class 1 All Solution.java
BIT Manipulation Class 1 All Solution.java
 
 
Basic Problems of Hash & Map.java
Basic Problems of Hash & Map.java
 
 
Best Time to Buy and Sell Stock(Return MaxProfit)
Best Time to Buy and Sell Stock(Return MaxProfit)
 
 
BinaryTree Traversal.java
BinaryTree Traversal.java
 
 
BitMenipulationClass2.java
BitMenipulationClass2.java
 
 
BookAllocation.java
BookAllocation.java
 
 
Check and Print the Subarray with sum 0
Check and Print the Subarray with sum 0
 
 
Check if a string is a substring of another string.java
Check if a string is a substring of another string.java
 
 
CointainsWithMostWater(Array)
CointainsWithMostWater(Array)
 
 
CountDistinctElementInEveryWindow.java
CountDistinctElementInEveryWindow.java
 
 
Cousins in binary tree.java
Cousins in binary tree.java
 
 
DeepCopy Link List.java
DeepCopy Link List.java
 
 
DeleteMiddleElementOf Stack.java
DeleteMiddleElementOf Stack.java
 
 
DisjointSetClass.java
DisjointSetClass.java
 
 
Find Min Diff between 2 element.java
Find Min Diff between 2 element.java
 
 
Find Minimum MaximumBinaryTree.java
Find Minimum MaximumBinaryTree.java
 
 
Find teh leftmost char that repeats in a string.java
Find teh leftmost char that repeats in a string.java
 
 
Find the maximum j - 1 such that arr[j] > arr[i]
Find the maximum j - 1 such that arr[j] > arr[i]
 
 
Find the only Non repeating one where every other repeat thrice
Find the only Non repeating one where every other repeat thrice
 
 
Find the1st & last Occurrence of an element in sorted array.java
Find the1st & last Occurrence of an element in sorted array.java
 
 
FindTotalNumOfUniquePathsIn a Matrix
FindTotalNumOfUniquePathsIn a Matrix
 
 
GasStation.java
GasStation.java
 
 
Hashing(Largest Subarray With Zerosum).java
Hashing(Largest Subarray With Zerosum).java
 
 
Implement 2 Stack in one array.java
Implement 2 Stack in one array.java
 
 
Implement Minstack in a special stack in O(1) time and space.java
Implement Minstack in a special stack in O(1) time and space.java
 
 
Implement a Circular queue.java
Implement a Circular queue.java
 
 
Insert In A BST.java
Insert In A BST.java
 
 
Intersection of 2 Sorted LinkedList.java
Intersection of 2 Sorted LinkedList.java
 
 
Intersection of 2 Unsorted Array.java
Intersection of 2 Unsorted Array.java
 
 
Is Array represent valid preorder traversal BST.Java
Is Array represent valid preorder traversal BST.Java
 
 
KTh smallestElement in a BST.java
KTh smallestElement in a BST.java
 
 
Largest Area Sub matrix of a matrix.java
Largest Area Sub matrix of a matrix.java
 
 
Length of the last word of a string.java
Length of the last word of a string.java
 
 
Level Order Traversal.java
Level Order Traversal.java
 
 
LinkedListProblem(Basics).java
LinkedListProblem(Basics).java
 
 
Longest Common Prefix.Java
Longest Common Prefix.Java
 
 
Longest Substring Without Repeating Characters.java
Longest Substring Without Repeating Characters.java
 
 
Longest consecutive subsequences.java
Longest consecutive subsequences.java
 
 
MEDIAN OF 2 SORTED ARRAY.JAVA
MEDIAN OF 2 SORTED ARRAY.JAVA
 
 
MaximumDepthofBT.java
MaximumDepthofBT.java
 
 
MaximumRectangularAreaInHistigram.java
MaximumRectangularAreaInHistigram.java
 
 
MaximumSumOfSubArray.java
MaximumSumOfSubArray.java
 
 
MedianOf Row wise sorted matrix.java
MedianOf Row wise sorted matrix.java
 
 
Mejority Element
Mejority Element
 
 
Minimum Sum Of A Contigious Subarray
Minimum Sum Of A Contigious Subarray
 
 
Move All zeros to the end of an given array
Move All zeros to the end of an given array
 
 
N Stack Implement Using 1 Array.java
N Stack Implement Using 1 Array.java
 
 
NQueen
NQueen
 
 
NQueen (Using Hashing) For Less Time Complexity
NQueen (Using Hashing) For Less Time Complexity
 
 
Next Greater and previous smaller Element.java
Next Greater and previous smaller Element.java
 
 
Painters Partition.java
Painters Partition.java
 
 
PalindromeLinkList.java
PalindromeLinkList.java
 
 
Parentheses Matching problem.java
Parentheses Matching problem.java
 
 
PowerSets of A String
PowerSets of A String
 
 
Print all nodes in distance k.java
Print all nodes in distance k.java
 
 
PrintBST Element In Given Range.java
PrintBST Element In Given Range.java
 
 
PrintFrequencyOfNumberInAnSortedArray
PrintFrequencyOfNumberInAnSortedArray
 
 
PrintKdistanceNodes.java
PrintKdistanceNodes.java
 
 
Queue using 2Stack.java
Queue using 2Stack.java
 
 
README.md
README.md
 
 
RainWaterTrapping(Array) & space O(1)
RainWaterTrapping(Array) & space O(1)
 
 
RainWaterTrapping(Array) With T(n) = O(n^2) and space O(1)
RainWaterTrapping(Array) With T(n) = O(n^2) and space O(1)
 
 
Rat in a Maze I (Moving down and right only)
Rat in a Maze I (Moving down and right only)
 
 
Reverse Nodes in Even Length Groups.java
Reverse Nodes in Even Length Groups.java
 
 
Reverse portion of a linkedList.java
Reverse portion of a linkedList.java
 
 
Reverse the word in a given string.java
Reverse the word in a given string.java
 
 
ReverseAQueue.Java
ReverseAQueue.Java
 
 
ReverseByGroupofK.java
ReverseByGroupofK.java
 
 
ReverseKElementQueue.java
ReverseKElementQueue.java
 
 
ReverseNodesin K group(II).java
ReverseNodesin K group(II).java
 
 
ReverseStack.java
ReverseStack.java
 
 
RightViewOfTheBinaryTree.java
RightViewOfTheBinaryTree.java
 
 
Rotate An Array By K steps
Rotate An Array By K steps
 
 
Search a element in row wise column wise sorted matrix
Search a element in row wise column wise sorted matrix
 
 
Search an element in sorted rotated Array.java
Search an element in sorted rotated Array.java
 
 
SearchInABinarySearchTree.java
SearchInABinarySearchTree.java
 
 
Sizeof the Tree.java
Sizeof the Tree.java
 
 
SlidingWindowMaximum.java
SlidingWindowMaximum.java
 
 
Sort Arrays of 0s,1s & 2s.java
Sort Arrays of 0s,1s & 2s.java
 
 
Sorted LinkedList Remove Duplicate.java
Sorted LinkedList Remove Duplicate.java
 
 
Split the array in 3 part with equal sum
Split the array in 3 part with equal sum
 
 
Subarray Given Sum (Hashing).java
Subarray Given Sum (Hashing).java
 
 
Subsequences string
Subsequences string
 
 
Sum Of All Digits in A Number
Sum Of All Digits in A Number
 
 
Three Sum(Find a triplet that sum to a given value)
Three Sum(Find a triplet that sum to a given value)
 
 
TopViewOf Binary Tree.java
TopViewOf Binary Tree.java
 
 

Repository files navigation

JAVA-DSA-Course

A Repository of solution for some important DSA Question of all the Topics

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages