Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 2e58160

Browse files
[README][Problem 1123]Lowest Common Ancestor of Deepest Leaves
1 parent e229149 commit 2e58160

File tree

1 file changed

+2
-1
lines changed

1 file changed

+2
-1
lines changed

‎README.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -193,8 +193,9 @@ kotlin . this repository contains three major folders [easy - medium - hard] bas
193193
- [2115. Find All Possible Recipes from Given Supplies](src/medium/FindAllPossibleRecipesFromGivenSupplies2115.kt) - [Leetcode link](https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/description) `Array` `BFS` `DFS` `Hash Set`
194194
- [3169. Count Days Without Meetings](src/medium/CountDaysWithoutMeetings3169.kt) - [Leetcode link](https://leetcode.com/problems/count-days-without-meetings/description) `Array` `BFS` `DFS` `Hash Set`
195195
- [2033. Minimum Operations to Make a Uni-Value Grid](src/medium/MinimumOperationsToMakeUniValueGrid2033.kt) - [Leetcode link](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/description) `Array` `Math` `Sorting` `Matrix`
196+
- [1123. Lowest Common Ancestor of Deepest Leaves](src/medium/LowestCommonAncestorOfDeepestLeaves1123.kt) - [Leetcode link](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/description/) `Array` `Math` `Sorting` `Matrix`
196197
## Hard Problems:
197198
- [76. Minimum Window Substring](src/hard/MinimumWindowSubstring76.kt)
198199
- [2290. Minimum Obstacle Removal to Reach Corner](src/hard/MinimumObstacleRemovalToReachCorner2290.kt)[Leetcode link](https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner/) `Array` `Breadth-First-Search` `Graph` `Heap(Priority Queue)` `Matrix` `Shortest Path`
199200
- [2493. Divide Nodes Into the Maximum Number of Groups](src/hard/DivideNodesIntoTheMaximumNumberOfGroups2493.kt)[Leetcode link](https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/description/) `Array` `Breadth-First-Search` `Graph` `Heap(Priority Queue)` `Matrix` `Shortest Path`
200-
- [2503. Maximum Number of Points From Grid Queries](src/hard/MaximumNumberOfPointsFromGridQueries2503.kt) - [Leetcode link](https://leetcode.com/problems/maximum-number-of-points-from-grid-queries/description) `Array` `BFS` `Sorting``Matrix``Heap (Priority Queue)`
201+
- [2503. Maximum Number of Points From Grid Queries](src/hard/MaximumNumberOfPointsFromGridQueries2503.kt) - [Leetcode link](https://leetcode.com/problems/maximum-number-of-points-from-grid-queries/description) `DFS` `BFS` `Tree``Hash Table`

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /