Restructure README with personal learning journey and create automated notes system
This commit is contained in:
22
src/notes/001_two_sum.md
Normal file
22
src/notes/001_two_sum.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Two Sum
|
||||
|
||||
**Problem Number:** 1
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/002_add_two_numbers.md
Normal file
22
src/notes/002_add_two_numbers.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Add Two Numbers
|
||||
|
||||
**Problem Number:** 2
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -0,0 +1,22 @@
|
||||
# Longest Substring Without Repeating Characters
|
||||
|
||||
**Problem Number:** 3
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/004_median_of_two_sorted_arrays.md
Normal file
22
src/notes/004_median_of_two_sorted_arrays.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Median of Two Sorted Arrays
|
||||
|
||||
**Problem Number:** 4
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/005_longest_palindromic_substring.md
Normal file
22
src/notes/005_longest_palindromic_substring.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Longest Palindromic Substring
|
||||
|
||||
**Problem Number:** 5
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/006_zigzag_conversion.md
Normal file
22
src/notes/006_zigzag_conversion.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Zigzag Conversion
|
||||
|
||||
**Problem Number:** 6
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/007_reverse_integer.md
Normal file
22
src/notes/007_reverse_integer.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Reverse Integer
|
||||
|
||||
**Problem Number:** 7
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/009_palindrome_number.md
Normal file
22
src/notes/009_palindrome_number.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Palindrome Number
|
||||
|
||||
**Problem Number:** 9
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/010_regular_expression_matching.md
Normal file
22
src/notes/010_regular_expression_matching.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Regular Expression Matching
|
||||
|
||||
**Problem Number:** 10
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/011_container_with_most_water.md
Normal file
22
src/notes/011_container_with_most_water.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Container With Most Water
|
||||
|
||||
**Problem Number:** 11
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/013_roman_to_integer.md
Normal file
22
src/notes/013_roman_to_integer.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Roman to Integer
|
||||
|
||||
**Problem Number:** 13
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/014_longest_common_prefix.md
Normal file
22
src/notes/014_longest_common_prefix.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Longest Common Prefix
|
||||
|
||||
**Problem Number:** 14
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/015_3sum.md
Normal file
22
src/notes/015_3sum.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# 3Sum
|
||||
|
||||
**Problem Number:** 15
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/020_valid_parentheses.md
Normal file
22
src/notes/020_valid_parentheses.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Valid Parentheses
|
||||
|
||||
**Problem Number:** 20
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/021_merge_two_sorted_lists.md
Normal file
22
src/notes/021_merge_two_sorted_lists.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Merge Two Sorted Lists
|
||||
|
||||
**Problem Number:** 21
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/022_generate_parentheses.md
Normal file
22
src/notes/022_generate_parentheses.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Generate Parentheses
|
||||
|
||||
**Problem Number:** 22
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -0,0 +1,22 @@
|
||||
# Find the Index of the First Occurrence in a String
|
||||
|
||||
**Problem Number:** 28
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/035_search_insert_position.md
Normal file
22
src/notes/035_search_insert_position.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Search Insert Position
|
||||
|
||||
**Problem Number:** 35
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/036_valid_sudoku.md
Normal file
22
src/notes/036_valid_sudoku.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Valid Sudoku
|
||||
|
||||
**Problem Number:** 36
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/042_trapping_rain_water.md
Normal file
22
src/notes/042_trapping_rain_water.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Trapping Rain Water
|
||||
|
||||
**Problem Number:** 42
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/045_jump_game_ii.md
Normal file
22
src/notes/045_jump_game_ii.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Jump Game II
|
||||
|
||||
**Problem Number:** 45
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/050_powx_n.md
Normal file
22
src/notes/050_powx_n.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Pow(x, n)
|
||||
|
||||
**Problem Number:** 50
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/055_jump_game.md
Normal file
22
src/notes/055_jump_game.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Jump Game
|
||||
|
||||
**Problem Number:** 55
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/066_plus_one.md
Normal file
22
src/notes/066_plus_one.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Plus One
|
||||
|
||||
**Problem Number:** 66
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/069_sqrtx.md
Normal file
22
src/notes/069_sqrtx.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Sqrt(x)
|
||||
|
||||
**Problem Number:** 69
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/074_search_a_2d_matrix.md
Normal file
22
src/notes/074_search_a_2d_matrix.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Search a 2D Matrix
|
||||
|
||||
**Problem Number:** 74
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/080_remove_duplicates_from_sorted_array_ii.md
Normal file
22
src/notes/080_remove_duplicates_from_sorted_array_ii.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Remove Duplicates from Sorted Array II
|
||||
|
||||
**Problem Number:** 80
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/088_merge_sorted_array.md
Normal file
22
src/notes/088_merge_sorted_array.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Merge Sorted Array
|
||||
|
||||
**Problem Number:** 88
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/089_gray_code.md
Normal file
22
src/notes/089_gray_code.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Gray Code
|
||||
|
||||
**Problem Number:** 89
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/090_subsets_ii.md
Normal file
22
src/notes/090_subsets_ii.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Subsets II
|
||||
|
||||
**Problem Number:** 90
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/091_decode_ways.md
Normal file
22
src/notes/091_decode_ways.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Decode Ways
|
||||
|
||||
**Problem Number:** 91
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/092_reverse_linked_list_ii.md
Normal file
22
src/notes/092_reverse_linked_list_ii.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Reverse Linked List II
|
||||
|
||||
**Problem Number:** 92
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/1200_minimum_absolute_difference.md
Normal file
22
src/notes/1200_minimum_absolute_difference.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Minimum Absolute Difference
|
||||
|
||||
**Problem Number:** 1200
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/121_best_time_to_buy_and_sell_stock.md
Normal file
22
src/notes/121_best_time_to_buy_and_sell_stock.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Best Time to Buy and Sell Stock
|
||||
|
||||
**Problem Number:** 121
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/122_best_time_to_buy_and_sell_stock_ii.md
Normal file
22
src/notes/122_best_time_to_buy_and_sell_stock_ii.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Best Time to Buy and Sell Stock II
|
||||
|
||||
**Problem Number:** 122
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/125_valid_palindrome.md
Normal file
22
src/notes/125_valid_palindrome.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Valid Palindrome
|
||||
|
||||
**Problem Number:** 125
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/128_longest_consecutive_sequence.md
Normal file
22
src/notes/128_longest_consecutive_sequence.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Longest Consecutive Sequence
|
||||
|
||||
**Problem Number:** 128
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/1298_maximum_candies_you_can_get_from_boxes.md
Normal file
22
src/notes/1298_maximum_candies_you_can_get_from_boxes.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Maximum Candies You Can Get from Boxes
|
||||
|
||||
**Problem Number:** 1298
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/135_candy.md
Normal file
22
src/notes/135_candy.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Candy
|
||||
|
||||
**Problem Number:** 135
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/141_linked_list_cycle.md
Normal file
22
src/notes/141_linked_list_cycle.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Linked List Cycle
|
||||
|
||||
**Problem Number:** 141
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/149_max_points_on_a_line.md
Normal file
22
src/notes/149_max_points_on_a_line.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Max Points on a Line
|
||||
|
||||
**Problem Number:** 149
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/150_evaluate_reverse_polish_notation.md
Normal file
22
src/notes/150_evaluate_reverse_polish_notation.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Evaluate Reverse Polish Notation
|
||||
|
||||
**Problem Number:** 150
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/153_find_minimum_in_rotated_sorted_array.md
Normal file
22
src/notes/153_find_minimum_in_rotated_sorted_array.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Find Minimum in Rotated Sorted Array
|
||||
|
||||
**Problem Number:** 153
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/155_min_stack.md
Normal file
22
src/notes/155_min_stack.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Min Stack
|
||||
|
||||
**Problem Number:** 155
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/167_two_sum_ii__input_array_is_sorted.md
Normal file
22
src/notes/167_two_sum_ii__input_array_is_sorted.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Two Sum II - Input Array Is Sorted
|
||||
|
||||
**Problem Number:** 167
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/169_majority_element.md
Normal file
22
src/notes/169_majority_element.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Majority Element
|
||||
|
||||
**Problem Number:** 169
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/172_factorial_trailing_zeroes.md
Normal file
22
src/notes/172_factorial_trailing_zeroes.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Factorial Trailing Zeroes
|
||||
|
||||
**Problem Number:** 172
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/1820_maximum_number_of_accepted_invitations.md
Normal file
22
src/notes/1820_maximum_number_of_accepted_invitations.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Maximum Number of Accepted Invitations
|
||||
|
||||
**Problem Number:** 1820
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/189_rotate_array.md
Normal file
22
src/notes/189_rotate_array.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Rotate Array
|
||||
|
||||
**Problem Number:** 189
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/202_happy_number.md
Normal file
22
src/notes/202_happy_number.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Happy Number
|
||||
|
||||
**Problem Number:** 202
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/2040_kth_smallest_product_of_two_sorted_arrays.md
Normal file
22
src/notes/2040_kth_smallest_product_of_two_sorted_arrays.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Kth Smallest Product of Two Sorted Arrays
|
||||
|
||||
**Problem Number:** 2040
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/2053_kth_distinct_string_in_an_array.md
Normal file
22
src/notes/2053_kth_distinct_string_in_an_array.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Kth Distinct String in an Array
|
||||
|
||||
**Problem Number:** 2053
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/205_isomorphic_strings.md
Normal file
22
src/notes/205_isomorphic_strings.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Isomorphic Strings
|
||||
|
||||
**Problem Number:** 205
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/206_reverse_linked_list.md
Normal file
22
src/notes/206_reverse_linked_list.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Reverse Linked List
|
||||
|
||||
**Problem Number:** 206
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/2116_check_if_a_parentheses_string_can_be_valid.md
Normal file
22
src/notes/2116_check_if_a_parentheses_string_can_be_valid.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Check if a Parentheses String Can Be Valid
|
||||
|
||||
**Problem Number:** 2116
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/217_contains_duplicate.md
Normal file
22
src/notes/217_contains_duplicate.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Contains Duplicate
|
||||
|
||||
**Problem Number:** 217
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/219_contains_duplicate_ii.md
Normal file
22
src/notes/219_contains_duplicate_ii.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Contains Duplicate II
|
||||
|
||||
**Problem Number:** 219
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/228_summary_ranges.md
Normal file
22
src/notes/228_summary_ranges.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Summary Ranges
|
||||
|
||||
**Problem Number:** 228
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -0,0 +1,22 @@
|
||||
# Partition Array Such That Maximum Difference Is K
|
||||
|
||||
**Problem Number:** 2294
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/238_product_of_array_except_self.md
Normal file
22
src/notes/238_product_of_array_except_self.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Product of Array Except Self
|
||||
|
||||
**Problem Number:** 238
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/242_valid_anagram.md
Normal file
22
src/notes/242_valid_anagram.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Valid Anagram
|
||||
|
||||
**Problem Number:** 242
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/243_shortest_word_distance.md
Normal file
22
src/notes/243_shortest_word_distance.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Shortest Word Distance
|
||||
|
||||
**Problem Number:** 243
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -0,0 +1,22 @@
|
||||
# Largest Positive Integer That Exists With Its Negative
|
||||
|
||||
**Problem Number:** 2441
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/244_shortest_word_distance_ii.md
Normal file
22
src/notes/244_shortest_word_distance_ii.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Shortest Word Distance II
|
||||
|
||||
**Problem Number:** 244
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/245_shortest_word_distance_iii.md
Normal file
22
src/notes/245_shortest_word_distance_iii.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Shortest Word Distance III
|
||||
|
||||
**Problem Number:** 245
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/246_strobogrammatic_number.md
Normal file
22
src/notes/246_strobogrammatic_number.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Strobogrammatic Number
|
||||
|
||||
**Problem Number:** 246
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/248_strobogrammatic_number_iii.md
Normal file
22
src/notes/248_strobogrammatic_number_iii.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Strobogrammatic Number III
|
||||
|
||||
**Problem Number:** 248
|
||||
**Difficulty:** Hard
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/2616_minimize_the_maximum_difference_of_pairs.md
Normal file
22
src/notes/2616_minimize_the_maximum_difference_of_pairs.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Minimize the Maximum Difference of Pairs
|
||||
|
||||
**Problem Number:** 2616
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/290_word_pattern.md
Normal file
22
src/notes/290_word_pattern.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Word Pattern
|
||||
|
||||
**Problem Number:** 290
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -0,0 +1,22 @@
|
||||
# Divide Array Into Arrays With Max Difference
|
||||
|
||||
**Problem Number:** 2966
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -0,0 +1,22 @@
|
||||
# Maximum Difference Between Even and Odd Frequency I
|
||||
|
||||
**Problem Number:** 3442
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
@@ -0,0 +1,22 @@
|
||||
# Maximum Difference Between Even and Odd Frequency II
|
||||
|
||||
**Problem Number:** 3445
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/383_ransom_note.md
Normal file
22
src/notes/383_ransom_note.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Ransom Note
|
||||
|
||||
**Problem Number:** 383
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/392_is_subsequence.md
Normal file
22
src/notes/392_is_subsequence.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Is Subsequence
|
||||
|
||||
**Problem Number:** 392
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/704_binary_search.md
Normal file
22
src/notes/704_binary_search.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Binary Search
|
||||
|
||||
**Problem Number:** 704
|
||||
**Difficulty:** Easy
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/875_koko_eating_bananas.md
Normal file
22
src/notes/875_koko_eating_bananas.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Koko Eating Bananas
|
||||
|
||||
**Problem Number:** 875
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
22
src/notes/990_satisfiability_of_equality_equations.md
Normal file
22
src/notes/990_satisfiability_of_equality_equations.md
Normal file
@@ -0,0 +1,22 @@
|
||||
# Satisfiability of Equality Equations
|
||||
|
||||
**Problem Number:** 990
|
||||
**Difficulty:** Medium
|
||||
**Category:**
|
||||
|
||||
## Problem Description
|
||||
|
||||
## My Approach
|
||||
|
||||
## Solution
|
||||
|
||||
## Time & Space Complexity
|
||||
|
||||
## Key Insights
|
||||
|
||||
## Mistakes Made
|
||||
|
||||
## Related Problems
|
||||
|
||||
---
|
||||
*Note: This is a work in progress. I'll add more details as I reflect on this problem.*
|
||||
Reference in New Issue
Block a user