This is just for my personal use to understand and simulate some of DS and Java Concepts
Code Below
.
└── yogeesh
├── general
│ └── utilities
│ └── SendEmail.java
└── problemsolving
├── dynamic_programming
│ ├── CoinChangeProblem.java
│ ├── FindNextPalindromeNumber.java
│ ├── FindShortestRouteToNodeFromStart.java
│ ├── LongestCommonSubsequence.java
│ ├── LongestPalindromicSubstring.java
│ ├── MaxSumSubArray.java
│ ├── MoveAllZerosToEndMaintainOrder.java
│ ├── StepsCombinations.java
│ └── SubsetSum.java
├── general
│ ├── CheckPermutation.java
│ ├── CountAndSay.java
│ ├── FindAllSubSets.java
│ ├── FindMaxRectangleInMatrix.java
│ ├── FindMaxRectangleOfGivenArray.java
│ ├── FindMedianOfTwoSortedArray.java
│ ├── FindPermutationsOfString.java
│ ├── FindStartOfGasStationCircle.java
│ ├── MatrixRotate.java
│ ├── RemoveRecurringCharacters.java
│ ├── ReplaceStringChar.java
│ ├── ScoreAndCandies.java
│ ├── SearchElementInSortedMatrix.java
│ ├── StringReplace.java
│ └── WordBreak.java
├── graphs
│ ├── BFS.java
│ └── ZerosOnesIsland.java
└── sorting
├── MergeSort.java
└── QuickSort.java