GeeksforGeeks

KO | EN

gitlite — search

#typescript #ai-agents #deepseek-harness #dsh-plugin #open-source #ai #cli #dsh #claude-code #codex #developer-tools #react

★ 38 Open GitHub ↗

Java solutions to all the problems solved by myself in GeeksForGeeks website.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# GeeksforGeeks
Java solutions to all the problems solved by myself in GeeksForGeeks website. Keeping a daily dairy about problem solving.
https://www.geeksforgeeks.org/

* **06.10.2020** : 	[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Arrays_PascalsTriangle.java)
* **29.09.2020** : 	[Topological Sort](https://practice.geeksforgeeks.org/problems/topological-sort/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Graph_TopologicalSort.java)
* **26.09.2020** : 	[Next Permutation](https://practice.geeksforgeeks.org/problems/next-permutation/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Arrays_NextPermutation.java)
* **25.09.2020** : 	[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Arrays_NonOverlappingIntervals.java)
* **24.09.2020** : 	[Maximum Product Contiguous Subarray](https://practice.geeksforgeeks.org/problems/maximum-product-subarray3604/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/DP_ContiguousSubArrayMaxProduct.java)
* **23.09.2020** : 	[Merge two sorted arrays with O(1) space](https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1) (*Hard*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/4.%20Hard/src/Arrays_Merge2SortedArrWithOutExtraSpace.java)
* **22.09.2020** : 	[Minimum Number of Arrows to Burst Balloon](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Arrays_MinNumOfArrowsToBurstBalloons.java) || [Find Missing And Repeating](https://practice.geeksforgeeks.org/problems/find-missing-and-repeating2512/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Arrays_FindMissingAndRepeating.java)
* **11.09.2020** : 	[LCA of BST](https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-bst/1/) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/BST_LCAOfBinarySearchTree.java) || [Construct Tree from Inorder & Postorder](https://practice.geeksforgeeks.org/problems/tree-from-postorder-and-inorder/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_ConstructTreeFromInorderPostorder.java)
* **08.09.2020** : 	[Level order traversal](https://practice.geeksforgeeks.org/problems/level-order-traversal/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_LevelOrderTraversal.java) || [Vertical Traversal of Binary Tree](https://practice.geeksforgeeks.org/problems/print-a-binary-tree-in-vertical-order/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Tree_VerticalTraversalOfBinaryTree.java) || [Bottom View of Binary Tree](https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Tree_BottomViewOfBinaryTree.java) || [Top View of Binary Tree](https://practice.geeksforgeeks.org/problems/top-view-of-binary-tree/1/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Tree_TopViewOfBinaryTree.java)
* **07.09.2020** : 	[Right View of Binary Tree](https://practice.geeksforgeeks.org/problems/right-view-of-binary-tree/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_RightViewOfBinaryTree.java)
* **05.09.2020** : 	[Combination Sum 1](https://practice.geeksforgeeks.org/problems/combination-sum/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Backtracking_CombinationSum1.java) || [Combination Sum 2](https://practice.geeksforgeeks.org/problems/combination-sum-part-2/0/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Backtracking_CombinationSum2.java)
* **04.09.2020** : 	[Solve the Sudoku](https://practice.geeksforgeeks.org/problems/solve-the-sudoku/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/4.%20Hard/src/Backtracking_SudokuSolver.java)
* **03.09.2020** : 	[Check validity of sudoku](https://practice.geeksforgeeks.org/problems/is-sudoku-valid/0/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Arrays_CheckValidityOfSudoku.java) || [Rat in a Maze](https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Backtracking_RatInAMaze.java)
* **02.09.2020** : 	[Clone a graph](https://leetcode.com/problems/clone-graph/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Graph_CloneConnectedUndirectedGraph.java)
* **01.09.2020** : 	[Clone a Binary Tree with random pointer](https://practice.geeksforgeeks.org/problems/clone-a-binary-tree/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Tree_CloneBinaryTreeWithRandomPointer.java)
* **27.08.2020** : 	[LRU Cache](https://practice.geeksforgeeks.org/problems/lru-cache/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/LL_LRUCache.java)
* **26.08.2020** : 	[Preorder Traversal](https://practice.geeksforgeeks.org/problems/preorder-traversal/1/) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/Tree_BinaryTreePreOrderTraversal.java) || [Set Matrix Zeroes Ones](https://practice.geeksforgeeks.org/problems/boolean-matrix-problem/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Arrays_BooleanSetMatrixZerosOnes.java) || [Postorder Traversal](https://practice.geeksforgeeks.org/problems/postorder-traversal/1/) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/Tree_BinaryTreePostOrderTraversal.java)
* **25.08.2020** : 	[Intersection of Two Linked Lists](https://practice.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/LL_IntersectionPointOfTwoLL.java) || [Inorder Traversal](https://practice.geeksforgeeks.org/problems/inorder-traversal/1) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/Tree_BinaryTreeInOrderTraversal.java)
* **24.08.2020** : 	[Remove duplicate element from sorted Linked List](https://practice.geeksforgeeks.org/problems/remove-duplicate-element-from-sorted-linked-list/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/LL_RemoveDuplicateInSortedLL.java) || [Remove duplicate element and keep only distinct elements in sorted Linked List](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/LL_RemoveDuplicateKeepOnlyDistinctSortedLL.java) || [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/LL_RemoveNthNodeFromEndOfLL.java) || [Finding middle element in a linked list](https://practice.geeksforgeeks.org/problems/finding-middle-element-in-a-linked-list/1) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/LL_FindMiddleOfLL.java) || [Make middle node head in a linked list](https://www.geeksforgeeks.org/make-middle-node-head-linked-list/) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/LL_MakeMiddleNodeHeadOfLL.java)
* **23.08.2020** : 	[Insert into Sorted Circular Linked List](https://practice.geeksforgeeks.org/problems/sorted-insert-for-circular-linked-list/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/LL_InsertIntoSortedCircularLL.java)
* **22.08.2020** : 	[Duplicate in an array of N+1 integers](https://leetcode.com/problems/find-the-duplicate-number/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Arrays_FindDuplicateInArrayOfNPlusOneIntegers.java) || [Sort an array of 0s, 1s and 2s](https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Arrays_SortArrayOf0s1s2s_DutchNationalFlagAlgo.java)
* **21.08.2020** : 	[Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Arrays_PrisonCellsAfterNDays.java)
* **04.08.2020** : 	[Min num of coins change](https://practice.geeksforgeeks.org/problems/number-of-coins/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/DP_MinNumOfCoinChange.java) || [Num of ways to make coin change](https://practice.geeksforgeeks.org/problems/coin-change/0/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/DP_NumWaysOfCoinChange.java)
* **03.08.2020** : 	[Total number of ways to decode a message](https://practice.geeksforgeeks.org/problems/total-decoding-messages/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/DP_NumWaysDecodeMessage.java)
* **02.08.2020** : 	[Minimum cuts needed for palindrome partitioning of a given string](https://practice.geeksforgeeks.org/problems/palindromic-patitioning/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/DP_MinCutsForPalindromicPartitioning.java) || [Edit Distance](https://practice.geeksforgeeks.org/problems/edit-distance/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/DP_EditDistance.java)
* **01.08.2020** : 	[Circular tour of gas station](https://practice.geeksforgeeks.org/problems/circular-tour/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Arrays_CircularTourOfGasStation.java)
* **31.07.2020** : 	[Nth Fibonacci Number](https://practice.geeksforgeeks.org/problems/nth-fibonacci-number/0) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/Math_NthFibonacciNum.java) || [Count ways to reach the n'th stair using step 1 or 2](https://practice.geeksforgeeks.org/problems/count-ways-to-reach-the-nth-stair/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/DP_CountWaysToReachNthStairUsing12Steps.java) || [Count ways to reach the n'th stair using step 1, 2 or 3](https://www.geeksforgeeks.org/count-ways-reach-nth-stair-using-step-1-2-3/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/DP_CountWaysToReachNthStairUsing123Steps.java) || [Max Sum without Adjacents](https://practice.geeksforgeeks.org/problems/max-sum-without-adjacents/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/DP_MaxSumWithoutAdjacents.java) || [Stickler Thief](https://practice.geeksforgeeks.org/problems/stickler-theif/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/DP_SticklerThief.java)
* **30.07.2020** : 	[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/DP_RegularExpressionMatching.java)
* **29.07.2020** : 	[Minimum number of jumps to reach end of array](https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Greedy_MinNumOfJumpsToReachEnd.java)
* **28.07.2020** : 	[Majority Element](https://practice.geeksforgeeks.org/problems/majority-element/0) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/Arrays_MajorityElement.java)
* **27.07.2020** : 	[Longest Palindromic Substring](https://practice.geeksforgeeks.org/problems/longest-palindrome-in-a-string/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Strings_LongestPalindromeSubString.java) || [Max Sum Contiguous Subarray Kadane algo](https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/DP_ContiguousSubArrayMaxSumKadaneAlgo.java) 
* **26.07.2020** : 	[Trie - Insert and Search](https://practice.geeksforgeeks.org/problems/trie-insert-and-search/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Trie_InsertSearchDelete.java) || [Trie - Delete](https://practice.geeksforgeeks.org/problems/trie-delete/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Trie_InsertSearchDelete.java)
* **25.07.2020** : 	[Count of Smaller Numbers After Self](https://practice.geeksforgeeks.org/problems/count-smaller-elements/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Arrays_CountSmallerElementsOnRightSide.java)
* **24.07.2020** : 	[Smallest power of 2 greater than or equal to n](https://practice.geeksforgeeks.org/problems/smallest-power-of-2-greater-than-or-equal-to-n/0) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/Bit_SmallestPowOf2GreaterOrEqualN.java) || [Range Minimum Query using Segment Tree](https://practice.geeksforgeeks.org/problems/range-minimum-query/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/SegmentTree_RangeMinimumQuery.java)
* **23.07.2020** : 	[Minimum meeting rooms required](https://www.lintcode.com/problem/meeting-rooms-ii/description) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Heap_MeetingRoom.java) || [Merge overlapping Intervals](https://practice.geeksforgeeks.org/problems/overlapping-intervals/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Arrays_MergeOverlappingIntervals.java)
* **19.07.2020** : 	[Find whether path exist](https://practice.geeksforgeeks.org/problems/find-whether-path-exist/0/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Graph_FindWhetherPathExists.java) || [Clone linked list with next and random pointer](https://practice.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/LL_CloneLLWithNextAndRandomPtr.java)
* **18.07.2020** : 	[Unit Area of largest region of 1's](https://practice.geeksforgeeks.org/problems/length-of-largest-region-of-1s/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Graph_UnitAreaOfLargestRegionOfOnes.java)
* **17.07.2020** : 	[Diameter of Binary Tree](https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_DiameterOfBinaryTree.java)
* **15.07.2020** : 	[Find the path between two corners in a grid](https://www.geeksforgeeks.org/minimum-distance-to-the-corner-of-a-grid-from-source/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Graph_PathBetweenTwoCornersGrid.java) || [Rotten Oranges](https://practice.geeksforgeeks.org/problems/rotten-oranges/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Graph_RottenOranges.java)
* **14.07.2020** : 	[Word Ladder](https://practice.geeksforgeeks.org/problems/word-ladder/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Graph_WordLadder.java) || [Check Bipartite Graph](https://practice.geeksforgeeks.org/problems/bipartite-graph/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Graph_CheckIsBipartiteGraph.java)
* **13.07.2020** : 	[Detect cycle in an undirected graph](https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Graph_DetectCycleInUndirectedGraph.java) || [N-Queen Problem](https://practice.geeksforgeeks.org/problems/n-queen-problem/0) (*Hard*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/4.%20Hard/src/Backtracking_NQueenProblem.java)  
* **12.07.2020** : 	[Merge k Sorted Arrays](https://practice.geeksforgeeks.org/problems/merge-k-sorted-arrays/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Heap_MergeKSortedArrays.java) || [Merge K sorted linked lists](https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Heap_MergeKSortedLL.java)
* **11.07.2020** : 	[Check if Linked List is Palindrome](https://practice.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1/) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/LL_LinkedListIsPalindrome.java)
* **10.07.2020** : 	[Source to destination shortest path in undirected unweighted graph](https://www.geeksforgeeks.org/shortest-path-unweighted-graph/) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Graph_ShortestPath.java) || [Count subarrays having sum zero](https://practice.geeksforgeeks.org/problems/zero-sum-subarrays/0/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Hash_PrintAllZeroSumSubArrays.java) || [Add two numbers represented by linked lists](https://practice.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/LL_AddTwoNumRepresentedByLL.java) 
* **09.07.2020** : 	[Check if a path exists between two vertices in a directed graph](https://www.geeksforgeeks.org/find-if-there-is-a-path-between-two-vertices-in-a-given-graph/) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Graph_CheckIfARouteExistsBetweenNodes.java) || [BFS traversal of graph](https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Graph_BFSTraversalOfGraph.java) 
* **08.07.2020** : 	[Check if Undirected Graph is Connected](https://thecodingsimplified.com/check-if-undirected-graph-is-connected/) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Graph_CheckIfUndirectedGraphIsConnected.java)
* **05.07.2020** : 	[Print adjacency list](https://practice.geeksforgeeks.org/problems/print-adjacency-list/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Graph_PrintAdjacencyList.java) || [Print adjacency list](https://practice.geeksforgeeks.org/problems/print-adjacency-list-1587115620/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Graph_PrintAdjacencyList1.java) || [Count ways to express a number as sum of powers](https://practice.geeksforgeeks.org/problems/express-as-sum-of-power-of-natural-numbers/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Recursion_WaysToExpressNumAsSumOfPowers.java) || [Repetitive Addition Of Digits](https://practice.geeksforgeeks.org/problems/repetitive-addition-of-digits/0) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/Math_RepetitiveAdditionOfDigits.java)
* **04.07.2020** : 	[BST from sorted array](https://practice.geeksforgeeks.org/problems/array-to-bst/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/BST_ArrayToBST.java) || [k-th smallest element in BST](https://practice.geeksforgeeks.org/problems/find-k-th-smallest-element-in-bst/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/BST_KthSmallestElementInBST.java)
* **03.07.2020** : 	[Construct Tree from Inorder & Preorder](https://practice.geeksforgeeks.org/problems/construct-tree-1/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_ConstructTreeFromInorderPreorder.java) || [Lowest Common Ancestor in a Binary Tree](https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-binary-tree/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_LCAOfBinaryTree.java)
* **02.07.2020** : 	[Generate All Possible Parentheses](https://practice.geeksforgeeks.org/problems/generate-all-possible-parentheses/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Backtracking_GenerateAllPossibleParentheses.java) || [Palindrome Partitioning of a string](https://www.geeksforgeeks.org/print-palindromic-partitions-string/) (*Hard*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/4.%20Hard/src/Backtracking_PalindromePartitioning.java)
* **29.06.2020** : 	[Tower of Hanoi](https://practice.geeksforgeeks.org/problems/help-the-old-man/0) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/Recursion_TowerOfHanoi.java) || [Kth permutation of a sequence](https://www.geeksforgeeks.org/find-the-k-th-permutation-sequence-of-first-n-natural-numbers/) (*Hard*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/4.%20Hard/src/Recursion_KthPermutationOfSequence.java)
* **28.06.2020** : 	[Count distinct pairs with difference k](https://practice.geeksforgeeks.org/problems/count-distinct-pairs-with-difference-k/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Hash_CountDistinctPairsWithDiffK.java) || [Kth largest element in a stream](https://practice.geeksforgeeks.org/problems/kth-largest-element-in-a-stream/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Heap_KthLargestElementInStream.java) 
* **27.06.2020** : 	[Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0) (*Hard*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/4.%20Hard/src/Heap_FindMedianInStream.java) || [Find k most frequent words from file](https://www.geeksforgeeks.org/find-the-k-most-frequent-words-from-a-file/) (*Hard*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/4.%20Hard/src/Heap_FindKMostFrequentWordsInFile.java)
* **26.06.2020** : 	[Minimum Cost of ropes](https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Heap_MinimumCostOfRopes.java)
* **25.06.2020** : 	[Anagram Palindrome](https://practice.geeksforgeeks.org/problems/anagram-palindrome/0) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/Hash_AnagramPalindrome.java) || [Subarray with 0 sum](https://practice.geeksforgeeks.org/problems/subarray-with-0-sum/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Hash_SubArrayWithZeroSum.java)
* **24.06.2020** : 	[ZigZag Tree Traversal](https://practice.geeksforgeeks.org/problems/zigzag-tree-traversal/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_ZigZagBinaryTreeTraversal.java) || [Nth node of linked list](https://practice.geeksforgeeks.org/problems/node-at-a-given-index-in-linked-list/1) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_ZigZagBinaryTreeTraversal.java)
* **23.06.2020** : 	[Next larger element](https://practice.geeksforgeeks.org/problems/next-larger-element/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Stack_NextLargerElement.java)
* **22.06.2020** : 	[Parenthesis Checker](https://practice.geeksforgeeks.org/problems/parenthesis-checker/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Stack_ParenthesisChecker.java)
* **16.06.2020** : 	[Delete Linked List node at given position](https://practice.geeksforgeeks.org/problems/delete-a-node-in-single-linked-list/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/LL_DeleteSingleLLNodeAtGivenPos.java) || [Delete without head pointer](https://practice.geeksforgeeks.org/problems/delete-without-head-pointer/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/LL_DeleteLLNodeWithoutHeadPointer.java)
* **15.06.2020** : 	[Swap all odd and even bits](https://practice.geeksforgeeks.org/problems/swap-all-odd-and-even-bits/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/BitMagic_SwapAllOddEvenBits.java)
* **14.06.2020** : 	[First and last occurrences of X](https://practice.geeksforgeeks.org/problems/first-and-last-occurrences-of-x/0) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/Searching_FirstAndLastOccurrencesOfX.java) || [Number of occurrences of X in sorted array](https://practice.geeksforgeeks.org/problems/number-of-occurrence/0) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/Searching_NumberOfOccurrence.java)
* **13.06.2020** : 	[Search in a matrix](https://practice.geeksforgeeks.org/problems/search-in-a-matrix/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Searching_SearchInAMatrix.java) || [Sum of Middle Elements of two sorted arrays](https://practice.geeksforgeeks.org/problems/sum-of-middle-elements-of-two-sorted-arrays/0/) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/DivConquer_SumOfMidElementsOfTwoSortedArr.java)
* **12.06.2020** : 	[Length of the longest substring](https://practice.geeksforgeeks.org/problems/length-of-the-longest-substring/0) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/SlidingWin_LenOfLongestSubstringNoRepChars.java) ||
					[Search in a Rotated Array](https://practice.geeksforgeeks.org/problems/search-in-a-rotated-array/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/SearchInRotatedArray.java) 
* **11.06.2020** : 	[Count Occurences of Anagrams](https://practice.geeksforgeeks.org/problems/count-occurences-of-anagrams/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/SlidingWin_CountOccurrencesOfAnagrams.java)
* **10.06.2020** : 	[Longest K unique characters substring](https://practice.geeksforgeeks.org/problems/longest-k-unique-characters-substring/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/SlidingWin_LongestKUniqueCharsSubStr.java)
* **09.06.2020** : 	[Length Unsorted Subarray](https://practice.geeksforgeeks.org/problems/length-unsorted-subarray/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Array_LengthUnsortedSubArray.java)
* **08.06.2020** : 	[Reverse a Linked List in groups of given size](https://practice.geeksforgeeks.org/problems/reverse-a-linked-list-in-groups-of-given-size/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/LL_ReverseLinkedListGroupsOfSizeK.java)
* **07.06.2020** : 	[Detect Loop in linked list](https://practice.geeksforgeeks.org/problems/detect-loop-in-linked-list/1/) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/LL_DetectLoopInLinkedList.java) ||
					[Remove loop in Linked List](https://practice.geeksforgeeks.org/problems/remove-loop-in-linked-list/1/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/LL_RemoveCycleLoopInLinkedList.java)
* **30.05.2020** : 	[Reverse a linked list](https://practice.geeksforgeeks.org/problems/reverse-a-linked-list/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/LL_ReverseLinkedList.java) ||
					[Print Linked List elements](https://practice.geeksforgeeks.org/problems/print-linked-list-elements/1) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/LL_PrintLinkedList.java)
* **25.05.2020** : 	[Inorder Successor in BST](https://practice.geeksforgeeks.org/problems/inorder-successor-in-bst/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/BST_InorderSuccessorInBST.java)
* **24.05.2020** : 	[Product array puzzle](https://practice.geeksforgeeks.org/problems/product-array-puzzle/0) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/ArraysMathematical_ProductArrayPuzzle.java)
* **23.05.2020** : 	[Fixing Two nodes of a BST](https://practice.geeksforgeeks.org/problems/fixed-two-nodes-of-a-bst/1) (*Hard*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/4.%20Hard/src/BST_FixingTwoNodesOfBST.java) || 
					[Check for BST](https://practice.geeksforgeeks.org/problems/check-for-bst/1) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/BST_CheckForBST.java)
* **21.05.2020** : 	[Exchange the Leaf Nodes](https://practice.geeksforgeeks.org/problems/exchange-the-leaf-nodes/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_ExchangeTheLeafNodes.java)
* **20.05.2020** : 	[Delete a node from BST](https://practice.geeksforgeeks.org/problems/delete-a-node-from-bst/1/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/BST_DeleteNodeFromBST.java) ||
					[Minimum element in BST](https://practice.geeksforgeeks.org/problems/minimum-element-in-bst/1/) (*Basic*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/1.%20Basic/src/BST_MinimumElementInBST.java)
* **19.05.2020** : 	[Insert a node in a BST](https://practice.geeksforgeeks.org/problems/insert-a-node-in-a-bst/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/BST_InsertNodeInBST.java)
* **18.05.2020** : 	[Left View of Binary Tree](https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1) (*Easy*), : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_LeftViewOfBinaryTree.java) ||
					[Sum of Left Leaf Nodes](https://practice.geeksforgeeks.org/problems/sum-of-leaf-nodes/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_SumOfLeafNodes.java)
* **17.05.2020** : 	[Connect Nodes at Same Level](https://practice.geeksforgeeks.org/problems/connect-nodes-at-same-level/1/) (*Medium*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/3.%20Medium/src/Tree_ConnectNodesAtSameLevel.java)
* **16.05.2020** : 	[longest Consecutive Sequence in Binary Tree](https://practice.geeksforgeeks.org/problems/longest-consecutive-sequence-in-binary-tree/1) (*Easy*) : [Solution](https://github.com/sushovankarmakar/GeeksforGeeks/blob/master/2.%20Easy/src/Tree_LongestConsecutiveSequenceInBinaryTree.java)

GeeksforGeeks

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README