KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

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

algorithms

★ 10 Open GitHub ↗

LeetCode, HackerRank, Codility, CTCI - Cracking The Coding Interview & Miscellaneous algorithms and data structures studies & solutions

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

![ViewCount](https://views.whatilearened.today/views/github/cenkc/algorithms.svg)
# Algorithms ([LeetCode](https://github.com/cenkc/algorithms#LeetCode), [HackerRank](https://github.com/cenkc/algorithms#hackerrank), [Codility](https://github.com/cenkc/algorithms#codility), [CTCI - Cracking The Coding Interview](https://github.com/cenkc/algorithms#ctci---cracking-the-coding-interview) & [Miscellaneous](https://github.com/cenkc/algorithms#miscellaneous) studies & solutions)

| Problem Tags  |
|---|
|[Binary Search](https://github.com/cenkc/algorithms/wiki/Binary-Search)   |
|[Binary Tree](https://github.com/cenkc/algorithms/wiki/Binary-Tree)   |
|[Breadth First Search (BFS)](https://github.com/cenkc/algorithms/wiki/Breadth-First-Search-(BFS)) _(Both BSTs and Graphs)_   |
|[Depth First Search (DFS)](https://github.com/cenkc/algorithms/wiki/Depth-First-Search-(DFS)) _(Both BSTs and Graphs)_   |
|[Divide and Conquer](https://github.com/cenkc/algorithms/wiki/Divide-and-Conquer)   |
|[Dynamic Programming](https://github.com/cenkc/algorithms/wiki/Dynamic-Programming)   |
|[Graph](https://github.com/cenkc/algorithms/wiki/Graph)   |
|[Greedy](https://github.com/cenkc/algorithms/wiki/Greedy)   |
|[Interactive](https://github.com/cenkc/algorithms/wiki/Interactive)   |
|[Linked List](https://github.com/cenkc/algorithms/wiki/Linked-List)   |
|[Minimum Spanning Tree - MST](https://github.com/cenkc/algorithms/wiki/Minimum-Spanning-Tree---MST)   |
|[Notes](https://github.com/cenkc/algorithms/wiki/Notes)   |
|[Shortest Path](https://github.com/cenkc/algorithms/wiki/Shortest-Path)   |
|[Sliding Window](https://github.com/cenkc/algorithms/wiki/Sliding-Window)   |
|[Sorting](https://github.com/cenkc/algorithms/wiki/Sorting)  |
|[Tree](https://github.com/cenkc/algorithms/wiki/Tree)   |
|[Trie](https://github.com/cenkc/algorithms/wiki/Trie)   |

| _[Common Pitfalls & Notes](https://github.com/cenkc/algorithms/wiki/Notes)_  |
|---|
|_[Integer.MAX_VALUE and Integer.MIN_VALUE usages](https://github.com/cenkc/algorithms/wiki/Notes#integermax_value-and-integermin_value-usages)_   |

## [LeetCode](https://leetcode.com/)
| PROBLEM DESCR. | SOLUTION | DIFFICULTY | RELATED TOPICS | ADDITIONAL INFO |
|---:|:---|:---|:---|:---|
| [*LeetCode*](https://leetcode.com/problems/two-sum/) | [1. Two Sum](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/TwoSum.java) | :green_circle:*Easy* | [*Array*](https://leetcode.com/tag/array/), [*Hash Table*](https://leetcode.com/tag/hash-table/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [3. Longest Substring Without Repeating Characters](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/LongestSubstrWithoutRepeatingChars.java) | :orange_circle:*Medium* | [*Sliding Window*](https://leetcode.com/tag/sliding-window/), [*Hash Table*](https://leetcode.com/tag/hash-table/), [*Two Pointers*](https://leetcode.com/tag/two-pointers/), [*String*](https://leetcode.com/tag/string/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/search-insert-position/) | [35. Search Insert Position](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/SearchInsertPosition.java) | :green_circle:*Easy* | [*Array*](https://leetcode.com/tag/array/), [*Binary Search*](https://leetcode.com/tag/binary-search/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/maximum-subarray/) | [53. Maximum Subarray](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/MaximumSubarray.java) | :green_circle:*Easy* | [*Array*](https://leetcode.com/tag/array/), [*Divide and Conquer*](https://leetcode.com/tag/divide-and-conquer/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/unique-paths/) | [62. Unique Paths](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/UniquePaths.java) | :orange_circle:*Medium* | [*Array*](https://leetcode.com/tag/array/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/minimum-path-sum/) | [64. Minimum Path Sum](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/MinimumPathSum.java) | :orange_circle:*Medium* | [*Array*](https://leetcode.com/tag/array/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/climbing-stairs/) | [70. Climbing Stairs](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/ClimbingStairs.java) | :green_circle:*Easy* | [*Math*](https://leetcode.com/tag/math/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/), [*Memoization*](https://leetcode.com/tag/memoization/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/search-a-2d-matrix/) | [74. Search a 2D Matrix](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/SearchA2DMatrix.java) | :orange_circle:*Medium* | [*Array*](https://leetcode.com/tag/array/), [*Binary Search*](https://leetcode.com/tag/binary-search/), [*Matrix*](https://leetcode.com/tag/matrix/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [94. Binary Tree Inorder Traversal](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/BinaryTreeInorderTraversal.java) | :orange_circle:*Medium* | [*Hash Table*](https://leetcode.com/tag/hash-table/), [*Stack*](https://leetcode.com/tag/stack/), [*Tree*](https://leetcode.com/tag/tree/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/validate-binary-search-tree/) | [98. Validate Binary Search Tree](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/ValidateBinarySearchTree.java) | :orange_circle:*Medium* | [*Tree*](https://leetcode.com/tag/tree/), [*Depth-first Search*](https://leetcode.com/tag/depth-first-search/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/symmetric-tree/) | [101. Symmetric Tree](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/SymmetricTree.java) | :green_circle:*Easy* | [*Tree*](https://leetcode.com/tag/tree/), [*Depth-first Search*](https://leetcode.com/tag/depth-first-search/), [*Breadth-first Search*](https://leetcode.com/tag/breadth-first-search/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [102. Binary Tree Level Order Traversal](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/BinaryTreeLevelOrderTraversal.java) | :orange_circle:*Medium* | [*Tree*](https://leetcode.com/tag/tree/), [*Breadth-first Search*](https://leetcode.com/tag/breadth-first-search/)  | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [104. Maximum Depth of Binary Tree](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/MaximumDepthOfBinaryTree.java) | :green_circle:*Easy* | [*Tree*](https://leetcode.com/tag/tree/), [*Depth-first Search*](https://leetcode.com/tag/depth-first-search/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/) | [107. Binary Tree Level Order Traversal II](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/BinaryTreeLevelOrderTraversal_II.java) | :green_circle:*Easy* | [*Tree*](https://leetcode.com/tag/tree/), [*Breadth-first Search*](https://leetcode.com/tag/breadth-first-search/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | [111. Minimum Depth of Binary Tree](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/MinimumDepthOfBinaryTree.java) | :green_circle:*Easy* | [*Tree*](https://leetcode.com/tag/tree/), [*Depth-first Search*](https://leetcode.com/tag/depth-first-search/), [*Breadth-first Search*](https://leetcode.com/tag/breadth-first-search/)  | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/pascals-triangle/) | [118. Pascal's Triangle](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/PascalsTriangle.java) | :green_circle:*Easy* | [*Array*](https://leetcode.com/tag/array/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/)  | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [121. Best Time to Buy and Sell Stock](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/BestTimeToBuyAndSellStock.java) | :green_circle:*Easy* | [*Array*](https://leetcode.com/tag/array/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | [122. Best Time to Buy and Sell Stock II](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/BestTimeToBuyAndSellStock2.java) | :green_circle:*Easy* | [*Array*](https://leetcode.com/tag/array/), [*Greedy*](https://leetcode.com/tag/greedy/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | [124. Binary Tree Maximum Path Sum](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/BinaryTreeMaxPathSum.java) | :red_circle:*Hard* | [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/), [*Tree*](https://leetcode.com/tag/tree/), [*Depth-first Search*](https://leetcode.com/tag/depth-first-search/), [*Binary Tree*](https://leetcode.com/tag/binary-tree/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/surrounded-regions/) | [130. Surrounded Regions](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/SurroundedRegions.java) | :orange_circle:*Medium* | [*Depth-first Search*](https://leetcode.com/tag/depth-first-search/), [*Breadth-first Search*](https://leetcode.com/tag/breadth-first-search/), [*Union Find*](https://leetcode.com/tag/union-find/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/word-break/) | [139. Word Break](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/WordBreak.java) | :orange_circle:*Medium* | [*Hash Table*](https://leetcode.com/tag/hash-table/), [*String*](https://leetcode.com/tag/string/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/), [*Trie*](https://leetcode.com/tag/trie/), [*Memoization*](https://leetcode.com/tag/memoization/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/binary-tree-preorder-traversal/) | [144. Binary Tree Preorder Traversal](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/BinaryTreePreorderTraversal.java) | :orange_circle:*Medium* | [*Stack*](https://leetcode.com/tag/stack/), [*Tree*](https://leetcode.com/tag/tree/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/binary-tree-postorder-traversal/) | [145. Binary Tree Postorder Traversal](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/BinaryTreePostorderTraversal.java) | :red_circle:*Hard* | [*Stack*](https://leetcode.com/tag/stack/), [*Tree*](https://leetcode.com/tag/tree/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/house-robber/) | [198. House Robber](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/HouseRobber.java) | :orange_circle:*Medium* | [*Array*](https://leetcode.com/tag/array/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/number-of-islands/) | [200. Number of Islands](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/NumberOfIslands.java) | :orange_circle:*Medium* | [*Depth-first Search*](https://leetcode.com/tag/depth-first-search/), [*Breadth-first Search*](https://leetcode.com/tag/breadth-first-search/), [*Union Find*](https://leetcode.com/tag/union-find/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/reverse-linked-list/) | [206. Reverse Linked List](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/ReverseLinkedList.java) | :green_circle:*Easy* | [*Linked List*](https://leetcode.com/tag/linked-list/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/implement-trie-prefix-tree/) | [208. Implement Trie (Prefix Tree)](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/Trie.java) | :orange_circle:*Medium* | [*Hash Taable* ](https://leetcode.com/tag/hash-table/), [*String* ](https://leetcode.com/tag/string/), [*Design* ](https://leetcode.com/tag/design/), [*Trie* ](https://leetcode.com/tag/trie/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/house-robber-ii/) | [213. House Robber II](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/HouseRobberII.java) | :orange_circle:*Medium* | [*Array*](https://leetcode.com/tag/array/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | [230. Kth Smallest Element in a BST](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/KthSmallestElementInABST.java) | :orange_circle:*Medium* | [*Binary Search*](https://leetcode.com/tag/binary-search/), [*Tree*](https://leetcode.com/tag/tree/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/delete-node-in-a-linked-list/) | [237. Delete Node in a Linked List](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/DeleteNodeInALinkedList.java) | :green_circle:*Easy* | [*Linked List*](https://leetcode.com/tag/linked-list/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/first-bad-version/) | [278. First Bad Version](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/FirstBadVersion.java) | :green_circle:*Easy* | [*Binary Search*](https://leetcode.com/tag/binary-search/), [*Interactive*](https://leetcode.com/tag/interactive/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/longest-increasing-subsequence/) | [300. Longest Increasing Subsequence](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/LongestIncreasingSubsequence.java) | :orange_circle:*Medium* | [*Array*](https://leetcode.com/tag/array/), [*Binary Search*](https://leetcode.com/tag/binary-search/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/find-mode-in-binary-search-tree/) | [501. Find Mode in Binary Search Tree](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/FindModeInBinarySearchTree.java) | :green_circle:*Easy* | [*Tree*](https://leetcode.com/tag/tree/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/fibonacci-number/) | [509. Fibonacci Number](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/FibonacciNumber.java) | :green_circle:*Easy* | [*Math*](https://leetcode.com/tag/math/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/), [*Recursion*](https://leetcode.com/tag/recursion/), [*Memoization*](https://leetcode.com/tag/memoization/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/coin-change-ii/) | [518. Coin Change II](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/CoinChangeII.java) | :orange_circle:*Medium* | [*Array*](https://leetcode.com/tag/array/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/) | [559. Maximum Depth of N-ary Tree](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/MaximumDepthOfNaryTree.java) | :green_circle:*Easy* | [*Depth-first Search*](https://leetcode.com/tag/depth-first-search/), [*Breadth-first Search*](https://leetcode.com/tag/breadth-first-search/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/cut-off-trees-for-golf-event/) | [675. Cut Off Trees for Golf Event](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/CutOffTreesForGolfEvent.java) | :red_circle:*Hard* | [*Breadth-first Search*](https://leetcode.com/tag/breadth-first-search/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/search-in-a-binary-search-tree/) | [700. Search in a Binary Search Tree](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/SearchInABinarySearchTree.java) | :green_circle:*Easy* | [*Tree*](https://leetcode.com/tag/tree/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/insert-into-a-binary-search-tree/) | [701. Insert into a Binary Search Tree](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/InsertIntoABinarySearchTree.java) | :orange_circle:*Medium* | [*Tree*](https://leetcode.com/tag/tree/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/binary-search/) | [704. Binary Search](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/BinarySearch.java) | :green_circle:*Easy* | [*Array*](https://leetcode.com/tag/array/), [*Binary Search*](https://leetcode.com/tag/binary-search/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/min-cost-climbing-stairs/) | [746. Min Cost Climbing Stairs](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/MinCostClimbingStairs.java) | :green_circle:*Easy* | [*Array*](https://leetcode.com/tag/array/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/range-sum-of-bst/) | [938. Range Sum of BST](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/RangeSumOfBST.java) | :green_circle:*Easy* | [*Tree*](https://leetcode.com/tag/tree/), [*Recursion*](https://leetcode.com/tag/recursion/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/prison-cells-after-n-days/) | [957. Prison Cells After N Days](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/PrisonCellsAfterNDays.java) | :orange_circle:*Medium* | [*Hash Table*](https://leetcode.com/tag/hash-table/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/find-the-town-judge/) | [997. Find the Town Judge](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/FindTheTownJudge.java) | :green_circle:*Easy* | [*Graph*](https://leetcode.com/tag/graph/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/n-th-tribonacci-number/) | [1137. N-th Tribonacci Number](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/NthTribonacciNumber.java) | :green_circle:*Easy* | [*Math*](https://leetcode.com/tag/math/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/), [*Memoization*](https://leetcode.com/tag/memoization/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/longest-common-subsequence/) | [1143. Longest Common Subsequence](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/LongestCommonSubsequence.java) | :orange_circle:*Medium* | [*String*](https://leetcode.com/tag/string/), [*Dynamic Programming*](https://leetcode.com/tag/dynamic-programming/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/split-a-string-in-balanced-strings/) | [1221. Split a String in Balanced Strings](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/SplitAStringInBalancedStrings.java) | :green_circle:*Easy* | [*String*](https://leetcode.com/tag/string/), [*Greedy*](https://leetcode.com/tag/greedy/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/problems/maximum-units-on-a-truck/) | [1710. Maximum Units on a Truck](https://github.com/cenkc/algorithms/blob/main/leetcode/src/algorithms/MaxUnitsOnATruck.java) | :green_circle:*Easy* | [*Greedy*](https://leetcode.com/tag/greedy/), [*Sort*](https://leetcode.com/tag/sort/) | Problem Set / Algorithms |
| [*LeetCode*](https://leetcode.com/discuss/interview-question/347457) | [TreasureIsland](https://github.com/cenkc/algorithms/blob/main/leetcode/src/interviewquestions/amazon/TreasureIsland.java) |  | [*Depth-first Search*](https://leetcode.com/tag/depth-first-search/), [*Breadth-first Search*](https://leetcode.com/tag/breadth-first-search/) | Interview Question / Amazon |
| [*LeetCode*](https://leetcode.com/discuss/interview-question/347457) | [TreasureIslandCenk](https://github.com/cenkc/algorithms/blob/main/leetcode/src/interviewquestions/amazon/TreasureIslandCenk.java) |  | [*Depth-first Search*](https://leetcode.com/tag/depth-first-search/), [*Breadth-first Search*](https://leetcode.com/tag/breadth-first-search/) | Interview Question / Amazon |

## [Codility](https://www.codility.com/)
| PROBLEM DESCR. | SOLUTION | DIFFICULTY | RELATED TOPICS | ADDITIONAL INFO |
|---:|:---|:---|:---|:---|
| [*Codility*](https://app.codility.com/programmers/lessons/1-iterations/binary_gap/) | [Binary Gap](https://github.com/cenkc/algorithms/blob/main/codility/src/lessons/iterations/BinaryGap.java) | :green_circle:*Easy* | [*Iterations*](https://app.codility.com/programmers/lessons/1-iterations/) | Lessons / 1 - Iterations |
| [*Codility*](https://app.codility.com/programmers/lessons/2-arrays/cyclic_rotation/) | [Cyclic Rotation](https://github.com/cenkc/algorithms/blob/main/codility/src/lessons/arrays/CyclicRotation.java) | :green_circle:*Easy* | [*Arrays*](https://app.codility.com/programmers/lessons/2-arrays/) | Lessons / 2 - Arrays |
| [*Codility*](https://app.codility.com/programmers/lessons/2-arrays/odd_occurrences_in_array/) | [Odd Occurrences In Array](https://github.com/cenkc/algorithms/blob/main/codility/src/lessons/arrays/OddOccurrencesInArray.java) | :green_circle:*Easy* | [*Arrays*](https://app.codility.com/programmers/lessons/2-arrays/) | Lessons / 2 - Arrays |
| [*Codility*](https://app.codility.com/programmers/lessons/3-time_complexity/frog_jmp/) | [Frog Jump (FrogJmp)](https://github.com/cenkc/algorithms/blob/main/codility/src/lessons/timecomplexity/FrogJmp.java) | :green_circle:*Easy* | [*Time Complexity*](https://app.codility.com/programmers/lessons/3-time_complexity/) | Lessons / 3 - Time Complexity |
| [*Codility*](https://app.codility.com/programmers/lessons/3-time_complexity/perm_missing_elem/) | [Permutation Missing Element (PermMissingElem)](https://github.com/cenkc/algorithms/blob/main/codility/src/lessons/timecomplexity/PermMissingElem.java) | :green_circle:*Easy* | [*Time Complexity*](https://app.codility.com/programmers/lessons/3-time_complexity/) | Lessons / 3 - Time Complexity |
| [*Codility*](https://app.codility.com/programmers/lessons/3-time_complexity/tape_equilibrium/) | [Tape Equilibrium (TapeEquilibrium)](https://github.com/cenkc/algorithms/blob/main/codility/src/lessons/timecomplexity/TapeEquilibrium.java) | :green_circle:*Easy* | [*Time Complexity*](https://app.codility.com/programmers/lessons/3-time_complexity/) | Lessons / 3 - Time Complexity |
| [*Codility*](https://app.codility.com/programmers/lessons/7-stacks_and_queues/brackets/) | [Brackets](https://github.com/cenkc/algorithms/blob/main/codility/src/lessons/stacksandqueues/Brackets.java) | :green_circle:*Easy* | [*Stacks and Queues*](https://app.codility.com/programmers/lessons/7-stacks_and_queues/) | Lessons / 7 - Stacks and Queues |
| [*Codility*](https://app.codility.com/programmers/lessons/7-stacks_and_queues/fish/) | [Fish](https://github.com/cenkc/algorithms/blob/main/codility/src/lessons/stacksandqueues/Fish.java) | :green_circle:*Easy* | [*Stacks and Queues*](https://app.codility.com/programmers/lessons/7-stacks_and_queues/) | Lessons / 7 - Stacks and Queues |
| [*Codility*](https://app.codility.com/programmers/lessons/7-stacks_and_queues/nesting/) | [Nesting](https://github.com/cenkc/algorithms/blob/main/codility/src/lessons/stacksandqueues/Nesting.java) | :green_circle:*Easy* | [*Stacks and Queues*](https://app.codility.com/programmers/lessons/7-stacks_and_queues/) | Lessons / 7 - Stacks and Queues |

## [HackerRank](https://www.hackerrank.com/)
| PROBLEM DESCR. | SOLUTION | DIFFICULTY | RELATED TOPICS | ADDITIONAL INFO |
|---:|:---|:---|:---|:---|
| [*HackerRank*](https://www.hackerrank.com/challenges/2d-array/problem) | [2D Array - DS](https://github.com/cenkc/algorithms/blob/main/hackerrank/src/datastructures/arrays/TwoDArrayDS.java) | :green_circle:*Easy* | [*Array*](https://www.hackerrank.com/domains/data-structures/arrays) | Data Structures / Arrays |
| [*HackerRank*](https://www.hackerrank.com/challenges/sock-merchant/problem) | [Sales by Match](https://github.com/cenkc/algorithms/blob/main/hackerrank/src/algorithms/implementation/SalesByMatch.java) | :green_circle:*Easy* | [*Array*](https://www.hackerrank.com/domains/data-structures/arrays) | Algorithms / Implementation |
| [*HackerRank*](https://www.hackerrank.com/challenges/minimum-absolute-difference-in-an-array/problem) | [Minimum Absolute Difference in an Array](https://github.com/cenkc/algorithms/blob/main/hackerrank/src/algorithms/greedy/MinAbsDiffInAnArray.java) | :green_circle:*Easy* | [*Greedy*](https://www.hackerrank.com/domains/algorithms/greedy) | Algorithms / Greedy |

## [CTCI - Cracking The Coding Interview](https://www.amazon.com/Cracking-Coding-Interview-Programming-Questions/dp/0984782850)
| PROBLEM DESCR. | SOLUTION | DIFFICULTY | RELATED TOPICS | ADDITIONAL INFO |
|---:|:---|:---|:---|:---|
| [*CTCI*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2001.%20Arrays%20and%20Strings/Q1_01_Is_Unique) | [C1Q1 - IsUniqueChars](https://github.com/cenkc/algorithms/blob/main/ctci/src/arraysandstrings/HasAllUniqueChars.java) | :green_circle:*Easy* | [*Arrays and Strings*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2001.%20Arrays%20and%20Strings) | Data Structures / Arrays |
| [*CTCI*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2001.%20Arrays%20and%20Strings/Q1_02_Check_Permutation) | [C1Q4 - Anagram](https://github.com/cenkc/algorithms/blob/main/ctci/src/arraysandstrings/Anagram.java) | :green_circle:*Easy* | [*Arrays and Strings*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2001.%20Arrays%20and%20Strings) | Data Structures / Arrays |
| [*CTCI*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2001.%20Arrays%20and%20Strings/Q1_07_Rotate_Matrix) | [C1Q7 - RotateMatrix](https://github.com/cenkc/algorithms/blob/main/ctci/src/arraysandstrings/ZeroMatrix.java) | :green_circle:*Easy* | [*Arrays and Strings*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2001.%20Arrays%20and%20Strings) | Data Structures / Arrays |
| [*CTCI*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2001.%20Arrays%20and%20Strings/Q1_08_Zero_Matrix) | [C1Q8 - ZeroMatrix](https://github.com/cenkc/algorithms/blob/main/ctci/src/arraysandstrings/ZeroMatrix.java) | :green_circle:*Easy* | [*Arrays and Strings*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2001.%20Arrays%20and%20Strings) | Data Structures / Arrays |
| [*CTCI*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2002.%20Linked%20Lists/Q2_01_Remove_Dups) | [C2Q1 - RemoveDups](https://github.com/cenkc/algorithms/blob/main/ctci/src/linkedlists/RemoveDups.java) | :green_circle:*Easy* | [*Linked Lists*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2002.%20Linked%20Lists) | Data Structures / LinkedLists |
| [*CTCI*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2002.%20Linked%20Lists/Q2_02_Return_Kth_To_Last) | [C2Q2 - ReturnKthToLast](https://github.com/cenkc/algorithms/blob/main/ctci/src/linkedlists/ReturnKthToLast.java) | :green_circle:*Easy* | [*Linked Lists*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2002.%20Linked%20Lists) | Data Structures / LinkedLists |
| [*CTCI*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2008.%20Recursion%20and%20Dynamic%20Programming/Q8_01_Triple_Step) | [C8Q1 - TripleStep](https://github.com/cenkc/algorithms/blob/main/ctci/src/dynamicprogramming/TripleStep.java) | :green_circle:*Easy* | [*Dynamic Programming*](https://github.com/careercup/CtCI-6th-Edition/tree/master/Java/Ch%2008.%20Recursion%20and%20Dynamic%20Programming) | Algorithms / Dynamic Programming |

## Miscellaneous
| PROBLEM DESCR. | SOLUTION                                                                                                                                                                         | DIFFICULTY | RELATED TOPICS | ADDITIONAL INFO                    |
|---:|:---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:---|:---|:-----------------------------------|
| [*Misc*](https://www.youtube.com/watch?v=MK-NZ4hN7rs&t=2000s) | [Longest substring length with K distinct characters](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/slidingwindows/LongestSubstrLenWithKDistinctChars.java)  | :green_circle:*Easy* | [*Sliding Window*](https://leetcode.com/tag/sliding-window/) | Algorithms / Sliding Window        |
| [*Misc*](https://www.youtube.com/watch?v=MK-NZ4hN7rs&t=505s) | [Maximum Sum Of Contiguous SubArray Of Fixed Size K](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/slidingwindows/MaxSumOfContiguousSubArrOfFixedSizeK.java) | :green_circle:*Easy* | [*Sliding Window*](https://leetcode.com/tag/sliding-window/) | Algorithms / Sliding Window        |
| [*Misc*](https://www.youtube.com/watch?v=MK-NZ4hN7rs&t=1490s) | [Smallest subarray with given sum](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/slidingwindows/SmallestSubArrWithGivenSum.java)                             | :green_circle:*Easy* | [*Sliding Window*](https://leetcode.com/tag/sliding-window/) | Algorithms / Sliding Window        |
| [*Misc*](https://en.wikipedia.org/wiki/Bubble_sort) | [Bubble Sort](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/sorting/BubbleSort.java)                                                                         | :green_circle:*Easy* | [*Sorting*](https://github.com/cenkc/algorithms/wiki/Sorting) | Algorithms / Sorting               |
| [*Misc*](https://en.wikipedia.org/wiki/Insertion_sort) | [Insertion Sort](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/sorting/InsertionSort.java)                                                                   | :green_circle:*Easy* | [*Sorting*](https://github.com/cenkc/algorithms/wiki/Sorting) | Algorithms / Sorting               |
| [*Misc*](https://en.wikipedia.org/wiki/Merge_sort) | [Merge Sort](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/sorting/MergeSort.java)                                                                           | :green_circle:*Easy* | [*Sorting*](https://github.com/cenkc/algorithms/wiki/Sorting) | Algorithms / Sorting               |
| [*Misc*](https://en.wikipedia.org/wiki/Quicksort) | [Quick Sort](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/sorting/QuickSort.java)                                                                           | :green_circle:*Easy* | [*Sorting*](https://github.com/cenkc/algorithms/wiki/Sorting) | Algorithms / Sorting               |
| [*Misc*](https://en.wikipedia.org/wiki/Selection_sort) | [Selection Sort](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/sorting/SelectionSort.java)                                                                   | :green_circle:*Easy* | [*Sorting*](https://github.com/cenkc/algorithms/wiki/Sorting) | Algorithms / Sorting               |
| [*Misc*](https://en.wikipedia.org/wiki/Selection_sort) | [Sorted Array](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/study/SortArray.java)                                                                           | :green_circle:*Easy* | [*Sorting*](https://github.com/cenkc/algorithms/wiki/Sorting) | Algorithms / Sorting               |
| [*Misc*](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm) | [Dijkstra's Algorithm](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/shortestpath/Dijkstra.java)                                                             | :green_circle:*Easy* | [*Shortest Path*](https://github.com/cenkc/algorithms/wiki/Shortest-Path) | Algorithms / Shortest Path         |
| [*Misc*](https://en.wikipedia.org/wiki/Prim%27s_algorithm) | [Prim's Algorithm](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/mst/PrimMST.java) | :green_circle:*Easy* | [*Minimum Spanning Tree - MST*](https://github.com/cenkc/algorithms/wiki/Minimum-Spanning-Tree---MST) | Algorithms / Minimum Spanning Tree - MST |
| [*Misc*](https://en.wikipedia.org/wiki/Binary_tree) | [Binary Tree From Sorted Array](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/study/BinaryTreeFromSortedArray.java)                                          | :green_circle:*Easy* | [*Binary Tree*](https://github.com/cenkc/algorithms/wiki/Sorting) | Algorithms / Study                 |
| [*Misc*](https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)) | [Lru Cache Impl.](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/study/LruCache.java)                                                                         | :green_circle:*Easy* | [*Lru Cache*]() | Algorithms / Study                 |
| [*Misc*](https://en.wikipedia.org/wiki/Linked_list) | [Reverse LinkedList](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/study/ReverseLinkedList.java)                                                             | :green_circle:*Easy* | [*Linked List*](https://github.com/cenkc/algorithms/wiki/Linked-List) | Algorithms / Study                 |
| [*Misc*](https://gist.github.com/cenkc/9a9155da530de5c1c898446f29e5d643) | [Biggest Two Digit Value String Fragment](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/assessments/BiggestTwoDigitValueStringFragment.java)                 | :green_circle:*Easy* |  | Algorithms / Assessments           |
| [*Misc*](https://gist.github.com/cenkc/9a9155da530de5c1c898446f29e5d643) | [Min Num Of Letters Must Be Deleted](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/assessments/MinNumOfLettersMustBeDeleted.java)                            | :orange_circle:*Medium* |  | Algorithms / Assessments           |
| [*Misc*](https://gist.github.com/cenkc/9a9155da530de5c1c898446f29e5d643) | [Chain Divided Into Three Smaller Chains](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/assessments/ChainDividedIntoThreeSmallerChains.java)                 | :orange_circle:*Medium* |  | Algorithms / Assessments           |
| [*Misc*](https://en.wikipedia.org/wiki/Knapsack_problem#0-1_knapsack_problem) | [0/1 Knapsack Problem](https://github.com/cenkc/algorithms/blob/main/misc/src/algorithms/study/KnapsackZeroOne.java)                                                             | :orange_circle:*Medium* | [*Dynamic Programming*](https://github.com/cenkc/algorithms/wiki/Dynamic-Programming) | Problem Set / Algorithms           |

algorithms

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README