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 a00b92f

Browse files
authored
Updated tag #Top_100_Liked_Questions
1 parent 5bf7235 commit a00b92f

File tree

10 files changed

+37
-35
lines changed

10 files changed

+37
-35
lines changed

‎README.md‎

Lines changed: 16 additions & 16 deletions
Large diffs are not rendered by default.

‎src/main/kotlin/g0001_0100/s0013_roman_to_integer/Solution.kt‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0013_roman_to_integer
22

3-
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Math
4-
// #Top_Interview_150_Array/String #2023_07_03_Time_211_ms_(83.47%)_Space_36.9_MB_(91.66%)
3+
// #Easy #Top_Interview_Questions #String #Hash_Table #Math #Top_Interview_150_Array/String
4+
// #2023_07_03_Time_211_ms_(83.47%)_Space_36.9_MB_(91.66%)
55

66
class Solution {
77
fun romanToInt(s: String): Int {

‎src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt‎

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
package g0001_0100.s0014_longest_common_prefix
22

3-
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Level_2_Day_2_String
4-
// #Udemy_Strings #Top_Interview_150_Array/String
5-
// #2023_07_03_Time_154_ms_(89.70%)_Space_34.6_MB_(95.06%)
3+
// #Easy #Top_Interview_Questions #String #Level_2_Day_2_String #Udemy_Strings
4+
// #Top_Interview_150_Array/String #2023_07_03_Time_154_ms_(89.70%)_Space_34.6_MB_(95.06%)
65

76
class Solution {
87
fun longestCommonPrefix(strs: Array<String>): String {

‎src/main/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.kt‎

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,9 @@
11
package g0101_0200.s0108_convert_sorted_array_to_binary_search_tree
22

3-
// #Easy #Top_Interview_Questions #Array #Tree #Binary_Tree #Binary_Search_Tree #Divide_and_Conquer
4-
// #Data_Structure_II_Day_15_Tree #Level_2_Day_9_Binary_Search_Tree #Udemy_Tree_Stack_Queue
5-
// #Top_Interview_150_Divide_and_Conquer #2023_07_11_Time_167_ms_(80.29%)_Space_36.6_MB_(83.94%)
3+
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Tree #Binary_Tree
4+
// #Binary_Search_Tree #Divide_and_Conquer #Data_Structure_II_Day_15_Tree
5+
// #Level_2_Day_9_Binary_Search_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Divide_and_Conquer
6+
// #2023_07_11_Time_167_ms_(80.29%)_Space_36.6_MB_(83.94%)
67

78
import com_github_leetcode.TreeNode
89

‎src/main/kotlin/g0201_0300/s0279_perfect_squares/Solution.kt‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0201_0300.s0279_perfect_squares
22

3-
// #Medium #Dynamic_Programming #Math #Breadth_First_Search #Dynamic_Programming_I_Day_21
4-
// #2022_11_03_Time_176_ms_(98.80%)_Space_33.3_MB_(98.80%)
3+
// #Medium #Top_100_Liked_Questions #Dynamic_Programming #Math #Breadth_First_Search
4+
// #Dynamic_Programming_I_Day_21 #2022_11_03_Time_176_ms_(98.80%)_Space_33.3_MB_(98.80%)
55

66
@Suppress("NAME_SHADOWING")
77
class Solution {

‎src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt‎

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package g0401_0500.s0437_path_sum_iii
22

3-
// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree
4-
// #Big_O_Time_O(n)_Space_O(n) #2022_09_11_Time_403_ms_(54.12%)_Space_41.7_MB_(62.35%)
3+
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
4+
// #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
5+
// #2022_09_11_Time_403_ms_(54.12%)_Space_41.7_MB_(62.35%)
56

67
import com_github_leetcode.TreeNode
78

‎src/main/kotlin/g0501_0600/s0567_permutation_in_string/Solution.kt‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0501_0600.s0567_permutation_in_string
22

3-
// #Medium #Top_100_Liked_Questions #String #Hash_Table #Two_Pointers #Sliding_Window
4-
// #Algorithm_I_Day_6_Sliding_Window #2023_01_23_Time_169_ms_(100.00%)_Space_35.6_MB_(85.86%)
3+
// #Medium #String #Hash_Table #Two_Pointers #Sliding_Window #Algorithm_I_Day_6_Sliding_Window
4+
// #2023_01_23_Time_169_ms_(100.00%)_Space_35.6_MB_(85.86%)
55

66
class Solution {
77
fun checkInclusion(s1: String, s2: String): Boolean {

‎src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0701_0800.s0704_binary_search
22

3-
// #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
4-
// #Binary_Search_I_Day_1 #Level_1_Day_7_Binary_Search #Udemy_Binary_Search
3+
// #Easy #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search #Binary_Search_I_Day_1
4+
// #Level_1_Day_7_Binary_Search #Udemy_Binary_Search
55
// #2023_02_23_Time_261_ms_(77.91%)_Space_38.7_MB_(34.19%)
66

77
class Solution {

‎src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt‎

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package g0701_0800.s0763_partition_labels
22

3-
// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String
4-
// #Big_O_Time_O(n)_Space_O(1) #2022_09_13_Time_235_ms_(84.75%)_Space_35.2_MB_(91.53%)
3+
// #Medium #Top_100_Liked_Questions #String #Hash_Table #Greedy #Two_Pointers
4+
// #Data_Structure_II_Day_7_String #Big_O_Time_O(n)_Space_O(1)
5+
// #2022_09_13_Time_235_ms_(84.75%)_Space_35.2_MB_(91.53%)
56

67
class Solution {
78
fun partitionLabels(s: String): List<Int> {

‎src/main/kotlin/g3501_3600/s3585_find_weighted_median_node_in_tree/Solution.kt‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g3501_3600.s3585_find_weighted_median_node_in_tree
22

3-
// #Hard #Array #Dynamic_Programming #Tree #Binary_Search #Depth_First_Search
3+
// #Hard #Array #Dynamic_Programming #Depth_First_Search #Tree #Binary_Search
44
// #2025_06_17_Time_123_ms_(100.00%)_Space_184.68_MB_(100.00%)
55

66
import kotlin.math.ceil

0 commit comments

Comments
(0)

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