From c1fcd757b46b7a7a48cc7ab26a949a59ce22e0e7 Mon Sep 17 00:00:00 2001
From: Arkaprabha Chakraborty <arkorty@gmail.com>
Date: Thu, 11 Aug 2022 08:15:07 +0530
Subject: [PATCH] Refactor some stuff

---
 Medium/binary-tree-level-order-traversal/solution.cpp | 10 ++++------
 Medium/container-with-most-water/solution.cpp         |  4 +---
 2 files changed, 5 insertions(+), 9 deletions(-)

diff --git a/Medium/binary-tree-level-order-traversal/solution.cpp b/Medium/binary-tree-level-order-traversal/solution.cpp
index cad3c27..4e5fadd 100644
--- a/Medium/binary-tree-level-order-traversal/solution.cpp
+++ b/Medium/binary-tree-level-order-traversal/solution.cpp
@@ -6,14 +6,12 @@ struct TreeNode {
     TreeNode *right;
     TreeNode() : val(0), left(nullptr), right(nullptr) {}
     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
-    TreeNode(int x, TreeNode *left, TreeNode *right)
-        : val(x), left(left), right(right) {}
+    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 };
 
 class Solution {
-  private:
-    void levelOrder(std::vector<std::vector<int>> &levels, TreeNode *root,
-                    int index) {
+private:
+    void levelOrder(std::vector<std::vector<int>> &levels, TreeNode *root, int index) {
         if (root == nullptr) {
             return;
         } else if (levels.size() == index) {
@@ -25,7 +23,7 @@ class Solution {
         levelOrder(levels, root->right, index + 1);
     }
 
-  public:
+public:
     std::vector<std::vector<int>> levelOrder(TreeNode *root) {
         std::vector<std::vector<int>> levels;
         levelOrder(levels, root, 0);
diff --git a/Medium/container-with-most-water/solution.cpp b/Medium/container-with-most-water/solution.cpp
index b57bf58..37f9da1 100644
--- a/Medium/container-with-most-water/solution.cpp
+++ b/Medium/container-with-most-water/solution.cpp
@@ -9,9 +9,7 @@ public:
         int maxArea = 0;
         int curArea = 0;
         while (left < right) {
-            curArea =
-                (right - left) *
-                (height[left] < height[right] ? height[left] : height[right]);
+            curArea = (right - left) * (height[left] < height[right] ? height[left] : height[right]);
             maxArea = maxArea > curArea ? maxArea : curArea;
 
             if (height[left] > height[right]) {