Skip to content

Commit 31adf14

Browse files
javadevjavadev
authored
Updated readme
1 parent d9daf2c commit 31adf14

File tree

12 files changed

+62
-4
lines changed

12 files changed

+62
-4
lines changed

‎README.md‎

Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -73,6 +73,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
7373

7474
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
7575
|-|-|-|-|-|-
76+
| 0019 |[Remove Nth Node From End of List](src/main/scala/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 492 | 52.63
7677

7778
#### Day 6 Sliding Window
7879

@@ -99,6 +100,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
99100

100101
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
101102
|-|-|-|-|-|-
103+
| 0021 |[Merge Two Sorted Lists](src/main/scala/g0001_0100/s0021_merge_two_sorted_lists/Solution.scala)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 480 | 89.72
102104

103105
#### Day 11 Recursion Backtracking
104106

@@ -136,11 +138,13 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
136138

137139
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
138140
|-|-|-|-|-|-
141+
| 0015 |[3Sum](src/main/scala/g0001_0100/s0015_3sum/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 721 | 95.24
139142

140143
#### Day 4 Two Pointers
141144

142145
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
143146
|-|-|-|-|-|-
147+
| 0011 |[Container With Most Water](src/main/scala/g0001_0100/s0011_container_with_most_water/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 683 | 99.13
144148

145149
#### Day 5 Sliding Window
146150

@@ -176,6 +180,8 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
176180

177181
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
178182
|-|-|-|-|-|-
183+
| 0017 |[Letter Combinations of a Phone Number](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 459 | 58.54
184+
| 0022 |[Generate Parentheses](src/main/scala/g0001_0100/s0022_generate_parentheses/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 380 | 100.00
179185

180186
#### Day 12 Dynamic Programming
181187

@@ -191,6 +197,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
191197

192198
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
193199
|-|-|-|-|-|-
200+
| 0005 |[Longest Palindromic Substring](src/main/scala/g0001_0100/s0005_longest_palindromic_substring/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 502 | 87.65
194201

195202
#### Day 15 Dynamic Programming
196203

@@ -477,6 +484,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
477484

478485
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
479486
|-|-|-|-|-|-
487+
| 0005 |[Longest Palindromic Substring](src/main/scala/g0001_0100/s0005_longest_palindromic_substring/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 502 | 87.65
480488

481489
#### Day 18
482490

@@ -803,6 +811,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
803811

804812
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
805813
|-|-|-|-|-|-
814+
| 0021 |[Merge Two Sorted Lists](src/main/scala/g0001_0100/s0021_merge_two_sorted_lists/Solution.scala)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 480 | 89.72
806815

807816
#### Day 4 Linked List
808817

@@ -881,6 +890,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
881890

882891
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
883892
|-|-|-|-|-|-
893+
| 0019 |[Remove Nth Node From End of List](src/main/scala/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 492 | 52.63
884894

885895
#### Day 4 Linked List
886896

@@ -980,6 +990,8 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
980990
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
981991
|-|-|-|-|-|-
982992
| 0003 |[Longest Substring Without Repeating Characters](src/main/scala/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 482 | 96.91
993+
| 0020 |[Valid Parentheses](src/main/scala/g0001_0100/s0020_valid_parentheses/Solution.scala)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 449 | 65.58
994+
| 0005 |[Longest Palindromic Substring](src/main/scala/g0001_0100/s0005_longest_palindromic_substring/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 502 | 87.65
983995

984996
#### Udemy Binary Search
985997

@@ -996,6 +1008,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
9961008

9971009
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
9981010
|-|-|-|-|-|-
1011+
| 0015 |[3Sum](src/main/scala/g0001_0100/s0015_3sum/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 721 | 95.24
9991012

10001013
#### Udemy Famous Algorithm
10011014

@@ -1016,6 +1029,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
10161029

10171030
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10181031
|-|-|-|-|-|-
1032+
| 0021 |[Merge Two Sorted Lists](src/main/scala/g0001_0100/s0021_merge_two_sorted_lists/Solution.scala)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 480 | 89.72
10191033

10201034
#### Udemy Tree Stack Queue
10211035

@@ -1036,11 +1050,14 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
10361050

10371051
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10381052
|-|-|-|-|-|-
1053+
| 0010 |[Regular Expression Matching](src/main/scala/g0001_0100/s0010_regular_expression_matching/Solution.scala)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 459 | 75.00
10391054

10401055
#### Udemy Backtracking/Recursion
10411056

10421057
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10431058
|-|-|-|-|-|-
1059+
| 0022 |[Generate Parentheses](src/main/scala/g0001_0100/s0022_generate_parentheses/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 380 | 100.00
1060+
| 0017 |[Letter Combinations of a Phone Number](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 459 | 58.54
10441061

10451062
#### Udemy Bit Manipulation
10461063

@@ -1089,6 +1106,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
10891106

10901107
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10911108
|-|-|-|-|-|-
1109+
| 0021 |[Merge Two Sorted Lists](src/main/scala/g0001_0100/s0021_merge_two_sorted_lists/Solution.scala)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 480 | 89.72
10921110

10931111
#### Day 8 Linked List
10941112

@@ -1099,6 +1117,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
10991117

11001118
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11011119
|-|-|-|-|-|-
1120+
| 0020 |[Valid Parentheses](src/main/scala/g0001_0100/s0020_valid_parentheses/Solution.scala)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 449 | 65.58
11021121

11031122
#### Day 10 Tree
11041123

@@ -1131,6 +1150,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
11311150

11321151
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11331152
|-|-|-|-|-|-
1153+
| 0015 |[3Sum](src/main/scala/g0001_0100/s0015_3sum/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 721 | 95.24
11341154

11351155
#### Day 2 Array
11361156

@@ -1171,6 +1191,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
11711191

11721192
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11731193
|-|-|-|-|-|-
1194+
| 0005 |[Longest Palindromic Substring](src/main/scala/g0001_0100/s0005_longest_palindromic_substring/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 502 | 87.65
11741195

11751196
#### Day 10 Linked List
11761197

@@ -1237,6 +1258,16 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
12371258

12381259
| # | Title | Difficulty | Tag | Time, ms | Time, %
12391260
|------|----------------|-------------|-------------|----------|---------
1261+
| 0022 |[Generate Parentheses](src/main/scala/g0001_0100/s0022_generate_parentheses/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(2^n)_Space_O(n) | 380 | 100.00
1262+
| 0021 |[Merge Two Sorted Lists](src/main/scala/g0001_0100/s0021_merge_two_sorted_lists/Solution.scala)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(m+n)_Space_O(m+n) | 480 | 89.72
1263+
| 0020 |[Valid Parentheses](src/main/scala/g0001_0100/s0020_valid_parentheses/Solution.scala)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 449 | 65.58
1264+
| 0019 |[Remove Nth Node From End of List](src/main/scala/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers, Level_2_Day_3_Linked_List, Big_O_Time_O(L)_Space_O(L) | 492 | 52.63
1265+
| 0017 |[Letter Combinations of a Phone Number](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(4^n)_Space_O(n) | 459 | 58.54
1266+
| 0015 |[3Sum](src/main/scala/g0001_0100/s0015_3sum/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_1_Array, Algorithm_II_Day_3_Two_Pointers, Udemy_Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 721 | 95.24
1267+
| 0011 |[Container With Most Water](src/main/scala/g0001_0100/s0011_container_with_most_water/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Algorithm_II_Day_4_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 683 | 99.13
1268+
| 0010 |[Regular Expression Matching](src/main/scala/g0001_0100/s0010_regular_expression_matching/Solution.scala)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion, Udemy_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(m\*n) | 459 | 75.00
1269+
| 0005 |[Longest Palindromic Substring](src/main/scala/g0001_0100/s0005_longest_palindromic_substring/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Data_Structure_II_Day_9_String, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_17, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 502 | 87.65
1270+
| 0004 |[Median of Two Sorted Arrays](src/main/scala/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.scala)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Big_O_Time_O(log(min(N,M)))_Space_O(1) | 644 | 80.82
12401271
| 0003 |[Longest Substring Without Repeating Characters](src/main/scala/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Algorithm_I_Day_6_Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Udemy_Strings, Big_O_Time_O(n)_Space_O(1) | 482 | 96.91
12411272
| 0002 |[Add Two Numbers](src/main/scala/g0001_0100/s0002_add_two_numbers/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Data_Structure_II_Day_10_Linked_List, Programming_Skills_II_Day_15, Big_O_Time_O(max(N,M))_Space_O(max(N,M)) | 571 | 75.12
12421273
| 0001 |[Two Sum](src/main/scala/g0001_0100/s0001_two_sum/Solution.scala)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Data_Structure_I_Day_2_Array, Level_1_Day_13_Hashmap, Udemy_Arrays, Big_O_Time_O(n)_Space_O(n) | 517 | 86.66

‎src/main/scala/g0001_0100/s0002_add_two_numbers/Solution.scala‎

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -7,6 +7,13 @@ import com_github_leetcode.ListNode
77
// #Big_O_Time_O(max(N,M))_Space_O(max(N,M))
88
// #2023_10_17_Time_571_ms_(75.12%)_Space_58.8_MB_(68.16%)
99

10+
/*
11+
* Definition for singly-linked list.
12+
* class ListNode(_x: Int = 0, _next: ListNode = null) {
13+
* var next: ListNode = _next
14+
* var x: Int = _x
15+
* }
16+
*/
1017
object Solution {
1118
def addTwoNumbers(l1: ListNode, l2: ListNode): ListNode = {
1219
val dummyHead = new ListNode(0)

‎src/main/scala/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.scala‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0004_median_of_two_sorted_arrays
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
4-
// #Big_O_Time_O(log(min(N,M)))_Space_O(1)
4+
// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2023_10_29_Time_644_ms_(80.82%)_Space_57.9_MB_(91.78%)
55

66
object Solution {
77
@SuppressWarnings(Array("scala:S3776"))

‎src/main/scala/g0001_0100/s0005_longest_palindromic_substring/Solution.scala‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -3,6 +3,7 @@ package g0001_0100.s0005_longest_palindromic_substring
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
44
// #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming
55
// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
6+
// #2023_10_29_Time_502_ms_(87.65%)_Space_54.1_MB_(100.00%)
67

78
object Solution {
89
def longestPalindrome(s: String): String = {

‎src/main/scala/g0001_0100/s0010_regular_expression_matching/Solution.scala‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@ package g0001_0100.s0010_regular_expression_matching
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion
44
// #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
5+
// #2023_10_29_Time_459_ms_(75.00%)_Space_54.4_MB_(100.00%)
56

67
object Solution {
78
private var cache: Array[Array[Option[Boolean]]] = Array.ofDim[Option[Boolean]](0, 0)

‎src/main/scala/g0001_0100/s0011_container_with_most_water/Solution.scala‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@ package g0001_0100.s0011_container_with_most_water
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
44
// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
5+
// #2023_10_29_Time_683_ms_(99.13%)_Space_76.3_MB_(73.04%)
56

67
object Solution {
78
def maxArea(height: Array[Int]): Int = {

‎src/main/scala/g0001_0100/s0015_3sum/Solution.scala‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0015_3sum
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
44
// #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers
5-
// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2023_10_29_Time_701_ms_(98.81%)_Space_66.7_MB_(88.10%)
5+
// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2023_10_29_Time_721_ms_(95.24%)_Space_66.4_MB_(91.67%)
66

77
object Solution {
88
@SuppressWarnings(Array("scala:S3776"))

‎src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.scala‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0017_letter_combinations_of_a_phone_number
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking
44
// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #Big_O_Time_O(4^n)_Space_O(n)
5+
// #Big_O_Time_O(4^n)_Space_O(n) #2023_10_29_Time_459_ms_(58.54%)_Space_54_MB_(92.68%)
66

77
import scala.collection.mutable.ListBuffer
88

‎src/main/scala/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.scala‎

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,9 +2,17 @@ package g0001_0100.s0019_remove_nth_node_from_end_of_list
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List
44
// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L)
5+
// #2023_10_29_Time_492_ms_(52.63%)_Space_57_MB_(50.88%)
56

67
import com_github_leetcode.ListNode
78

9+
/*
10+
* Definition for singly-linked list.
11+
* class ListNode(_x: Int = 0, _next: ListNode = null) {
12+
* var next: ListNode = _next
13+
* var x: Int = _x
14+
* }
15+
*/
816
object Solution {
917
private var n: Int = 0
1018

‎src/main/scala/g0001_0100/s0020_valid_parentheses/Solution.scala‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@ package g0001_0100.s0020_valid_parentheses
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack
44
// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
5+
// #2023_10_29_Time_449_ms_(65.58%)_Space_56.6_MB_(22.33%)
56

67
import scala.collection.mutable.Stack
78

0 commit comments

Comments
 (0)