Skip to content

Commit 4492d3c

Browse files
javadevjavadev
authored
Improved tags
1 parent 04d9bb3 commit 4492d3c

File tree

82 files changed

+422
-398
lines changed

Some content is hidden

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

82 files changed

+422
-398
lines changed

‎README.md‎

Lines changed: 264 additions & 264 deletions

‎src/main/ts/g0001_0100/s0001_two_sum/solution.ts‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
11
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
2-
// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
2+
// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap
3+
// #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task
34
// #2023_09_28_Time_54_ms_(91.72%)_Space_45.5_MB_(22.26%)
45

56
function twoSum(nums: number[], target: number): number[] {

‎src/main/ts/g0001_0100/s0002_add_two_numbers/solution.ts‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
22
// #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
3-
// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2023_09_28_Time_92_ms_(77.86%)_Space_48_MB_(69.29%)
3+
// #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M))
4+
// #AI_can_be_used_to_solve_the_task #2023_09_28_Time_92_ms_(77.86%)_Space_48_MB_(69.29%)
45

56
import { ListNode } from '../../com_github_leetcode/listnode'
67

‎src/main/ts/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.ts‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
22
// #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings
3-
// #Big_O_Time_O(n)_Space_O(1) #2023_09_28_Time_65_ms_(90.77%)_Space_44.9_MB_(95.29%)
3+
// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
4+
// #2023_09_28_Time_65_ms_(90.77%)_Space_44.9_MB_(95.29%)
45

56
function lengthOfLongestSubstring(s: string): number {
67
const lastIndices: number[] = new Array(256).fill(-1)

‎src/main/ts/g0001_0100/s0004_median_of_two_sorted_arrays/solution.ts‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
11
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
2-
// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2023_08_26_Time_86_ms_(92.15%)_Space_48.3_MB_(59.73%)
2+
// #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1)
3+
// #AI_can_be_used_to_solve_the_task #2023_08_26_Time_86_ms_(92.15%)_Space_48.3_MB_(59.73%)
34

45
function findMedianSortedArrays(nums1: number[], nums2: number[]): number {
56
const nums = nums1.concat(nums2)

‎src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
22
// #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming
3-
// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
4-
// #2023_09_28_Time_68_ms_(95.34%)_Space_44.5_MB_(96.58%)
3+
// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP
4+
// #Big_O_Time_O(n)_Space_O(n) #2023_09_28_Time_68_ms_(95.34%)_Space_44.5_MB_(96.58%)
55

66
function longestPalindrome(s: string): string {
77
const newStr: string[] = new Array(s.length * 2 + 1)

‎src/main/ts/g0001_0100/s0006_zigzag_conversion/solution.ts‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,5 @@
1-
// #Medium #String #2023_08_26_Time_64_ms_(95.38%)_Space_47.3_MB_(64.49%)
1+
// #Medium #String #Top_Interview_150_Array/String
2+
// #2023_08_26_Time_64_ms_(95.38%)_Space_47.3_MB_(64.49%)
23

34
function convert(s: string, numRows: number): string {
45
if (numRows < 2) {

‎src/main/ts/g0001_0100/s0009_palindrome_number/solution.ts‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,5 @@
1-
// #Easy #Math #Udemy_Integers #2023_08_25_Time_137_ms_(88.64%)_Space_50.5_MB_(99.43%)
1+
// #Easy #Math #Udemy_Integers #Top_Interview_150_Math
2+
// #2023_08_25_Time_137_ms_(88.64%)_Space_50.5_MB_(99.43%)
23

34
function isPalindrome(x: number): boolean {
45
if (x < 0) {

‎src/main/ts/g0001_0100/s0010_regular_expression_matching/solution.ts‎

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
1-
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion
2-
// #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
3-
// #2023_08_25_Time_69_ms_(92.65%)_Space_45.9_MB_(50.61%)
1+
// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming
2+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2023_08_25_Time_69_ms_(92.65%)_Space_45.9_MB_(50.61%)
43

54
function isMatch(s: string, p: string): boolean { // NOSONAR
65
const result = new Array(s.length + 1)

‎src/main/ts/g0001_0100/s0011_container_with_most_water/solution.ts‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
2-
// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
2+
// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
33
// #2023_08_28_Time_57_ms_(98.23%)_Space_50.9_MB_(84.15%)
44

55
function maxArea(height: number[]): number {

0 commit comments

Comments
 (0)