javadev · javadev · Jan 16, 2025
diff --git a/src/main/java/g0001_0100/s0002_add_two_numbers/addtwonumber1.jpg b/src/main/java/g0001_0100/s0002_add_two_numbers/addtwonumber1.jpg
diff --git a/src/main/java/g0001_0100/s0002_add_two_numbers/readme.md b/src/main/java/g0001_0100/s0002_add_two_numbers/readme.md
@@ -8,7 +8,7 @@ You may assume the two numbers do not contain any leading zero, except the numbe
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/10/02/addtwonumber1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0002_add_two_numbers/addtwonumber1.jpg)
 
 **Input:** l1 = [2,4,3], l2 = [5,6,4]
 

diff --git a/src/main/java/g0001_0100/s0011_container_with_most_water/question_11.jpg b/src/main/java/g0001_0100/s0011_container_with_most_water/question_11.jpg
diff --git a/src/main/java/g0001_0100/s0011_container_with_most_water/readme.md b/src/main/java/g0001_0100/s0011_container_with_most_water/readme.md
@@ -8,7 +8,7 @@ Given `n` non-negative integers <code>a<sub>1</sub>, a<sub>2</sub>, ..., a<sub>n
 
 **Example 1:**
 
-![](https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0011_container_with_most_water/question_11.jpg)
 
 **Input:** height = [1,8,6,2,5,4,8,3,7]
 

diff --git a/...100/s0017_letter_combinations_of_a_phone_number/200px-telephone-keypad2.svg.png b/...100/s0017_letter_combinations_of_a_phone_number/200px-telephone-keypad2.svg.png
diff --git a/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/readme.md b/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/readme.md
@@ -6,7 +6,7 @@ Given a string containing digits from `2-9` inclusive, return all possible lette
 
 A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.
 
-![](https://upload.wikimedia.org/wikipedia/commons/thumb/7/73/Telephone-keypad2.svg/200px-Telephone-keypad2.svg.png)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/200px-telephone-keypad2.svg.png)
 
 **Example 1:**
 

diff --git a/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/readme.md b/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/readme.md
@@ -6,7 +6,7 @@ Given the `head` of a linked list, remove the `nth` node from the end of the lis
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/10/03/remove_ex1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/remove_ex1.jpg)
 
 **Input:** head = [1,2,3,4,5], n = 2
 

diff --git a/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/remove_ex1.jpg b/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/remove_ex1.jpg
diff --git a/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/merge_ex1.jpg b/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/merge_ex1.jpg
diff --git a/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/readme.md b/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/readme.md
@@ -6,7 +6,7 @@ Merge two sorted linked lists and return it as a **sorted** list. The list shoul
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/10/03/merge_ex1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/merge_ex1.jpg)
 
 **Input:** l1 = [1,2,4], l2 = [1,3,4]
 

diff --git a/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/readme.md b/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/readme.md
@@ -6,7 +6,7 @@ Given a linked list, swap every two adjacent nodes and return its head. You must
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/10/03/swap_ex1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/swap_ex1.jpg)
 
 **Input:** head = [1,2,3,4]
 

diff --git a/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/swap_ex1.jpg b/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/swap_ex1.jpg
diff --git a/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/readme.md b/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/readme.md
@@ -10,15 +10,15 @@ You may not alter the values in the list's nodes, only nodes themselves may be c
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/10/03/reverse_ex1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/reverse_ex1.jpg)
 
 **Input:** head = [1,2,3,4,5], k = 2
 
 **Output:** [2,1,4,3,5] 
 
 **Example 2:**
 
