Skip to content
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

Improved tags #749

Merged
merged 1 commit into from
Jan 30, 2025
Merged

Improved tags #749

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
2 changes: 1 addition & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1937,7 +1937,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.33'

| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
|-|-|-|-|-|-
| 0052 |[N-Queens II](src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt)| Hard | Backtracking | 128 | 97.56
| 0053 |[Maximum Subarray](src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 510 | 78.81
| 0918 |[Maximum Sum Circular Subarray](src/main/kotlin/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.kt)| Medium | Array, Dynamic_Programming, Divide_and_Conquer, Queue, Monotonic_Queue | 339 | 86.96

#### Top Interview 150 Binary Search
Expand Down
2 changes: 1 addition & 1 deletion src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0001_0100.s0052_n_queens_ii

// #Hard #Backtracking #Top_Interview_150_Backtracking #Top_Interview_150_Kadane's_Algorithm
// #Hard #Backtracking #Top_Interview_150_Backtracking
// #2023_07_10_Time_128_ms_(97.56%)_Space_32.7_MB_(92.68%)

class Solution {
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
Expand Up @@ -2,7 +2,7 @@ package g0001_0100.s0053_maximum_subarray

// #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)
// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1)
// #2023_07_10_Time_510_ms_(78.81%)_Space_54.7_MB_(69.00%)

class Solution {
Expand Down
2 changes: 1 addition & 1 deletion ...1_3500/s3423_maximum_difference_between_adjacent_elements_in_a_circular_array/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g3401_3500.s3423_maximum_difference_between_adjacent_elements_in_a_circular_array

// #Easy #2025_01_19_Time_2_(100.00%)_Space_38.80_(100.00%)
// #Easy #Array #2025_01_19_Time_2_(100.00%)_Space_38.80_(100.00%)

import kotlin.math.abs
import kotlin.math.max
Expand Down
3 changes: 2 additions & 1 deletion src/main/kotlin/g3401_3500/s3425_longest_special_path/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
package g3401_3500.s3425_longest_special_path

// #Hard #2025_01_19_Time_106_(100.00%)_Space_187.68_(100.00%)
// #Hard #Array #Hash_Table #Depth_First_Search #Tree #Sliding_Window
// #2025_01_19_Time_106_(100.00%)_Space_187.68_(100.00%)

class Solution {
private lateinit var adj: Array<ArrayList<IntArray>>
Expand Down
2 changes: 1 addition & 1 deletion ...ain/kotlin/g3401_3500/s3426_manhattan_distances_of_all_arrangements_of_pieces/Solution.kt
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g3401_3500.s3426_manhattan_distances_of_all_arrangements_of_pieces

// #Hard #2025_01_19_Time_21_(100.00%)_Space_34.61_(100.00%)
// #Hard #Math #Combinatorics #2025_01_19_Time_21_(100.00%)_Space_34.61_(100.00%)

class Solution {
private fun comb(a: Long, b: Long, mod: Long): Long {
Expand Down