02-06-2024

Author: Hasheditz

LeetCode 2024/June/344. Reverse String.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    void reverseString(vector<char>& s) {
+        
+        int n = s.size();
+
+        for(int i = 0 ; i < n/2 ; i++)
+        {
+            swap(s[i] , s[n-i-1]);
+        }
+    }
+};

readme.md

@@ -1,68 +1,47 @@
-# 3110. Score of a String
+# 344. Reverse String
 
-## **Date**: June 1, 2024
+## **Date**: June 2, 2024
 **Difficulty**: ![Easy](https://img.shields.io/badge/Easy-Green)  
-**Related Topics**: ![String](https://img.shields.io/badge/String-blue)  
+**Related Topics**: ![String](https://img.shields.io/badge/String-blue) ![TwoPointer](https://img.shields.io/badge/TwoPointer-blue)
 
 <p align="left">
   <a href="https://github.com/Hasheditz/Leetcode-CSES-GFG-Codeforces-Coding-Solutions?tab=readme-ov-file#score-of-a-string" style="margin-right: 5px;">
     <img src="https://img.shields.io/badge/All%20Problem%20Solutions-green" alt="All Problem Solutions">
   </a>
-  <a href="https://leetcode.com/problems/score-of-a-string/">
+  <a href="https://leetcode.com/problems/reverse-string/">
     <img src="https://img.shields.io/badge/Link%20To%20The%20Question-blue" alt="Link To The Question">
   </a>
 </p>
 
 ## Editorial
 
-This problem requires us to calculate a score based on the absolute differences between adjacent characters in a given string. The challenge is to achieve this in an efficient manner.
+This problem requires us to Write a function that reverses a string. The input string is given as an array of characters s.
 
 ### Solution Explanation
 
-To solve this problem, we can iterate through the string and calculate the absolute difference between each pair of adjacent characters. Here’s a step-by-step explanation of the approach:
+To solve this problem, we can iterate through the string `n/2` times and `swap` the values.
 
 #### Key Steps:
-1. **Initialization**: Initialize a variable `res` to 0 to store the cumulative score.
-2. **Iterate Through the String**: Traverse each character in the string except the last one.
-3. **Calculate Absolute Differences**: For each character, compute the absolute difference with the next character and add this difference to `res`.
-4. **Return the Result**: After processing all adjacent pairs, return `res` as the final score.
+1. **Start Iterating** from `index 0` to `n/2` and we can go to the  last index by saying `last = n-i-1`.
+2. **Swap** the `curr` index with the `last` index.
+3. **Gven function is a void function so, we do not have to return anything just modify the `vector of chars`
 
 ### Code
 
 ```cpp
 class Solution {
 public:
-    int scoreOfString(string s) {
-	
-        int res = 0;
+    void reverseString(vector<char>& s) {
+        
         int n = s.size();
 
-        for(int i = 0; i < n-1; i++) {
-            res += abs(s[i] - s[i+1]);
+        for(int i = 0 ; i < n/2 ; i++)
+        {
+            swap(s[i] , s[n-i-1]);
         }
-
-        return res;
     }
 };
 ```
-### Explanation of Code
-
-#### Initialization:
-- `res` is initialized to 0, which will hold the final score.
-- `n` is assigned the size of the input string `s`.
-
-#### Iterate Through the String:
-- A `for` loop is used to iterate through the string from the first character to the second-to-last character.
-
-#### Calculate Absolute Differences:
-- For each character in the string, the absolute difference between the current character `s[i]` and the next character `s[i+1]` is calculated using `abs(s[i] - s[i+1])`.
-- This difference is added to `res`.
-
-#### Return the Result:
-- After the loop completes, `res` holds the total score, which is then returned.
-
-This approach ensures an efficient calculation of the score based on the sum of the absolute differences between each pair of adjacent characters in the string.
-
 ## Like and Upvote
 
 If you found this solution helpful, please consider liking 👍 and upvoting ⬆️. Your support helps me to keep providing high-quality solutions.