-![](https://assets.leetcode.com/uploads/2020/10/03/reverse_ex2.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/reverse_ex2.jpg)
 
 **Input:** head = [1,2,3,4,5], k = 3
 

diff --git a/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/reverse_ex1.jpg b/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/reverse_ex1.jpg
diff --git a/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/reverse_ex2.jpg b/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/reverse_ex2.jpg
diff --git a/src/main/java/g0001_0100/s0036_valid_sudoku/250px-sudoku-by-l2g-20050714.svg.png b/src/main/java/g0001_0100/s0036_valid_sudoku/250px-sudoku-by-l2g-20050714.svg.png
diff --git a/src/main/java/g0001_0100/s0036_valid_sudoku/readme.md b/src/main/java/g0001_0100/s0036_valid_sudoku/readme.md
@@ -15,7 +15,7 @@ Determine if a `9 x 9` Sudoku board is valid. Only the filled cells need to be v
 
 **Example 1:**
 
-![](https://upload.wikimedia.org/wikipedia/commons/thumb/f/ff/Sudoku-by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0036_valid_sudoku/250px-sudoku-by-l2g-20050714.svg.png)
 
 **Input:**
 

diff --git a/src/main/java/g0001_0100/s0037_sudoku_solver/250px-sudoku-by-l2g-20050714.svg.png b/src/main/java/g0001_0100/s0037_sudoku_solver/250px-sudoku-by-l2g-20050714.svg.png
diff --git a/...va/g0001_0100/s0037_sudoku_solver/250px-sudoku-by-l2g-20050714_solution.svg.png b/...va/g0001_0100/s0037_sudoku_solver/250px-sudoku-by-l2g-20050714_solution.svg.png
diff --git a/src/main/java/g0001_0100/s0037_sudoku_solver/readme.md b/src/main/java/g0001_0100/s0037_sudoku_solver/readme.md
@@ -14,7 +14,7 @@ The `'.'` character indicates empty cells.
 
 **Example 1:**
 
-![](https://upload.wikimedia.org/wikipedia/commons/thumb/f/ff/Sudoku-by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0037_sudoku_solver/250px-sudoku-by-l2g-20050714.svg.png)
 
 **Input:**
 
@@ -42,7 +42,7 @@ The `'.'` character indicates empty cells.
 
 **Explanation:** The input board is shown above and the only valid solution is shown below:
 
-![](https://upload.wikimedia.org/wikipedia/commons/thumb/3/31/Sudoku-by-L2G-20050714_solution.svg/250px-Sudoku-by-L2G-20050714_solution.svg.png) 
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0037_sudoku_solver/250px-sudoku-by-l2g-20050714_solution.svg.png) 
 
 **Constraints:**
 

diff --git a/src/main/java/g0001_0100/s0038_count_and_say/countandsay.jpg b/src/main/java/g0001_0100/s0038_count_and_say/countandsay.jpg
diff --git a/src/main/java/g0001_0100/s0038_count_and_say/readme.md b/src/main/java/g0001_0100/s0038_count_and_say/readme.md
@@ -11,7 +11,7 @@ To determine how you "say" a digit string, split it into the **minimal** number
 
 For example, the saying and conversion for digit string `"3322251"`:
 
-![](https://assets.leetcode.com/uploads/2020/10/23/countandsay.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0038_count_and_say/countandsay.jpg)
 
 Given a positive integer `n`, return _the_ `nth` _term of the **count-and-say** sequence_.
 

diff --git a/src/main/java/g0001_0100/s0042_trapping_rain_water/rainwatertrap.png b/src/main/java/g0001_0100/s0042_trapping_rain_water/rainwatertrap.png
diff --git a/src/main/java/g0001_0100/s0042_trapping_rain_water/readme.md b/src/main/java/g0001_0100/s0042_trapping_rain_water/readme.md
@@ -6,7 +6,7 @@ Given `n` non-negative integers representing an elevation map where the width of
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2018/10/22/rainwatertrap.png)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0042_trapping_rain_water/rainwatertrap.png)
 
 **Input:** height = [0,1,0,2,1,0,1,3,2,1,2,1]
 

diff --git a/src/main/java/g0001_0100/s0048_rotate_image/mat1.jpg b/src/main/java/g0001_0100/s0048_rotate_image/mat1.jpg
diff --git a/src/main/java/g0001_0100/s0048_rotate_image/mat2.jpg b/src/main/java/g0001_0100/s0048_rotate_image/mat2.jpg
diff --git a/src/main/java/g0001_0100/s0048_rotate_image/readme.md b/src/main/java/g0001_0100/s0048_rotate_image/readme.md
@@ -8,15 +8,15 @@ You have to rotate the image [**in-place**](https://en.wikipedia.org/wiki/In-pla
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/08/28/mat1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0048_rotate_image/mat1.jpg)
 
 **Input:** matrix = [[1,2,3],[4,5,6],[7,8,9]]
 
 **Output:** [[7,4,1],[8,5,2],[9,6,3]] 
 
 **Example 2:**
 
-![](https://assets.leetcode.com/uploads/2020/08/28/mat2.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0048_rotate_image/mat2.jpg)
 
 **Input:** matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]
 

diff --git a/src/main/java/g0001_0100/s0051_n_queens/queens.jpg b/src/main/java/g0001_0100/s0051_n_queens/queens.jpg
diff --git a/src/main/java/g0001_0100/s0051_n_queens/readme.md b/src/main/java/g0001_0100/s0051_n_queens/readme.md
@@ -10,7 +10,7 @@ Each solution contains a distinct board configuration of the n-queens' placement
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/11/13/queens.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0051_n_queens/queens.jpg)
 
 **Input:** n = 4
 

diff --git a/src/main/java/g0001_0100/s0052_n_queens_ii/queens.jpg b/src/main/java/g0001_0100/s0052_n_queens_ii/queens.jpg
diff --git a/src/main/java/g0001_0100/s0052_n_queens_ii/readme.md b/src/main/java/g0001_0100/s0052_n_queens_ii/readme.md
@@ -8,7 +8,7 @@ Given an integer `n`, return _the number of distinct solutions to the **n-queens
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/11/13/queens.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0052_n_queens_ii/queens.jpg)
 
 **Input:** n = 4
 

