minor fixes

Signed-off-by: rajput-hemant <hemant.rajput_cs20@gla.ac.in>

Author: rajput-hemant

README.md

@@ -9,8 +9,8 @@
 <!-- title/logo -->
 
 <picture>
-  <source media="(prefers-color-scheme: light)" srcset="https://telegra.ph/file/50295ab5d953128d8e698.png">
-  <source media="(prefers-color-scheme: dark)" srcset="https://telegra.ph/file/7ea4a5e6d225c0fe19686.png">
+  <source media="(prefers-color-scheme: light)" srcset="docs/assets/light.png">
+  <source media="(prefers-color-scheme: dark)" srcset="docs/assets/dark.png">
   <img alt="Leetcode">
 </picture>
 

TOPICWISE.md

@@ -3,8 +3,8 @@
 <!-- title/logo -->
 
 <picture>
-  <source media="(prefers-color-scheme: light)" srcset="https://telegra.ph/file/50295ab5d953128d8e698.png">
-  <source media="(prefers-color-scheme: dark)" srcset="https://telegra.ph/file/7ea4a5e6d225c0fe19686.png">
+  <source media="(prefers-color-scheme: light)" srcset="docs/assets/light.png">
+  <source media="(prefers-color-scheme: dark)" srcset="docs/assets/dark.png">
   <img alt="Leetcode">
 </picture>
 

src/0101-0200/144 - Binary Tree Preorder Traversal/README.md

@@ -38,7 +38,7 @@ Follow up: Recursive solution is trivial, could you do it iteratively?
 
 ## Solution:
 
-### [_Java_]()
+### [_Java_](./BinaryTreePreorderTraversal.java)
 
 ```java
 List<Integer> list = new ArrayList<Integer>();

src/0301-0400/344 - Reverse String/README.md

@@ -24,7 +24,7 @@ Output: ["h","a","n","n","a","H"]
 
 ### Constraints:
 
-- 1 <= s.length <= 10<sup>5<sup>
+- 1 <= s.length <= 10<sup>5</sup>
 - s[i] is a printable ascii character.
 
 ## Solutions:

src/0701-0800/704 - Binary Search/README.md

@@ -10,7 +10,8 @@ You must write an algorithm with `O(log n)` runtime complexity.
 
 ### Example 1:
 
-```Input: nums = [-1,0,3,5,9,12], target = 9
+```
+Input: nums = [-1,0,3,5,9,12], target = 9
 Output: 4
 Explanation: 9 exists in nums and its index is 4
 ```

src/0801-0900/876 - Middle of the Linked List/README.md

@@ -35,7 +35,7 @@ Explanation: Since the list has two middle nodes with values 3 and 4, we return
 
 ## Solution:
 
-### [_Java_]()
+### [_Java_](./MiddleOfTheLinkedList.java)
 
 ```java
 public ListNode middleNode(ListNode head) {

src/0801-0900/888 - Fair Candy Swap/README.md

@@ -4,7 +4,7 @@
 
 ## Problem Statement:
 
-Alice and Bob have a different total number of candies. You are given two integer arrays `aliceSizes` and `bobSizes` where `aliceSizes[i]` is the number of candies of the <code>i<sup>th</sup><code> box of candy that Alice has and bobSizes[j] is the number of candies of the <code>j<sup>th</sup></code> box of candy that Bob has.
+Alice and Bob have a different total number of candies. You are given two integer arrays `aliceSizes` and `bobSizes` where `aliceSizes[i]` is the number of candies of the <code>i<sup>th</sup></code> box of candy that Alice has and bobSizes[j] is the number of candies of the <code>j<sup>th</sup></code> box of candy that Bob has.
 
 Since they are friends, they would like to exchange one candy box each so that after the exchange, they both have the same total amount of candy. The total amount of candy a person has is the sum of the number of candies in each box they have.
 

src/README.md

@@ -1,8 +1,8 @@
 <div align="center">
 
 <picture>
-  <source media="(prefers-color-scheme: light)" srcset="https://telegra.ph/file/50295ab5d953128d8e698.png">
-  <source media="(prefers-color-scheme: dark)" srcset="https://telegra.ph/file/7ea4a5e6d225c0fe19686.png">
+  <source media="(prefers-color-scheme: light)" srcset="../docs/assets/light.png">
+  <source media="(prefers-color-scheme: dark)" srcset="../docs/assets/dark.png">
   <img alt="Leetcode">
 </picture>