Update README.md

Depth-monster · web-flow · commit 76c16f628a03 · 2023-04-01T10:30:42.000+03:00
diff --git a/top 150/README.md b/top 150/README.md
@@ -45,8 +45,8 @@ function lengthOfLongestSubstring(s: string): number {
   return longesSubstring;
 }
 ```
- <summary> <strong>4. Median of Two Sorted Arrays</strong> </summary>
-<br>
+</details>
+#####  4. Median of Two Sorted Arrays
  Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
 
 The overall run time complexity should be O(log (m+n)).
@@ -138,8 +138,6 @@ function findMedianSortedArrays(nums1: number[], nums2: number[]): number {
   } 
 }
 ```
-</details>
-
 30-31.03.2023:
 ##### 5. Longest Palindromic Substring
 Given a string s, return the longest palindromic substring in s.

Original file line number	Diff line number	Diff line change
`@@ -45,8 +45,8 @@ function lengthOfLongestSubstring(s: string): number {`
`45`	`45`	`return longesSubstring;`
`46`	`46`	`}`
`47`	`47`	```
`48`		`- <summary> <strong>4. Median of Two Sorted Arrays</strong> </summary>`
`49`		`-<br>`
	`48`	`+</details>`
	`49`	`+##### 4. Median of Two Sorted Arrays`
`50`	`50`	`Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.`
`51`	`51`
`52`	`52`	`The overall run time complexity should be O(log (m+n)).`
`@@ -138,8 +138,6 @@ function findMedianSortedArrays(nums1: number[], nums2: number[]): number {`
`138`	`138`	`}`
`139`	`139`	`}`
`140`	`140`	```
`141`		`-</details>`
`142`		`-`
`143`	`141`	`30-31.03.2023:`
`144`	`142`	`##### 5. Longest Palindromic Substring`
`145`	`143`	`Given a string s, return the longest palindromic substring in s.`