diff --git a/src/main/java/g0001_0100/s0054_spiral_matrix/readme.md b/src/main/java/g0001_0100/s0054_spiral_matrix/readme.md
@@ -6,15 +6,15 @@ Given an `m x n` `matrix`, return _all elements of the_ `matrix` _in spiral orde
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/11/13/spiral1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0054_spiral_matrix/spiral1.jpg)
 
 **Input:** matrix = [[1,2,3],[4,5,6],[7,8,9]]
 
 **Output:** [1,2,3,6,9,8,7,4,5] 
 
 **Example 2:**
 
-![](https://assets.leetcode.com/uploads/2020/11/13/spiral.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0054_spiral_matrix/spiral.jpg)
 
 **Input:** matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
 

diff --git a/src/main/java/g0001_0100/s0054_spiral_matrix/spiral.jpg b/src/main/java/g0001_0100/s0054_spiral_matrix/spiral.jpg
diff --git a/src/main/java/g0001_0100/s0054_spiral_matrix/spiral1.jpg b/src/main/java/g0001_0100/s0054_spiral_matrix/spiral1.jpg
diff --git a/src/main/java/g0001_0100/s0059_spiral_matrix_ii/readme.md b/src/main/java/g0001_0100/s0059_spiral_matrix_ii/readme.md
@@ -6,7 +6,7 @@ Given a positive integer `n`, generate an `n x n` `matrix` filled with elements
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/11/13/spiraln.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0059_spiral_matrix_ii/spiraln.jpg)
 
 **Input:** n = 3
 

diff --git a/src/main/java/g0001_0100/s0059_spiral_matrix_ii/spiraln.jpg b/src/main/java/g0001_0100/s0059_spiral_matrix_ii/spiraln.jpg
diff --git a/src/main/java/g0001_0100/s0061_rotate_list/readme.md b/src/main/java/g0001_0100/s0061_rotate_list/readme.md
@@ -6,15 +6,15 @@ Given the `head` of a linked list, rotate the list to the right by `k` places.
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/11/13/rotate1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0061_rotate_list/rotate1.jpg)
 
 **Input:** head = [1,2,3,4,5], k = 2
 
 **Output:** [4,5,1,2,3] 
 
 **Example 2:**
 
-![](https://assets.leetcode.com/uploads/2020/11/13/roate2.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0061_rotate_list/roate2.jpg)
 
 **Input:** head = [0,1,2], k = 4
 

diff --git a/src/main/java/g0001_0100/s0061_rotate_list/roate2.jpg b/src/main/java/g0001_0100/s0061_rotate_list/roate2.jpg
diff --git a/src/main/java/g0001_0100/s0061_rotate_list/rotate1.jpg b/src/main/java/g0001_0100/s0061_rotate_list/rotate1.jpg
diff --git a/src/main/java/g0001_0100/s0062_unique_paths/readme.md b/src/main/java/g0001_0100/s0062_unique_paths/readme.md
@@ -10,7 +10,7 @@ How many possible unique paths are there?
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2018/10/22/robot_maze.png)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0062_unique_paths/robot_maze.png)
 
 **Input:** m = 3, n = 7
 

diff --git a/src/main/java/g0001_0100/s0062_unique_paths/robot_maze.png b/src/main/java/g0001_0100/s0062_unique_paths/robot_maze.png
diff --git a/src/main/java/g0001_0100/s0063_unique_paths_ii/readme.md b/src/main/java/g0001_0100/s0063_unique_paths_ii/readme.md
@@ -12,7 +12,7 @@ An obstacle and space is marked as `1` and `0` respectively in the grid.
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/11/04/robot1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0063_unique_paths_ii/robot1.jpg)
 
 **Input:** obstacleGrid = [[0,0,0],[0,1,0],[0,0,0]]
 
