updated files

ajay-dhangar · Oct 27, 2024 · 6bceb6d · 6bceb6d
1 parent bf2da69
commit 6bceb6d
Show file tree

Hide file tree

Showing 6 changed files with 36 additions and 36 deletions.
diff --git a/java/Arrays/1.Easy/Find missing number.md b/java/Arrays/1.Easy/Find missing number.md
@@ -1,10 +1,10 @@
 ---
-id: <find-missing-number>
-title: <Find the Missing Number in Array>
-sidebar_label: <Find Missing Number in Array>
-sidebar_position: <1>
-description: <Find the missing number in an array of size N containing numbers from 1 to N.>
-tags: [<Array>, <XOR>, <DSA>]
+id: find-missing-number
+title: Find the Missing Number in Array
+sidebar_label: Find Missing Number in Array
+sidebar_position: 1
+description: Find the missing number in an array of size N containing numbers from 1 to N.
+tags: [Array, XOR, DSA]
 ---
 
 # Problem Statement

diff --git a/java/Arrays/1.Easy/Remove Duplicates from Sorted Array.md b/java/Arrays/1.Easy/Remove Duplicates from Sorted Array.md
@@ -1,10 +1,10 @@
 ---
-id: <remove-duplicates-sorted-array>
-title: <Remove Duplicates in-place from Sorted Array>
-sidebar_label: <Remove Duplicates in-place>
-sidebar_position: <1>
-description: <Given a sorted array, remove the duplicates in-place and return the new length.>
-tags: [<Array>, <In-place>, <DSA>]
+id: remove-duplicates-sorted-array
+title: Remove Duplicates in-place from Sorted Array
+sidebar_label: Remove Duplicates in-place
+sidebar_position: 1
+description: Given a sorted array, remove the duplicates in-place and return the new length.
+tags: [Array, In-place, DSA]
 ---
 
 # Remove Duplicates in-place from Sorted Array

diff --git a/java/Arrays/2.Medium/Kadane's Algorithm.md b/java/Arrays/2.Medium/Kadane's Algorithm.md
@@ -1,10 +1,10 @@
 ---
-id: <kadanes-algorithm>
-title: <Kadane's Algorithm- Maximum Subarray Sum>
-sidebar_label: <Maximum Subarray Sum>
-sidebar_position: <1>
-description: <Find the maximum sum of a contiguous subarray in an integer array.>
-tags: [<Array>, <Dynamic Programming>, <Greedy>, <DSA>]
+id: kadanes-algorithm>
+title: Kadane's Algorithm- Maximum Subarray Sum
+sidebar_label: Maximum Subarray Sum
+sidebar_position: 1
+description: Find the maximum sum of a contiguous subarray in an integer array.
+tags: [Array, Dynamic Programming, Greedy, DSA]
 ---
 
 # Kadane's Algorithm: Maximum Subarray Sum

diff --git a/java/Arrays/2.Medium/Longest Subarray with sum K.md b/java/Arrays/2.Medium/Longest Subarray with sum K.md
@@ -1,10 +1,10 @@
 ---
-id: <longest-subarray-sum-k>
-title: <Find Longest Subarray with Sum k>
-sidebar_label: <Longest Subarray with Sum k>
-sidebar_position: <1>
-description: <Find the length of the longest subarray whose sum equals k.>
-tags: [<Array>, <Hashing>, <DSA>]
+id: longest-subarray-sum-k
+title: Find Longest Subarray with Sum k
+sidebar_label: Longest Subarray with Sum k
+sidebar_position: 1
+description: Find the length of the longest subarray whose sum equals k.
+tags: [Array, Hashing, DSA]
 ---
 
 # Problem Statement

diff --git a/java/Arrays/3.Hard/Maximum Product Subarray.md b/java/Arrays/3.Hard/Maximum Product Subarray.md
@@ -1,10 +1,10 @@
 ---
-id: <maximum-product-subarray>
-title: <Maximum Product Subarray in an Array>
-sidebar_label: <Maximum Product Subarray>
-sidebar_position: <1>
-description: <Find the maximum product of a contiguous subarray within an array containing both negative and positive integers.>
-tags: [<Dynamic Programming>, <Array>]
+id: maximum-product-subarray
+title: Maximum Product Subarray in an Array
+sidebar_label: Maximum Product Subarray
+sidebar_position: 1
+description: Find the maximum product of a contiguous subarray within an array containing both negative and positive integers.
+tags: [Dynamic Programming, Array]
 ---
 
 # Problem Statement

diff --git a/java/Arrays/3.Hard/Reverse pairs.md b/java/Arrays/3.Hard/Reverse pairs.md
@@ -1,10 +1,10 @@
 ---
-id: <reverse-pairs>
-title: <Count Reverse Pairs>
-sidebar_label: <Count Reverse Pairs>
-sidebar_position: <1>
-description: <Count the number of reverse pairs in an array where i < j and arr[i] > 2 * arr[j].>
-tags: [<Merge Sort>, <Array>]
+id: reverse-pairs
+title: Count Reverse Pairs
+sidebar_label: Count Reverse Pairs
+sidebar_position: 1
+description: Count the number of reverse pairs in an array where i < j and arr[i] > 2 * arr[j].
+tags: [Merge Sort, Array]
 ---
 
 # Problem Statement