Skip to content

Revised tags "Difficulty", "Top 100 Liked Questions" and "Top Interview Questions" #609

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Mar 18, 2024
Merged

Revised tags "Difficulty", "Top 100 Liked Questions" and "Top Interview Questions" #609

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
158 changes: 79 additions & 79 deletions README.md
View file
Open in desktop

Large diffs are not rendered by default.

5 changes: 2 additions & 3 deletions src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,7 @@
package g0001_0100.s0010_regular_expression_matching

// #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)
// #2023_07_03_Time_171_ms_(85.26%)_Space_34.6_MB_(94.74%)
// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming
// #Big_O_Time_O(m*n)_Space_O(m*n) #2023_07_03_Time_171_ms_(85.26%)_Space_34.6_MB_(94.74%)

class Solution {
fun isMatch(s: String, p: String): Boolean {
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0001_0100/s0013_roman_to_integer/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0001_0100.s0013_roman_to_integer

// #Easy #Top_Interview_Questions #String #Hash_Table #Math
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Math
// #2023_07_03_Time_211_ms_(83.47%)_Space_36.9_MB_(91.66%)

class Solution {
Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0001_0100.s0014_longest_common_prefix

// #Easy #Top_Interview_Questions #String #Level_2_Day_2_String #Udemy_Strings
// #2023_07_03_Time_154_ms_(89.70%)_Space_34.6_MB_(95.06%)
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Level_2_Day_2_String
// #Udemy_Strings #2023_07_03_Time_154_ms_(89.70%)_Space_34.6_MB_(95.06%)

class Solution {
fun longestCommonPrefix(strs: Array<String>): String {
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0001_0100.s0053_maximum_subarray

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
// #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
// #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1)
// #2023_07_10_Time_510_ms_(78.81%)_Space_54.7_MB_(69.00%)
Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0001_0100/s0054_spiral_matrix/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0001_0100.s0054_spiral_matrix

// #Medium #Top_Interview_Questions #Array #Matrix #Simulation #Programming_Skills_II_Day_8
// #Level_2_Day_1_Implementation/Simulation #Udemy_2D_Arrays/Matrix
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Simulation
// #Programming_Skills_II_Day_8 #Level_2_Day_1_Implementation/Simulation #Udemy_2D_Arrays/Matrix
// #2023_07_10_Time_132_ms_(95.12%)_Space_33.5_MB_(93.17%)

class Solution {
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0001_0100.s0072_edit_distance

// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
// #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2)
// #2023_07_10_Time_182_ms_(92.16%)_Space_36.2_MB_(98.04%)
Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0001_0100.s0096_unique_binary_search_trees

// #Medium #Top_100_Liked_Questions #Dynamic_Programming #Math #Tree #Binary_Tree
// #Binary_Search_Tree #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree
// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
// #2023_07_10_Time_116_ms_(92.31%)_Space_32.6_MB_(84.62%)

class Solution {
Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0101_0200/s0118_pascals_triangle/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0101_0200.s0118_pascals_triangle

// #Easy #Top_Interview_Questions #Array #Dynamic_Programming #Data_Structure_I_Day_4_Array
// #Dynamic_Programming_I_Day_12 #Udemy_Dynamic_Programming
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
// #Data_Structure_I_Day_4_Array #Dynamic_Programming_I_Day_12 #Udemy_Dynamic_Programming
// #2022_10_08_Time_277_ms_(33.22%)_Space_34.2_MB_(90.60%)

class Solution {
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0101_0200.s0155_min_stack

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design
// #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design
// #Udemy_Design #Big_O_Time_O(1)_Space_O(N)
// #2022_09_06_Time_331_ms_(84.88%)_Space_54.3_MB_(46.34%)
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0101_0200/s0164_maximum_gap/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0101_0200.s0164_maximum_gap

// #Hard #Array #Sorting #Bucket_Sort #Radix_Sort
// #Medium #Array #Sorting #Bucket_Sort #Radix_Sort
// #2022_10_11_Time_991_ms_(68.00%)_Space_77.2_MB_(88.00%)

class Solution {
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0101_0200.s0199_binary_tree_right_side_view

// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
// #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree
// #2022_09_09_Time_194_ms_(92.89%)_Space_35.4_MB_(67.89%)

Expand Down
5 changes: 2 additions & 3 deletions src/main/kotlin/g0201_0300/s0218_the_skyline_problem/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,7 @@
package g0201_0300.s0218_the_skyline_problem

// #Hard #Top_Interview_Questions #Array #Heap_Priority_Queue #Ordered_Set #Divide_and_Conquer
// #Segment_Tree #Binary_Indexed_Tree #Line_Sweep
// #2022_10_25_Time_365_ms_(93.14%)_Space_45.7_MB_(93.71%)
// #Hard #Array #Heap_Priority_Queue #Ordered_Set #Divide_and_Conquer #Segment_Tree
// #Binary_Indexed_Tree #Line_Sweep #2022_10_25_Time_365_ms_(93.14%)_Space_45.7_MB_(93.71%)

import java.util.TreeMap

Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0201_0300/s0220_contains_duplicate_iii/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0201_0300.s0220_contains_duplicate_iii

// #Medium #Array #Sorting #Sliding_Window #Ordered_Set #Bucket_Sort
// #Hard #Array #Sorting #Sliding_Window #Ordered_Set #Bucket_Sort
// #2022_10_25_Time_921_ms_(72.22%)_Space_77.4_MB_(41.67%)

class Solution {
Expand Down
5 changes: 2 additions & 3 deletions src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,7 @@
package g0201_0300.s0221_maximal_square

// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
// #Dynamic_Programming_I_Day_16 #Big_O_Time_O(m*n)_Space_O(m*n)
// #2022_09_10_Time_614_ms_(44.00%)_Space_76.2_MB_(65.33%)
// #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16
// #Big_O_Time_O(m*n)_Space_O(m*n) #2022_09_10_Time_614_ms_(44.00%)_Space_76.2_MB_(65.33%)

class Solution {
fun maximalSquare(matrix: Array<CharArray>): Int {
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0201_0300/s0227_basic_calculator_ii/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0201_0300.s0227_basic_calculator_ii

// #Medium #Top_Interview_Questions #String #Math #Stack #Level_2_Day_18_Stack
// #Medium #String #Math #Stack #Level_2_Day_18_Stack
// #2022_10_26_Time_383_ms_(62.50%)_Space_39.5_MB_(83.33%)

class Solution {
Expand Down
6 changes: 3 additions & 3 deletions src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
package g0201_0300.s0230_kth_smallest_element_in_a_bst

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
// #Binary_Search_Tree #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree
// #Big_O_Time_O(n)_Space_O(n) #2022_09_10_Time_393_ms_(33.33%)_Space_41.8_MB_(66.67%)
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n)
// #2022_09_10_Time_393_ms_(33.33%)_Space_41.8_MB_(66.67%)

import com_github_leetcode.TreeNode

Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0201_0300.s0234_palindrome_linked_list

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Stack #Linked_List
// #Recursion #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
// #Easy #Top_100_Liked_Questions #Two_Pointers #Stack #Linked_List #Recursion
// #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
// #2022_09_18_Time_641_ms_(79.53%)_Space_80.9_MB_(58.23%)

import com_github_leetcode.ListNode
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0201_0300.s0235_lowest_common_ancestor_of_a_binary_search_tree

// #Easy #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_I_Day_14_Tree
// #Medium #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_I_Day_14_Tree
// #Level_1_Day_8_Binary_Search_Tree #2022_10_26_Time_404_ms_(75.59%)_Space_46.1_MB_(78.74%)

import com_github_leetcode.TreeNode
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
// #2022_09_10_Time_386_ms_(45.21%)_Space_43.9_MB_(81.65%)

Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0201_0300/s0237_delete_node_in_a_linked_list/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0201_0300.s0237_delete_node_in_a_linked_list

// #Easy #Top_Interview_Questions #Linked_List #2022_10_27_Time_183_ms_(93.00%)_Space_35_MB_(95.19%)
// #Medium #Linked_List #2022_10_27_Time_183_ms_(93.00%)_Space_35_MB_(95.19%)

import com_github_leetcode.ListNode

Expand Down
5 changes: 2 additions & 3 deletions src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,7 @@
package g0201_0300.s0238_product_of_array_except_self

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Prefix_Sum
// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Big_O_Time_O(n^2)_Space_O(n)
// #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%)
// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays
// #Big_O_Time_O(n^2)_Space_O(n) #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%)

class Solution {
fun productExceptSelf(nums: IntArray): IntArray {
Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0201_0300/s0239_sliding_window_maximum/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0201_0300.s0239_sliding_window_maximum

// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Heap_Priority_Queue
// #Sliding_Window #Queue #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k)
// #Hard #Top_100_Liked_Questions #Array #Heap_Priority_Queue #Sliding_Window #Queue
// #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k)
// #2022_09_10_Time_1059_ms_(86.14%)_Space_113.7_MB_(65.35%)

import java.util.LinkedList
Expand Down
6 changes: 3 additions & 3 deletions src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
package g0201_0300.s0240_search_a_2d_matrix_ii

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Matrix
// #Divide_and_Conquer #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8
// #Big_O_Time_O(n+m)_Space_O(1) #2022_09_10_Time_460_ms_(66.08%)_Space_55.9_MB_(65.19%)
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Divide_and_Conquer
// #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 #Big_O_Time_O(n+m)_Space_O(1)
// #2022_09_10_Time_460_ms_(66.08%)_Space_55.9_MB_(65.19%)

class Solution {
fun searchMatrix(matrix: Array<IntArray>, target: Int): Boolean {
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0201_0300.s0242_valid_anagram

// #Easy #Top_Interview_Questions #String #Hash_Table #Sorting #Data_Structure_I_Day_6_String
// #Easy #String #Hash_Table #Sorting #Data_Structure_I_Day_6_String
// #Programming_Skills_I_Day_11_Containers_and_Libraries #Udemy_Strings
// #2022_10_27_Time_251_ms_(87.65%)_Space_39.1_MB_(69.49%)

Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0201_0300/s0268_missing_number/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0201_0300.s0268_missing_number

// #Easy #Top_Interview_Questions #Array #Hash_Table #Math #Sorting #Binary_Search #Bit_Manipulation
// #Easy #Array #Hash_Table #Math #Sorting #Binary_Search #Bit_Manipulation
// #2022_11_03_Time_380_ms_(83.49%)_Space_48.6_MB_(76.76%)

class Solution {
Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0201_0300/s0279_perfect_squares/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0201_0300.s0279_perfect_squares

// #Medium #Top_Interview_Questions #Dynamic_Programming #Math #Breadth_First_Search
// #Dynamic_Programming_I_Day_21 #2022_11_03_Time_176_ms_(98.80%)_Space_33.3_MB_(98.80%)
// #Medium #Dynamic_Programming #Math #Breadth_First_Search #Dynamic_Programming_I_Day_21
// #2022_11_03_Time_176_ms_(98.80%)_Space_33.3_MB_(98.80%)

@Suppress("NAME_SHADOWING")
class Solution {
Expand Down
6 changes: 3 additions & 3 deletions src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
package g0201_0300.s0283_move_zeroes

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Two_Pointers
// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays
// #Big_O_Time_O(n)_Space_O(1) #2022_09_10_Time_516_ms_(79.07%)_Space_64.2_MB_(36.71%)
// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
// #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
// #2022_09_10_Time_516_ms_(79.07%)_Space_64.2_MB_(36.71%)

class Solution {
fun moveZeroes(nums: IntArray) {
Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0201_0300.s0287_find_the_duplicate_number

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Two_Pointers
// #Bit_Manipulation #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation
// #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
// #2022_09_10_Time_656_ms_(66.21%)_Space_78.6_MB_(66.89%)

class Solution {
Expand Down
3 changes: 1 addition & 2 deletions src/main/kotlin/g0201_0300/s0289_game_of_life/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,6 @@
package g0201_0300.s0289_game_of_life

// #Medium #Top_Interview_Questions #Array #Matrix #Simulation
// #2022_11_04_Time_174_ms_(96.97%)_Space_34.2_MB_(93.94%)
// #Medium #Array #Matrix #Simulation #2022_11_04_Time_174_ms_(96.97%)_Space_34.2_MB_(93.94%)

class Solution {
companion object {
Expand Down
5 changes: 2 additions & 3 deletions src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,7 @@
package g0201_0300.s0295_find_median_from_data_stream

// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Design
// #Heap_Priority_Queue #Data_Stream #Big_O_Time_O(n*log_n)_Space_O(n)
// #2022_09_11_Time_2289_ms_(33.60%)_Space_153.3_MB_(5.74%)
// #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream
// #Big_O_Time_O(n*log_n)_Space_O(n) #2022_09_11_Time_2289_ms_(33.60%)_Space_153.3_MB_(5.74%)

import java.util.PriorityQueue

Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0201_0300.s0297_serialize_and_deserialize_binary_tree

// #Hard #Top_Interview_Questions #String #Depth_First_Search #Breadth_First_Search #Tree
// #Binary_Tree #Design #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
// #Hard #String #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Design
// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
// #2022_11_06_Time_475_ms_(78.85%)_Space_50.3_MB_(64.42%)

import com_github_leetcode.TreeNode
Expand Down
6 changes: 3 additions & 3 deletions src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
package g0201_0300.s0300_longest_increasing_subsequence

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
// #Binary_Search #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3
// #Dynamic_Programming_I_Day_18 #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n)
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search
// #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18
// #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n)
// #2022_09_11_Time_318_ms_(82.28%)_Space_39.2_MB_(82.77%)

class Solution {
Expand Down
5 changes: 2 additions & 3 deletions src/main/kotlin/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,7 @@
package g0301_0400.s0315_count_of_smaller_numbers_after_self

// #Hard #Top_Interview_Questions #Array #Binary_Search #Ordered_Set #Divide_and_Conquer
// #Segment_Tree #Binary_Indexed_Tree #Merge_Sort
// #2022_11_10_Time_1282_ms_(88.46%)_Space_109.8_MB_(46.15%)
// #Hard #Array #Binary_Search #Ordered_Set #Divide_and_Conquer #Segment_Tree #Binary_Indexed_Tree
// #Merge_Sort #2022_11_10_Time_1282_ms_(88.46%)_Space_109.8_MB_(46.15%)

import java.util.LinkedList

Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0301_0400.s0322_coin_change

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
// #Breadth_First_Search #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
// #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount)
// #2022_09_11_Time_332_ms_(50.68%)_Space_37.6_MB_(79.93%)

Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0301_0400/s0324_wiggle_sort_ii/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0301_0400.s0324_wiggle_sort_ii

// #Medium #Top_Interview_Questions #Array #Sorting #Divide_and_Conquer #Quickselect
// #Medium #Array #Sorting #Divide_and_Conquer #Quickselect
// #2022_11_12_Time_545_ms_(57.14%)_Space_57.1_MB_(57.14%)

class Solution {
Expand Down
3 changes: 1 addition & 2 deletions src/main/kotlin/g0301_0400/s0326_power_of_three/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,6 @@
package g0301_0400.s0326_power_of_three

// #Easy #Top_Interview_Questions #Math #Recursion
// #2022_11_12_Time_413_ms_(76.12%)_Space_40.4_MB_(47.76%)
// #Easy #Math #Recursion #2022_11_12_Time_413_ms_(76.12%)_Space_40.4_MB_(47.76%)

class Solution {
fun isPowerOfThree(n: Int): Boolean {
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0301_0400.s0328_odd_even_linked_list

// #Medium #Top_Interview_Questions #Linked_List #Level_2_Day_4_Linked_List #Udemy_Linked_List
// #Medium #Linked_List #Level_2_Day_4_Linked_List #Udemy_Linked_List
// #2022_11_12_Time_216_ms_(86.96%)_Space_36.7_MB_(85.22%)

import com_github_leetcode.ListNode
Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0301_0400/s0329_longest_increasing_path_in_a_matrix/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0301_0400.s0329_longest_increasing_path_in_a_matrix

// #Hard #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search #Breadth_First_Search
// #Graph #Memoization #Topological_Sort #2022_11_12_Time_322_ms_(92.65%)_Space_39.2_MB_(100.00%)
// #Hard #Dynamic_Programming #Depth_First_Search #Breadth_First_Search #Graph #Memoization
// #Topological_Sort #2022_11_12_Time_322_ms_(92.65%)_Space_39.2_MB_(100.00%)

class Solution {
fun longestIncreasingPath(matrix: Array<IntArray>): Int {
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0301_0400.s0334_increasing_triplet_subsequence

// #Medium #Top_Interview_Questions #Array #Greedy #Data_Structure_II_Day_5_Array
// #Medium #Array #Greedy #Data_Structure_II_Day_5_Array
// #2022_11_15_Time_672_ms_(60.61%)_Space_128.6_MB_(5.23%)

class Solution {
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0301_0400.s0338_counting_bits

// #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
// #Big_O_Time_O(num)_Space_O(num) #2022_09_27_Time_186_ms_(99.26%)_Space_38.8_MB_(89.71%)

class Solution {
Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0301_0400.s0341_flatten_nested_list_iterator

// #Medium #Top_Interview_Questions #Depth_First_Search #Tree #Stack #Design #Queue #Iterator
// #Programming_Skills_II_Day_18 #2022_11_25_Time_210_ms_(100.00%)_Space_37.6_MB_(100.00%)
// #Medium #Depth_First_Search #Tree #Stack #Design #Queue #Iterator #Programming_Skills_II_Day_18
// #2022_11_25_Time_210_ms_(100.00%)_Space_37.6_MB_(100.00%)

import com_github_leetcode.NestedInteger

Expand Down
4 changes: 2 additions & 2 deletions src/main/kotlin/g0301_0400/s0344_reverse_string/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0301_0400.s0344_reverse_string

// #Easy #Top_Interview_Questions #String #Two_Pointers #Recursion #Algorithm_I_Day_4_Two_Pointers
// #Udemy_Strings #2022_11_18_Time_445_ms_(69.75%)_Space_61.9_MB_(33.77%)
// #Easy #String #Two_Pointers #Recursion #Algorithm_I_Day_4_Two_Pointers #Udemy_Strings
// #2022_11_18_Time_445_ms_(69.75%)_Space_61.9_MB_(33.77%)

class Solution {
fun reverseString(s: CharArray) {
Expand Down
Loading
Loading