@@ -22,7 +22,7 @@ An obstacle and space is marked as `1` and `0` respectively in the grid.
 
 **Example 2:**
 
-![](https://assets.leetcode.com/uploads/2020/11/04/robot2.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0063_unique_paths_ii/robot2.jpg)
 
 **Input:** obstacleGrid = [[0,1],[0,0]]
 

diff --git a/src/main/java/g0001_0100/s0063_unique_paths_ii/robot1.jpg b/src/main/java/g0001_0100/s0063_unique_paths_ii/robot1.jpg
diff --git a/src/main/java/g0001_0100/s0063_unique_paths_ii/robot2.jpg b/src/main/java/g0001_0100/s0063_unique_paths_ii/robot2.jpg
diff --git a/src/main/java/g0001_0100/s0064_minimum_path_sum/minpath.jpg b/src/main/java/g0001_0100/s0064_minimum_path_sum/minpath.jpg
diff --git a/src/main/java/g0001_0100/s0064_minimum_path_sum/readme.md b/src/main/java/g0001_0100/s0064_minimum_path_sum/readme.md
@@ -8,7 +8,7 @@ Given a `m x n` `grid` filled with non-negative numbers, find a path from top le
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/11/05/minpath.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0064_minimum_path_sum/minpath.jpg)
 
 **Input:** grid = [[1,3,1],[1,5,1],[4,2,1]]
 

diff --git a/src/main/java/g0001_0100/s0073_set_matrix_zeroes/mat1.jpg b/src/main/java/g0001_0100/s0073_set_matrix_zeroes/mat1.jpg
diff --git a/src/main/java/g0001_0100/s0073_set_matrix_zeroes/mat2.jpg b/src/main/java/g0001_0100/s0073_set_matrix_zeroes/mat2.jpg
diff --git a/src/main/java/g0001_0100/s0073_set_matrix_zeroes/readme.md b/src/main/java/g0001_0100/s0073_set_matrix_zeroes/readme.md
@@ -8,15 +8,15 @@ You must do it [in place](https://en.wikipedia.org/wiki/In-place_algorithm).
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/08/17/mat1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0073_set_matrix_zeroes/mat1.jpg)
 
 **Input:** matrix = [[1,1,1],[1,0,1],[1,1,1]]
 
 **Output:** [[1,0,1],[0,0,0],[1,0,1]] 
 
 **Example 2:**
 
-![](https://assets.leetcode.com/uploads/2020/08/17/mat2.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0073_set_matrix_zeroes/mat2.jpg)
 
 **Input:** matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]
 

diff --git a/src/main/java/g0001_0100/s0074_search_a_2d_matrix/mat.jpg b/src/main/java/g0001_0100/s0074_search_a_2d_matrix/mat.jpg
diff --git a/src/main/java/g0001_0100/s0074_search_a_2d_matrix/mat2.jpg b/src/main/java/g0001_0100/s0074_search_a_2d_matrix/mat2.jpg
diff --git a/src/main/java/g0001_0100/s0074_search_a_2d_matrix/readme.md b/src/main/java/g0001_0100/s0074_search_a_2d_matrix/readme.md
@@ -9,15 +9,15 @@ Write an efficient algorithm that searches for a value in an `m x n` matrix. Thi
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/10/05/mat.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0074_search_a_2d_matrix/mat.jpg)
 
 **Input:** matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
 
 **Output:** true 
 
 **Example 2:**
 
-![](https://assets.leetcode.com/uploads/2020/10/05/mat2.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0074_search_a_2d_matrix/mat2.jpg)
 
 **Input:** matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
 

diff --git a/src/main/java/g0001_0100/s0079_word_search/readme.md b/src/main/java/g0001_0100/s0079_word_search/readme.md
@@ -8,23 +8,23 @@ The word can be constructed from letters of sequentially adjacent cells, where a
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/11/04/word2.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0079_word_search/word2.jpg)
 
 **Input:** board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"
 
 **Output:** true 
 
 **Example 2:**
 
