added solution for leetcode problem number 138

Author: kashvi7440

dsa-solutions/lc-solutions/1000-1099/1002-find-common-characters.md

@@ -1,8 +1,6 @@
 ---
-
 id: find-common-characters
 title: Find Common Characters
-level: easy
 sidebar_label: Find Common Characters
 tags:
   - Hash Table
@@ -153,4 +151,4 @@ public:
 - **Build Result**:
   - Iterate through the `minFreq` array and collect characters that have a non-zero frequency.
 
-This approach ensures that we find the common characters that appear in all words within the `words` array, considering the constraints and requirements of the problem.
+This approach ensures that we find the common characters that appear in all words within the `words` array, considering the constraints and requirements of the problem.

dsa-solutions/lc-solutions/1000-1099/1004-max-consecutive-ones-iii.md

@@ -1,8 +1,6 @@
 ---
-
 id: max-consecutive-ones-iii
 title: Max Consecutive Ones III
-level: medium
 sidebar_label: Max Consecutive Ones III
 tags:
   - Array
@@ -11,7 +9,6 @@ tags:
   - Python
   - C++
 description: "This document provides solutions for the Max Consecutive Ones III problem on LeetCode."
-
 ---
 
 ## Problem Statement
@@ -156,4 +153,4 @@ public:
 - **Track the Maximum Window Size**:
   - We update `maxOnes` to the maximum window size found during the process.
 
-This approach efficiently finds the maximum number of consecutive ones by maintaining a sliding window of valid subarrays, ensuring optimal performance for large input sizes.
+This approach efficiently finds the maximum number of consecutive ones by maintaining a sliding window of valid subarrays, ensuring optimal performance for large input sizes.