feat: add solutions for lc No.3861 (#5066)

Author: yanglbme

solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/README.md

@@ -129,7 +129,7 @@ function minOperations(s: string): number {
     let cnt = 0;
     const n = s.length;
     for (let i = 0; i < n; ++i) {
-        if (s[i] !== "01"[i & 1]) {
+        if (s[i] !== '01'[i & 1]) {
             ++cnt;
         }
     }

solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/README_EN.md

@@ -130,7 +130,7 @@ function minOperations(s: string): number {
     let cnt = 0;
     const n = s.length;
     for (let i = 0; i < n; ++i) {
-        if (s[i] !== "01"[i & 1]) {
+        if (s[i] !== '01'[i & 1]) {
             ++cnt;
         }
     }

solution/1700-1799/1758.Minimum Changes To Make Alternating Binary String/Solution.ts

@@ -2,7 +2,7 @@ function minOperations(s: string): number {
     let cnt = 0;
     const n = s.length;
     for (let i = 0; i < n; ++i) {
-        if (s[i] !== "01"[i & 1]) {
+        if (s[i] !== '01'[i & 1]) {
             ++cnt;
         }
     }

solution/3800-3899/3852.Smallest Pair With Different Frequencies/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3852.Smallest%20Pair%20With%20Different%20Frequencies/README.md
+rating: 1287
+source: 第 177 场双周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3800-3899/3852.Smallest Pair With Different Frequencies/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3852.Smallest%20Pair%20With%20Different%20Frequencies/README_EN.md
+rating: 1287
+source: Biweekly Contest 177 Q1
 ---
 
 <!-- problem:start -->

solution/3800-3899/3853.Merge Close Characters/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3853.Merge%20Close%20Characters/README.md
+rating: 1471
+source: 第 177 场双周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3800-3899/3853.Merge Close Characters/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3853.Merge%20Close%20Characters/README_EN.md
+rating: 1471
+source: Biweekly Contest 177 Q2
 ---
 
 <!-- problem:start -->

solution/3800-3899/3854.Minimum Operations to Make Array Parity Alternating/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3854.Minimum%20Operations%20to%20Make%20Array%20Parity%20Alternating/README.md
+rating: 2095
+source: 第 177 场双周赛 Q3
 ---
 
 <!-- problem:start -->

solution/3800-3899/3854.Minimum Operations to Make Array Parity Alternating/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3854.Minimum%20Operations%20to%20Make%20Array%20Parity%20Alternating/README_EN.md
+rating: 2095
+source: Biweekly Contest 177 Q3
 ---
 
 <!-- problem:start -->

solution/3800-3899/3855.Sum of K-Digit Numbers in a Range/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3855.Sum%20of%20K-Digit%20Numbers%20in%20a%20Range/README.md
+rating: 2085
+source: 第 177 场双周赛 Q4
 ---
 
 <!-- problem:start -->