-![](https://assets.leetcode.com/uploads/2020/11/04/word-1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0079_word_search/word-1.jpg)
 
 **Input:** board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"
 
 **Output:** true 
 
 **Example 3:**
 
-![](https://assets.leetcode.com/uploads/2020/10/15/word3.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0079_word_search/word3.jpg)
 
 **Input:** board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"
 

diff --git a/src/main/java/g0001_0100/s0079_word_search/word-1.jpg b/src/main/java/g0001_0100/s0079_word_search/word-1.jpg
diff --git a/src/main/java/g0001_0100/s0079_word_search/word2.jpg b/src/main/java/g0001_0100/s0079_word_search/word2.jpg
diff --git a/src/main/java/g0001_0100/s0079_word_search/word3.jpg b/src/main/java/g0001_0100/s0079_word_search/word3.jpg
diff --git a/...ain/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/linkedlist1.jpg b/...ain/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/linkedlist1.jpg
diff --git a/...ain/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/linkedlist2.jpg b/...ain/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/linkedlist2.jpg
diff --git a/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/readme.md b/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/readme.md
@@ -6,15 +6,15 @@ Given the `head` of a sorted linked list, _delete all nodes that have duplicate
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2021/01/04/linkedlist1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/linkedlist1.jpg)
 
 **Input:** head = [1,2,3,3,4,4,5]
 
 **Output:** [1,2,5] 
 
 **Example 2:**
 
-![](https://assets.leetcode.com/uploads/2021/01/04/linkedlist2.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/linkedlist2.jpg)
 
 **Input:** head = [1,1,1,2,3]
 

diff --git a/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/list1.jpg b/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/list1.jpg
diff --git a/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/list2.jpg b/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/list2.jpg
diff --git a/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/readme.md b/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/readme.md
@@ -6,15 +6,15 @@ Given the `head` of a sorted linked list, _delete all duplicates such that each
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2021/01/04/list1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/list1.jpg)
 
 **Input:** head = [1,1,2]
 
 **Output:** [1,2] 
 
 **Example 2:**
 
-![](https://assets.leetcode.com/uploads/2021/01/04/list2.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/list2.jpg)
 
 **Input:** head = [1,1,2,3,3]
 

diff --git a/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/histogram-1.jpg b/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/histogram-1.jpg
diff --git a/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/histogram.jpg b/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/histogram.jpg
diff --git a/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/readme.md b/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/readme.md
@@ -6,7 +6,7 @@ Given an array of integers `heights` representing the histogram's bar height whe
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2021/01/04/histogram.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/histogram.jpg)
 
 **Input:** heights = [2,1,5,6,2,3]
 
@@ -16,7 +16,7 @@ Given an array of integers `heights` representing the histogram's bar height whe
 
 **Example 2:**
 
-![](https://assets.leetcode.com/uploads/2021/01/04/histogram-1.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/histogram-1.jpg)
 
 **Input:** heights = [2,4]
 

diff --git a/src/main/java/g0001_0100/s0085_maximal_rectangle/maximal.jpg b/src/main/java/g0001_0100/s0085_maximal_rectangle/maximal.jpg
diff --git a/src/main/java/g0001_0100/s0085_maximal_rectangle/readme.md b/src/main/java/g0001_0100/s0085_maximal_rectangle/readme.md
@@ -6,7 +6,7 @@ Given a `rows x cols` binary `matrix` filled with `0`'s and `1`'s, find the larg
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2020/09/14/maximal.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0085_maximal_rectangle/maximal.jpg)
 
 **Input:** matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
 

diff --git a/src/main/java/g0001_0100/s0086_partition_list/partition.jpg b/src/main/java/g0001_0100/s0086_partition_list/partition.jpg
diff --git a/src/main/java/g0001_0100/s0086_partition_list/readme.md b/src/main/java/g0001_0100/s0086_partition_list/readme.md
@@ -8,7 +8,7 @@ You should **preserve** the original relative order of the nodes in each of the
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2021/01/04/partition.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0086_partition_list/partition.jpg)
 
 **Input:** head = [1,4,3,2,5,2], x = 3
 

diff --git a/src/main/java/g0001_0100/s0092_reverse_linked_list_ii/readme.md b/src/main/java/g0001_0100/s0092_reverse_linked_list_ii/readme.md
@@ -6,7 +6,7 @@ Given the `head` of a singly linked list and two integers `left` and `right` whe
 
 **Example 1:**
 
-![](https://assets.leetcode.com/uploads/2021/02/19/rev2ex2.jpg)
+![](https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0092_reverse_linked_list_ii/rev2ex2.jpg)
 
 **Input:** head = [1,2,3,4,5], left = 2, right = 4
 

diff --git a/src/main/java/g0001_0100/s0092_reverse_linked_list_ii/rev2ex2.jpg b/src/main/java/g0001_0100/s0092_reverse_linked_list_ii/rev2ex2.jpg
diff --git a/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/inorder_1.jpg b/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/inorder_1.jpg
diff --git a/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/inorder_4.jpg b/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/inorder_4.jpg
diff --git a/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/inorder_5.jpg b/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/inorder_5.jpg