Skip to content

Commit 2353a7c

Browse files
javadevjavadev
authored
Updated tags
1 parent 69e8051 commit 2353a7c

File tree

102 files changed

+326
-300
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

102 files changed

+326
-300
lines changed

Diff for: ‎README.md

+201-201

Diff for: ‎src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0001_two_sum
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
4-
// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays
4+
// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
55
// #2023_07_03_Time_202_ms_(91.18%)_Space_38.1_MB_(76.07%)
66

77
class Solution {

Diff for: ‎src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0002_add_two_numbers
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
44
// #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
5-
// #2023_07_03_Time_203_ms_(96.13%)_Space_41_MB_(77.03%)
5+
// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2023_07_03_Time_203_ms_(96.13%)_Space_41_MB_(77.03%)
66

77
import com_github_leetcode.ListNode
88

Diff for: ‎src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0003_longest_substring_without_repeating_characters
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
44
// #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings
5-
// #2023_07_03_Time_201_ms_(87.28%)_Space_38.3_MB_(60.85%)
5+
// #Big_O_Time_O(n)_Space_O(1) #2023_07_03_Time_201_ms_(87.28%)_Space_38.3_MB_(60.85%)
66

77
class Solution {
88
fun lengthOfLongestSubstring(s: String): Int {

Diff for: ‎src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt

+1-1
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-
// #2023_07_03_Time_293_ms_(75.96%)_Space_47.5_MB_(64.85%)
4+
// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2023_07_03_Time_293_ms_(75.96%)_Space_47.5_MB_(64.85%)
55

66
class Solution {
77
fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double {

Diff for: ‎src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0005_longest_palindromic_substring
22

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
5-
// #Dynamic_Programming_I_Day_17 #Udemy_Strings
5+
// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
66
// #2023_07_03_Time_162_ms_(99.00%)_Space_36.6_MB_(79.10%)
77

88
class Solution {

Diff for: ‎src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package g0001_0100.s0010_regular_expression_matching
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion
4-
// #Udemy_Dynamic_Programming #2023_07_03_Time_171_ms_(85.26%)_Space_34.6_MB_(94.74%)
4+
// #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
5+
// #2023_07_03_Time_171_ms_(85.26%)_Space_34.6_MB_(94.74%)
56

67
class Solution {
78
fun isMatch(s: String, p: String): Boolean {

Diff for: ‎src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package g0001_0100.s0011_container_with_most_water
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
4-
// #Algorithm_II_Day_4_Two_Pointers #2023_07_03_Time_402_ms_(78.57%)_Space_52.1_MB_(77.51%)
4+
// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
5+
// #2023_07_03_Time_402_ms_(78.57%)_Space_52.1_MB_(77.51%)
56

67
class Solution {
78
fun maxArea(height: IntArray): Int {

Diff for: ‎src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt

+1-1
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-
// #2023_07_03_Time_493_ms_(93.45%)_Space_53_MB_(93.97%)
5+
// #Big_O_Time_O(n^2)_Space_O(1) #2023_07_03_Time_493_ms_(93.45%)_Space_53_MB_(93.97%)
66

77
class Solution {
88
fun threeSum(nums: IntArray): List<List<Int>> {

Diff for: ‎src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt

+1-1
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-
// #2023_07_03_Time_155_ms_(95.24%)_Space_34.9_MB_(96.34%)
5+
// #Big_O_Time_O(4^n)_Space_O(n) #2023_07_03_Time_155_ms_(95.24%)_Space_34.9_MB_(96.34%)
66

77
class Solution {
88
fun letterCombinations(digits: String): List<String> {

Diff for: ‎src/main/kotlin/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
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
4-
// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List
4+
// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L)
55
// #2023_07_03_Time_144_ms_(96.28%)_Space_34.5_MB_(76.50%)
66

77
import com_github_leetcode.ListNode

Diff for: ‎src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0020_valid_parentheses
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack
4-
// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings
4+
// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
55
// #2023_07_03_Time_137_ms_(88.76%)_Space_33.7_MB_(90.45%)
66

77
class Solution {

Diff for: ‎src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0021_merge_two_sorted_lists
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
44
// #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
5-
// #Level_1_Day_3_Linked_List #Udemy_Linked_List
5+
// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n)
66
// #2023_07_03_Time_157_ms_(92.24%)_Space_35.7_MB_(68.58%)
77

88
import com_github_leetcode.ListNode

Diff for: ‎src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0022_generate_parentheses
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
44
// #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #2023_07_03_Time_161_ms_(85.45%)_Space_37.3_MB_(66.18%)
5+
// #Big_O_Time_O(2^n)_Space_O(n) #2023_07_03_Time_161_ms_(85.45%)_Space_37.3_MB_(66.18%)
66

77
class Solution {
88
fun generateParenthesis(n: Int): List<String> {

Diff for: ‎src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package g0001_0100.s0023_merge_k_sorted_lists
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List
4-
// #Divide_and_Conquer #Merge_Sort #2023_07_03_Time_198_ms_(93.77%)_Space_37.6_MB_(97.03%)
4+
// #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k))
5+
// #2023_07_03_Time_198_ms_(93.77%)_Space_37.6_MB_(97.03%)
56

67
import com_github_leetcode.ListNode
78

Diff for: ‎src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package g0001_0100.s0024_swap_nodes_in_pairs
22

33
// #Medium #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_12_Linked_List
4-
// #Udemy_Linked_List #2023_07_03_Time_149_ms_(44.20%)_Space_33.5_MB_(98.90%)
4+
// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
5+
// #2023_07_03_Time_149_ms_(44.20%)_Space_33.5_MB_(98.90%)
56

67
import com_github_leetcode.ListNode
78

Diff for: ‎src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package g0001_0100.s0025_reverse_nodes_in_k_group
22

33
// #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List
4-
// #Udemy_Linked_List #2023_07_03_Time_189_ms_(67.03%)_Space_36.7_MB_(71.43%)
4+
// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k)
5+
// #2023_07_03_Time_189_ms_(67.03%)_Space_36.7_MB_(71.43%)
56

67
import com_github_leetcode.ListNode
78

Diff for: ‎src/main/kotlin/g0001_0100/s0031_next_permutation/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0001_0100.s0031_next_permutation
22

3-
// #Medium #Top_100_Liked_Questions #Array #Two_Pointers
3+
// #Medium #Top_100_Liked_Questions #Array #Two_Pointers #Big_O_Time_O(n)_Space_O(1)
44
// #2023_07_05_Time_205_ms_(48.21%)_Space_36.6_MB_(87.50%)
55

66
class Solution {

Diff for: ‎src/main/kotlin/g0001_0100/s0032_longest_valid_parentheses/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0001_0100.s0032_longest_valid_parentheses
22

3-
// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming #Stack
3+
// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming #Stack #Big_O_Time_O(n)_Space_O(1)
44
// #2023_07_05_Time_161_ms_(82.14%)_Space_36.3_MB_(91.07%)
55

66
class Solution {

Diff for: ‎src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ package g0001_0100.s0033_search_in_rotated_sorted_array
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
44
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search
5-
// #Udemy_Binary_Search #2023_07_05_Time_151_ms_(93.77%)_Space_34.5_MB_(94.08%)
5+
// #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
6+
// #2023_07_05_Time_151_ms_(93.77%)_Space_34.5_MB_(94.08%)
67

78
class Solution {
89
fun search(nums: IntArray, target: Int): Int {

Diff for: ‎src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
4-
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5
4+
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1)
55
// #2023_07_05_Time_174_ms_(100.00%)_Space_37.8_MB_(71.70%)
66

77
class Solution constructor() {

Diff for: ‎src/main/kotlin/g0001_0100/s0035_search_insert_position/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package g0001_0100.s0035_search_insert_position
22

33
// #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
4-
// #Binary_Search_I_Day_2 #2023_07_05_Time_159_ms_(93.03%)_Space_36.7_MB_(95.90%)
4+
// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1)
5+
// #2023_07_05_Time_159_ms_(93.03%)_Space_36.7_MB_(95.90%)
56

67
class Solution {
78
fun searchInsert(nums: IntArray, target: Int): Int {

Diff for: ‎src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0039_combination_sum
22

33
// #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking
44
// #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion
5-
// #2023_07_05_Time_226_ms_(88.89%)_Space_38.1_MB_(94.95%)
5+
// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2023_07_05_Time_226_ms_(88.89%)_Space_38.1_MB_(94.95%)
66

77
class Solution {
88
fun combinationSum(candidates: IntArray, target: Int): List<List<Int>> {

Diff for: ‎src/main/kotlin/g0001_0100/s0041_first_missing_positive/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0041_first_missing_positive
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Udemy_Arrays
4-
// #2023_07_05_Time_357_ms_(97.17%)_Space_50.7_MB_(90.57%)
4+
// #Big_O_Time_O(n)_Space_O(n) #2023_07_05_Time_357_ms_(97.17%)_Space_50.7_MB_(90.57%)
55

66
class Solution {
77
fun firstMissingPositive(nums: IntArray): Int {

Diff for: ‎src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0042_trapping_rain_water
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Two_Pointers
44
// #Stack #Monotonic_Stack #Dynamic_Programming_I_Day_9 #Udemy_Two_Pointers
5-
// #2023_07_05_Time_189_ms_(99.37%)_Space_39.4_MB_(81.90%)
5+
// #Big_O_Time_O(n)_Space_O(1) #2023_07_05_Time_189_ms_(99.37%)_Space_39.4_MB_(81.90%)
66

77
class Solution {
88
fun trap(height: IntArray): Int {

Diff for: ‎src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0045_jump_game_ii
22

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy
44
// #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4
5-
// #2023_07_05_Time_208_ms_(93.37%)_Space_38.2_MB_(94.48%)
5+
// #Big_O_Time_O(n)_Space_O(1) #2023_07_05_Time_208_ms_(93.37%)_Space_38.2_MB_(94.48%)
66

77
class Solution {
88
fun jump(nums: IntArray): Int {

Diff for: ‎src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ package g0001_0100.s0046_permutations
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Backtracking
44
// #Algorithm_I_Day_11_Recursion_Backtracking #Level_2_Day_20_Brute_Force/Backtracking
5-
// #Udemy_Backtracking/Recursion #2023_07_05_Time_188_ms_(99.00%)_Space_37.4_MB_(88.94%)
5+
// #Udemy_Backtracking/Recursion #Big_O_Time_O(n*n!)_Space_O(n+n!)
6+
// #2023_07_05_Time_188_ms_(99.00%)_Space_37.4_MB_(88.94%)
67

78
class Solution {
89
fun permute(nums: IntArray): List<List<Int>> {

Diff for: ‎src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0048_rotate_image
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Matrix
44
// #Data_Structure_II_Day_3_Array #Programming_Skills_II_Day_7 #Udemy_2D_Arrays/Matrix
5-
// #2023_07_05_Time_160_ms_(90.11%)_Space_35_MB_(84.07%)
5+
// #Big_O_Time_O(n^2)_Space_O(1) #2023_07_05_Time_160_ms_(90.11%)_Space_35_MB_(84.07%)
66

77
class Solution {
88
fun rotate(matrix: Array<IntArray>) {

Diff for: ‎src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0049_group_anagrams
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #String #Hash_Table #Sorting
44
// #Data_Structure_II_Day_8_String #Programming_Skills_II_Day_11 #Udemy_Strings
5-
// #2023_07_05_Time_308_ms_(96.34%)_Space_43.3_MB_(81.41%)
5+
// #Big_O_Time_O(n*k_log_k)_Space_O(n) #2023_07_05_Time_308_ms_(96.34%)_Space_43.3_MB_(81.41%)
66

77
class Solution {
88
fun groupAnagrams(strs: Array<String>): List<List<String>> {

Diff for: ‎src/main/kotlin/g0001_0100/s0051_n_queens/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0001_0100.s0051_n_queens
22

3-
// #Hard #Top_100_Liked_Questions #Array #Backtracking
3+
// #Hard #Top_100_Liked_Questions #Array #Backtracking #Big_O_Time_O(N!)_Space_O(N)
44
// #2023_07_10_Time_192_ms_(90.74%)_Space_37.8_MB_(88.89%)
55

66
class Solution {

Diff for: ‎src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ package g0001_0100.s0053_maximum_subarray
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
44
// #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
5-
// #Udemy_Famous_Algorithm #2023_07_10_Time_510_ms_(78.81%)_Space_54.7_MB_(69.00%)
5+
// #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1)
6+
// #2023_07_10_Time_510_ms_(78.81%)_Space_54.7_MB_(69.00%)
67

78
class Solution {
89
fun maxSubArray(nums: IntArray): Int {

Diff for: ‎src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0055_jump_game
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Greedy
44
// #Algorithm_II_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_4 #Udemy_Arrays
5-
// #2023_07_10_Time_332_ms_(89.35%)_Space_39_MB_(96.44%)
5+
// #Big_O_Time_O(n)_Space_O(1) #2023_07_10_Time_332_ms_(89.35%)_Space_39_MB_(96.44%)
66

77
class Solution {
88
fun canJump(nums: IntArray): Boolean {

Diff for: ‎src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0056_merge_intervals
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting
44
// #Data_Structure_II_Day_2_Array #Level_2_Day_17_Interval #Udemy_2D_Arrays/Matrix
5-
// #2023_07_10_Time_334_ms_(80.67%)_Space_43.7_MB_(78.81%)
5+
// #Big_O_Time_O(n_log_n)_Space_O(n) #2023_07_10_Time_334_ms_(80.67%)_Space_43.7_MB_(78.81%)
66

77
class Solution {
88
fun merge(intervals: Array<IntArray>): Array<IntArray> {

Diff for: ‎src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ package g0001_0100.s0062_unique_paths
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math
44
// #Combinatorics #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_15
5-
// #Level_1_Day_11_Dynamic_Programming #2023_07_10_Time_118_ms_(94.65%)_Space_33_MB_(81.62%)
5+
// #Level_1_Day_11_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
6+
// #2023_07_10_Time_118_ms_(94.65%)_Space_33_MB_(81.62%)
67

78
class Solution {
89
fun uniquePaths(m: Int, n: Int): Int {

Diff for: ‎src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0064_minimum_path_sum
22

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
4-
// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming
4+
// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
55
// #2023_07_10_Time_164_ms_(100.00%)_Space_37.3_MB_(84.71%)
66

77
class Solution {

Diff for: ‎src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0070_climbing_stairs
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math #Memoization
44
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_2
5-
// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming
5+
// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n)
66
// #2023_07_10_Time_124_ms_(71.98%)_Space_33.2_MB_(48.60%)
77

88
class Solution {

Diff for: ‎src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ package g0001_0100.s0072_edit_distance
22

33
// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming
44
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
5-
// #Udemy_Dynamic_Programming #2023_07_10_Time_182_ms_(92.16%)_Space_36.2_MB_(98.04%)
5+
// #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2)
6+
// #2023_07_10_Time_182_ms_(92.16%)_Space_36.2_MB_(98.04%)
67

78
class Solution {
89
fun minDistance(word1: String, word2: String): Int {

Diff for: ‎src/main/kotlin/g0001_0100/s0073_set_matrix_zeroes/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
package g0001_0100.s0073_set_matrix_zeroes
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix
4-
// #Udemy_2D_Arrays/Matrix #2023_07_10_Time_248_ms_(97.33%)_Space_41.6_MB_(79.87%)
4+
// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1)
5+
// #2023_07_10_Time_248_ms_(97.33%)_Space_41.6_MB_(79.87%)
56

67
class Solution {
78
// Approach: Use first row and first column for storing whether in future

Diff for: ‎src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ package g0001_0100.s0074_search_a_2d_matrix
22

33
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array
44
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search
5-
// #Udemy_2D_Arrays/Matrix #2023_07_10_Time_159_ms_(74.46%)_Space_35.1_MB_(74.89%)
5+
// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1)
6+
// #2023_07_10_Time_159_ms_(74.46%)_Space_35.1_MB_(74.89%)
67

78
class Solution {
89
fun searchMatrix(matrix: Array<IntArray>, target: Int): Boolean {

Diff for: ‎src/main/kotlin/g0001_0100/s0075_sort_colors/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0075_sort_colors
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
4-
// #Data_Structure_II_Day_2_Array #Udemy_Arrays
4+
// #Data_Structure_II_Day_2_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
55
// #2023_07_10_Time_164_ms_(64.43%)_Space_34.4_MB_(84.54%)
66

77
class Solution {

Diff for: ‎src/main/kotlin/g0001_0100/s0076_minimum_window_substring/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0076_minimum_window_substring
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
4-
// #Level_2_Day_14_Sliding_Window/Two_Pointer
4+
// #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1)
55
// #2023_07_10_Time_191_ms_(96.38%)_Space_37.2_MB_(93.33%)
66

77
class Solution {

Diff for: ‎src/main/kotlin/g0001_0100/s0078_subsets/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ package g0001_0100.s0078_subsets
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation #Backtracking
44
// #Algorithm_II_Day_9_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #2023_07_10_Time_171_ms_(94.92%)_Space_35.8_MB_(96.09%)
5+
// #Big_O_Time_O(2^n)_Space_O(n*2^n) #2023_07_10_Time_171_ms_(94.92%)_Space_35.8_MB_(96.09%)
66

77
class Solution {
88
fun subsets(nums: IntArray): List<List<Int>> {

Diff for: ‎src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0079_word_search
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking
4-
// #Algorithm_II_Day_11_Recursion_Backtracking
4+
// #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n)
55
// #2023_07_10_Time_392_ms_(72.92%)_Space_34.7_MB_(83.33%)
66

77
class Solution {

Diff for: ‎src/main/kotlin/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.kt

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0084_largest_rectangle_in_histogram
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Stack #Monotonic_Stack
4-
// #2023_07_10_Time_476_ms_(90.79%)_Space_51.8_MB_(84.21%)
4+
// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2023_07_10_Time_476_ms_(90.79%)_Space_51.8_MB_(84.21%)
55

66
import kotlin.math.max
77

0 commit comments

Comments
 (0)