Skip to content

Commit 731b681

Browse files
committed
Updated readme
1 parent 6f91b88 commit 731b681

File tree

7 files changed

+23
-2
lines changed

7 files changed

+23
-2
lines changed

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1589,8 +1589,8 @@
15891589

15901590
## Algorithms
15911591

1592-
| # | Title | Difficulty | Tag | Time, ms | Time, %
1593-
|------|----------------|-------------|-------------|----------|--------
1592+
| # | Title | Language | Difficulty | Tag | Time, ms | Time, %
1593+
|------|----------------|-----------|-------------|-------------|----------|---------
15941594
| 1143 |Longest Common Subsequence| [Java](src/main/java/g1101_1200/s1143_longest_common_subsequence) [Kotlin](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence) [TypeScript](src/main/ts/g1101_1200/s1143_longest_common_subsequence) [Scala](src/main/scala/g1101_1200/s1143_longest_common_subsequence) [Ruby](src/main/ruby/g1101_1200/s1143_longest_common_subsequence) [PHP](src/main/php/g1101_1200/s1143_longest_common_subsequence) [C#](src/main/csharp/g1101_1200/s1143_longest_common_subsequence) [Go](src/main/go/g1101_1200/s1143_longest_common_subsequence) [Cpp](src/main/cpp/g1101_1200/s1143_longest_common_subsequence) [Python](src/main/python/g1101_1200/s1143_longest_common_subsequence) [Swift](src/main/swift/g1101_1200/s1143_longest_common_subsequence) [Elixir](src/main/elixir/g1101_1200/s1143_longest_common_subsequence) [Rust](src/main/rust/g1101_1200/s1143_longest_common_subsequence) [Dart](src/main/dart/g1101_1200/s1143_longest_common_subsequence) [C](src/main/c/g1101_1200/s1143_longest_common_subsequence) [JavaScript](src/main/js/g1101_1200/s1143_longest_common_subsequence) [Erlang](src/main/erlang/g1101_1200/s1143_longest_common_subsequence) [Racket](src/main/racket/g1101_1200/s1143_longest_common_subsequence)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05
15951595
| 0763 |Partition Labels| [Java](src/main/java/g0701_0800/s0763_partition_labels) [Kotlin](src/main/kotlin/g0701_0800/s0763_partition_labels) [TypeScript](src/main/ts/g0701_0800/s0763_partition_labels) [Scala](src/main/scala/g0701_0800/s0763_partition_labels) [Ruby](src/main/ruby/g0701_0800/s0763_partition_labels) [PHP](src/main/php/g0701_0800/s0763_partition_labels) [C#](src/main/csharp/g0701_0800/s0763_partition_labels) [Go](src/main/go/g0701_0800/s0763_partition_labels) [Cpp](src/main/cpp/g0701_0800/s0763_partition_labels) [Python](src/main/python/g0701_0800/s0763_partition_labels) [Swift](src/main/swift/g0701_0800/s0763_partition_labels) [Elixir](src/main/elixir/g0701_0800/s0763_partition_labels) [Rust](src/main/rust/g0701_0800/s0763_partition_labels) [Dart](src/main/dart/g0701_0800/s0763_partition_labels) [C](src/main/c/g0701_0800/s0763_partition_labels) [JavaScript](src/main/js/g0701_0800/s0763_partition_labels) [Erlang](src/main/erlang/g0701_0800/s0763_partition_labels) [Racket](src/main/racket/g0701_0800/s0763_partition_labels)| Medium | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Data_Structure_II_Day_7_String, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00
15961596
| 0739 |Daily Temperatures| [Java](src/main/java/g0701_0800/s0739_daily_temperatures) [Kotlin](src/main/kotlin/g0701_0800/s0739_daily_temperatures) [TypeScript](src/main/ts/g0701_0800/s0739_daily_temperatures) [Scala](src/main/scala/g0701_0800/s0739_daily_temperatures) [Ruby](src/main/ruby/g0701_0800/s0739_daily_temperatures) [PHP](src/main/php/g0701_0800/s0739_daily_temperatures) [C#](src/main/csharp/g0701_0800/s0739_daily_temperatures) [Go](src/main/go/g0701_0800/s0739_daily_temperatures) [Cpp](src/main/cpp/g0701_0800/s0739_daily_temperatures) [Python](src/main/python/g0701_0800/s0739_daily_temperatures) [Swift](src/main/swift/g0701_0800/s0739_daily_temperatures) [Elixir](src/main/elixir/g0701_0800/s0739_daily_temperatures) [Rust](src/main/rust/g0701_0800/s0739_daily_temperatures) [Dart](src/main/dart/g0701_0800/s0739_daily_temperatures) [C](src/main/c/g0701_0800/s0739_daily_temperatures) [JavaScript](src/main/js/g0701_0800/s0739_daily_temperatures) [Erlang](src/main/erlang/g0701_0800/s0739_daily_temperatures) [Racket](src/main/racket/g0701_0800/s0739_daily_temperatures)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Programming_Skills_II_Day_6, Big_O_Time_O(n)_Space_O(n) | 8 | 96.83

favicon.ico

12.4 KB
Binary file not shown.

src/main/python/g0401_0500/s0416_partition_equal_subset_sum/readme.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -31,6 +31,8 @@ Given a **non-empty** array `nums` containing **only positive integers**, find i
3131
## Solution
3232

3333
```python
34+
from typing import List
35+
3436
class Solution:
3537
def canPartition(self, nums: List[int]) -> bool:
3638
sums = sum(nums)

src/main/python/g0401_0500/s0437_path_sum_iii/readme.md

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -34,6 +34,14 @@ The path does not need to start or end at the root or a leaf, but it must go dow
3434
## Solution
3535

3636
```python
37+
from typing import Optional
38+
39+
class TreeNode:
40+
def __init__(self, val=0, left=None, right=None):
41+
self.val = val
42+
self.left = left
43+
self.right = right
44+
3745
# Definition for a binary tree node.
3846
# class TreeNode:
3947
# def __init__(self, val=0, left=None, right=None):

src/main/python/g0401_0500/s0438_find_all_anagrams_in_a_string/readme.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -40,6 +40,7 @@ An **Anagram** is a word or phrase formed by rearranging the letters of a differ
4040
## Solution
4141

4242
```python
43+
from typing import List
4344
from collections import defaultdict
4445

4546
class Solution:

src/main/python/g0401_0500/s0494_target_sum/readme.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -44,6 +44,8 @@ Return the number of different **expressions** that you can build, which evaluat
4444
## Solution
4545

4646
```python
47+
from typing import List
48+
4749
class Solution:
4850
def findTargetSumWays(self, nums: List[int], target: int) -> int:
4951
total_sum = sum(nums)

src/main/python/g0501_0600/s0543_diameter_of_binary_tree/readme.md

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -35,6 +35,14 @@ The **length** of a path between two nodes is represented by the number of edges
3535
## Solution
3636

3737
```python
38+
from typing import Optional
39+
40+
class TreeNode:
41+
def __init__(self, val=0, left=None, right=None):
42+
self.val = val
43+
self.left = left
44+
self.right = right
45+
3846
# Definition for a binary tree node.
3947
# class TreeNode:
4048
# def __init__(self, val=0, left=None, right=None):

0 commit comments

Comments
 (0)