Polish up all C++ translations

Author: jwl-7

src/code/cpp/array/sliding_window.cpp

@@ -11,12 +11,10 @@ int fn(vector<int>& arr) {
 
     for (int right = 0; right < n; right++) {
         // TODO: add arr[right] to window
-        window += arr[right];
 
         while (WINDOW_CONDITION_BROKEN) {
             // TODO: remove arr[left] from window
-            window -= arr[left];
-            left += 1;
+            left++;
         }
 
         // TODO: update ans

src/code/cpp/array/two_pointers_one_input.cpp

@@ -11,9 +11,9 @@ int fn(vector<int>& arr) {
     while (left < right) {
         // TODO: logic with left and right
         if (CONDITION) {
-            left += 1;
+            left++;
         } else {
-            right -= 1;
+            right--;
         }
     }
 

src/code/cpp/array/two_pointers_two_inputs.cpp

@@ -11,20 +11,20 @@ int fn(vector<int>& arr1, vector<int>& arr2) {
     while (i < arr1.size() && j < arr2.size()) {
         // TODO: logic
         if (CONDITION) {
-            i += 1;
+            i++;
         } else {
-            j += 1;
+            j++;
         }
     }
 
     while (i < arr1.size()) {
         // TODO: logic
-        i += 1;
+        i++;
     }
 
     while (j < arr2.size()) {
         // TODO: logic
-        j += 1;
+        j++;
     }
 
     return ans;

src/code/cpp/backtracking/backtracking.cpp

@@ -1,4 +1,4 @@
-int backtrack(int curr, OTHER_ARGUMENTS...) {
+int backtrack(STATE curr, OTHER_ARGUMENTS...) {
     if (BASE_CASE) {
         // TODO: modify answer
         return 0;

src/code/cpp/binary_search/binary_search.cpp

@@ -12,7 +12,7 @@ int fn(vector<int>& arr, int target) {
 
         if (arr[mid] == target) {
             // TODO: logic
-            return;
+            return mid;
         }
         if (arr[mid] > target) {
             right = mid - 1;

src/code/cpp/bit_manipulation/swap_variables.cpp

@@ -1,4 +1,5 @@
 #include <tuple>
+
 using namespace std;
 
 

src/code/cpp/data_structures/array.cpp

@@ -5,7 +5,6 @@ using namespace std;
 
 
 template<typename T>
-
 class Array {
 private:
     T* data;
@@ -50,13 +49,3 @@ class Array {
         return os;
     }
 };
-
-int main() {
-    Array<int> arr(5);
-    for (size_t i = 0; i < arr.len(); ++i) {
-        arr[i] = i * 10;
-    }
-    std::cout << "Array: " << arr << std::endl;
-
-    return 0;
-}

src/code/cpp/data_structures/binary_search_tree.cpp

@@ -51,4 +51,3 @@ class BinarySearchTree {
         return result;
     }
 };
-

src/code/cpp/data_structures/doubly_linked_list.cpp

@@ -30,6 +30,7 @@ class DoublyLinkedList {
         }
 
         auto curr = head;
+
         while (curr->next) {
             curr = curr->next;
         }
@@ -53,13 +54,16 @@ class DoublyLinkedList {
         }
 
         auto curr = head;
+
         while (curr) {
             if (curr->data == data) {
                 auto prev_node = curr->prev;
                 prev_node->next = curr->next;
+
                 if (curr->next) {
                     curr->next->prev = prev_node;
                 }
+
                 return;
             }
             curr = curr->next;
@@ -91,9 +95,11 @@ class DoublyLinkedList {
 
         while (curr) {
             result += "[" + to_string(curr->data) + "]";
+
             if (curr->next) {
                 result += " <-> ";
             }
+
             curr = curr->next;
         }
 

src/code/cpp/data_structures/graph.cpp

@@ -32,15 +32,19 @@ class Graph {
 
     string toString() {
         string output;
+
         for (const auto& [vertex, neighbors] : graph) {
             output += vertex + " - ";
+
             for (const auto& neighbor : neighbors) {
                 output += neighbor + " - ";
             }
+
             output.pop_back();
             output.pop_back();
             output += "\n";
         }
+
         return output;
     }
 };