Pankajcoder1
diff --git a/‎Google/CodeJam/Practice/2019_Qualification_Round_Foregone_Solution.cpp
+146 b/‎Google/CodeJam/Practice/2019_Qualification_Round_Foregone_Solution.cpp
+146
diff --git a/‎Google/Kick_Start/2020/Round_E/Longest_Arithmetic.cpp ‎Google/KickStart/2020/Round_E/Longest_Arithmetic.cpp b/‎Google/Kick_Start/2020/Round_E/Longest_Arithmetic.cpp ‎Google/KickStart/2020/Round_E/Longest_Arithmetic.cpp
diff --git a/‎Google/Kick_Start/2020/Round_E/a.out ‎Google/KickStart/2020/Round_E/a.out b/‎Google/Kick_Start/2020/Round_E/a.out ‎Google/KickStart/2020/Round_E/a.out
diff --git a/‎Google/Kick_Start/2020/Round_E/readme.md ‎Google/KickStart/2020/Round_E/readme.md b/‎Google/Kick_Start/2020/Round_E/readme.md ‎Google/KickStart/2020/Round_E/readme.md
diff --git a/‎Google/Kick_Start/2020/Round_F/ATM_Queue.cpp ‎Google/KickStart/2020/Round_F/ATM_Queue.cpp b/‎Google/Kick_Start/2020/Round_F/ATM_Queue.cpp ‎Google/KickStart/2020/Round_F/ATM_Queue.cpp
diff --git a/‎Google/Kick_Start/2020/Round_F/Metal_Harvest.cpp ‎Google/KickStart/2020/Round_F/Metal_Harvest.cpp b/‎Google/Kick_Start/2020/Round_F/Metal_Harvest.cpp ‎Google/KickStart/2020/Round_F/Metal_Harvest.cpp
diff --git a/‎Google/Kick_Start/2020/Round_F/a.out ‎Google/KickStart/2020/Round_F/a.out b/‎Google/Kick_Start/2020/Round_F/a.out ‎Google/KickStart/2020/Round_F/a.out
diff --git a/‎Google/Kick_Start/2020/Round_G/Combination_Lock.cpp ‎Google/KickStart/2020/Round_G/Combination_Lock.cpp b/‎Google/Kick_Start/2020/Round_G/Combination_Lock.cpp ‎Google/KickStart/2020/Round_G/Combination_Lock.cpp
diff --git a/‎Google/Kick_Start/2020/Round_G/Kick_Start.cpp ‎Google/KickStart/2020/Round_G/Kick_Start.cpp b/‎Google/Kick_Start/2020/Round_G/Kick_Start.cpp ‎Google/KickStart/2020/Round_G/Kick_Start.cpp
diff --git a/‎Google/Kick_Start/2020/Round_G/Maximum_Coins.cpp ‎Google/KickStart/2020/Round_G/Maximum_Coins.cpp b/‎Google/Kick_Start/2020/Round_G/Maximum_Coins.cpp ‎Google/KickStart/2020/Round_G/Maximum_Coins.cpp
diff --git a/‎Google/Kick_Start/2020/Round_G/a.out ‎Google/KickStart/2020/Round_G/a.out b/‎Google/Kick_Start/2020/Round_G/a.out ‎Google/KickStart/2020/Round_G/a.out
diff --git a/‎Google/Kick_Start/2020/Round_H/Retype.cpp ‎Google/KickStart/2020/Round_H/Retype.cpp b/‎Google/Kick_Start/2020/Round_H/Retype.cpp ‎Google/KickStart/2020/Round_H/Retype.cpp
diff --git a/‎Google/Kick_Start/2021/Round_A/K-Goodness_String.cpp ‎Google/KickStart/2021/Round_A/K-Goodness_String.cpp b/‎Google/Kick_Start/2021/Round_A/K-Goodness_String.cpp ‎Google/KickStart/2021/Round_A/K-Goodness_String.cpp
diff --git a/‎Google/Kick_Start/2021/Round_A/L_Shaped_Plots.cpp ‎Google/KickStart/2021/Round_A/L_Shaped_Plots.cpp b/‎Google/Kick_Start/2021/Round_A/L_Shaped_Plots.cpp ‎Google/KickStart/2021/Round_A/L_Shaped_Plots.cpp
diff --git a/‎Google/Kick_Start/Practice/2020_Round_A-Allocatio.cpp ‎Google/KickStart/Practice/2020_Round_A-Allocatio.cpp b/‎Google/Kick_Start/Practice/2020_Round_A-Allocatio.cpp ‎Google/KickStart/Practice/2020_Round_A-Allocatio.cpp
diff --git a/‎Google/Kick_Start/Practice/2020_Round_A-Plates.cpp ‎Google/KickStart/Practice/2020_Round_A-Plates.cpp b/‎Google/Kick_Start/Practice/2020_Round_A-Plates.cpp ‎Google/KickStart/Practice/2020_Round_A-Plates.cpp
diff --git a/‎Google/Kick_Start/readme.md ‎Google/KickStart/readme.md b/‎Google/Kick_Start/readme.md ‎Google/KickStart/readme.md
diff --git a/‎LeetCode/practice/1.Two_sum.cpp ‎LeetCode/Practice/1.Two_sum.cpp b/‎LeetCode/practice/1.Two_sum.cpp ‎LeetCode/Practice/1.Two_sum.cpp
diff --git a/‎LeetCode/practice/1025.Divisor_Game.cpp ‎LeetCode/Practice/1025.Divisor_Game.cpp b/‎LeetCode/practice/1025.Divisor_Game.cpp ‎LeetCode/Practice/1025.Divisor_Game.cpp
diff --git a/‎LeetCode/practice/120.Triangle.cpp ‎LeetCode/Practice/120.Triangle.cpp b/‎LeetCode/practice/120.Triangle.cpp ‎LeetCode/Practice/120.Triangle.cpp
diff --git a/‎LeetCode/practice/121.Best_Time_to_Buy_and_Sell_Stock.cpp ‎LeetCode/Practice/121.Best_Time_to_Buy_and_Sell_Stock.cpp b/‎LeetCode/practice/121.Best_Time_to_Buy_and_Sell_Stock.cpp ‎LeetCode/Practice/121.Best_Time_to_Buy_and_Sell_Stock.cpp
diff --git a/‎LeetCode/practice/152.Maximum_Product_Subarray.cpp ‎LeetCode/Practice/152.Maximum_Product_Subarray.cpp b/‎LeetCode/practice/152.Maximum_Product_Subarray.cpp ‎LeetCode/Practice/152.Maximum_Product_Subarray.cpp
diff --git a/‎LeetCode/practice/167.Two_sumII_Input_array_is_sorted.cpp ‎LeetCode/Practice/167.Two_sumII_Input_array_is_sorted.cpp b/‎LeetCode/practice/167.Two_sumII_Input_array_is_sorted.cpp ‎LeetCode/Practice/167.Two_sumII_Input_array_is_sorted.cpp
diff --git a/‎LeetCode/practice/1680.Concatenation_of_Consecutive_Binary_Numbers.cpp ‎LeetCode/Practice/1680.Concatenation_of_Consecutive_Binary_Numbers.cpp b/‎LeetCode/practice/1680.Concatenation_of_Consecutive_Binary_Numbers.cpp ‎LeetCode/Practice/1680.Concatenation_of_Consecutive_Binary_Numbers.cpp
diff --git a/‎LeetCode/practice/1721.Swapping_Nodes_in_a_Linked_List.cpp ‎LeetCode/Practice/1721.Swapping_Nodes_in_a_Linked_List.cpp b/‎LeetCode/practice/1721.Swapping_Nodes_in_a_Linked_List.cpp ‎LeetCode/Practice/1721.Swapping_Nodes_in_a_Linked_List.cpp
diff --git a/‎LeetCode/practice/1726.Tuple_with_Same_Product.cpp ‎LeetCode/Practice/1726.Tuple_with_Same_Product.cpp b/‎LeetCode/practice/1726.Tuple_with_Same_Product.cpp ‎LeetCode/Practice/1726.Tuple_with_Same_Product.cpp
diff --git a/‎LeetCode/practice/1753.Maximum_Score_From_Removing_Stones.cpp ‎LeetCode/Practice/1753.Maximum_Score_From_Removing_Stones.cpp b/‎LeetCode/practice/1753.Maximum_Score_From_Removing_Stones.cpp ‎LeetCode/Practice/1753.Maximum_Score_From_Removing_Stones.cpp
diff --git a/‎LeetCode/practice/1790.Check_if_One_String_Swap_Can_Make_Strings_Equal.cpp ‎LeetCode/Practice/1790.Check_if_One_String_Swap_Can_Make_Strings_Equal.cpp b/‎LeetCode/practice/1790.Check_if_One_String_Swap_Can_Make_Strings_Equal.cpp ‎LeetCode/Practice/1790.Check_if_One_String_Swap_Can_Make_Strings_Equal.cpp
diff --git a/‎LeetCode/practice/1791.Find_Center_of_Star_Graph.cpp ‎LeetCode/Practice/1791.Find_Center_of_Star_Graph.cpp b/‎LeetCode/practice/1791.Find_Center_of_Star_Graph.cpp ‎LeetCode/Practice/1791.Find_Center_of_Star_Graph.cpp
diff --git a/‎LeetCode/practice/1792.Maximum_Average_Pass_Ratio.cpp ‎LeetCode/Practice/1792.Maximum_Average_Pass_Ratio.cpp b/‎LeetCode/practice/1792.Maximum_Average_Pass_Ratio.cpp ‎LeetCode/Practice/1792.Maximum_Average_Pass_Ratio.cpp
diff --git a/‎LeetCode/practice/1793.Maximum_Score_of_a_Good_Subarray.cpp ‎LeetCode/Practice/1793.Maximum_Score_of_a_Good_Subarray.cpp b/‎LeetCode/practice/1793.Maximum_Score_of_a_Good_Subarray.cpp ‎LeetCode/Practice/1793.Maximum_Score_of_a_Good_Subarray.cpp
diff --git a/‎LeetCode/practice/198.House_Robber.cpp ‎LeetCode/Practice/198.House_Robber.cpp b/‎LeetCode/practice/198.House_Robber.cpp ‎LeetCode/Practice/198.House_Robber.cpp
diff --git a/‎LeetCode/practice/20.Valid_Parentheses.cpp ‎LeetCode/Practice/20.Valid_Parentheses.cpp b/‎LeetCode/practice/20.Valid_Parentheses.cpp ‎LeetCode/Practice/20.Valid_Parentheses.cpp
diff --git a/‎LeetCode/practice/202.Happy_Number.cpp ‎LeetCode/Practice/202.Happy_Number.cpp b/‎LeetCode/practice/202.Happy_Number.cpp ‎LeetCode/Practice/202.Happy_Number.cpp
diff --git a/‎LeetCode/practice/203.Remove_Linked_List_Elements.cpp ‎LeetCode/Practice/203.Remove_Linked_List_Elements.cpp b/‎LeetCode/practice/203.Remove_Linked_List_Elements.cpp ‎LeetCode/Practice/203.Remove_Linked_List_Elements.cpp
diff --git a/‎LeetCode/practice/204-Count_Primes.cpp ‎LeetCode/Practice/204-Count_Primes.cpp b/‎LeetCode/practice/204-Count_Primes.cpp ‎LeetCode/Practice/204-Count_Primes.cpp
diff --git a/‎LeetCode/practice/221-Maximal_Square.cpp ‎LeetCode/Practice/221-Maximal_Square.cpp b/‎LeetCode/practice/221-Maximal_Square.cpp ‎LeetCode/Practice/221-Maximal_Square.cpp
diff --git a/‎LeetCode/practice/26.Remove_Duplicates_from_Sorted_Array.cpp ‎LeetCode/Practice/26.Remove_Duplicates_from_Sorted_Array.cpp b/‎LeetCode/practice/26.Remove_Duplicates_from_Sorted_Array.cpp ‎LeetCode/Practice/26.Remove_Duplicates_from_Sorted_Array.cpp
diff --git a/‎LeetCode/practice/263-Ugly_Number.cpp ‎LeetCode/Practice/263-Ugly_Number.cpp b/‎LeetCode/practice/263-Ugly_Number.cpp ‎LeetCode/Practice/263-Ugly_Number.cpp
diff --git a/‎LeetCode/practice/264-Ugly_Number_II.cpp ‎LeetCode/Practice/264-Ugly_Number_II.cpp b/‎LeetCode/practice/264-Ugly_Number_II.cpp ‎LeetCode/Practice/264-Ugly_Number_II.cpp
diff --git a/‎LeetCode/practice/27.Remove_Element.cpp ‎LeetCode/Practice/27.Remove_Element.cpp b/‎LeetCode/practice/27.Remove_Element.cpp ‎LeetCode/Practice/27.Remove_Element.cpp
diff --git a/‎LeetCode/practice/279-Perfect_Squares.cpp ‎LeetCode/Practice/279-Perfect_Squares.cpp b/‎LeetCode/practice/279-Perfect_Squares.cpp ‎LeetCode/Practice/279-Perfect_Squares.cpp
diff --git a/‎LeetCode/practice/283.Move_Zeroes.cpp ‎LeetCode/Practice/283.Move_Zeroes.cpp b/‎LeetCode/practice/283.Move_Zeroes.cpp ‎LeetCode/Practice/283.Move_Zeroes.cpp
diff --git a/‎LeetCode/practice/300-Longest_Increasing_Subsequence.cpp ‎LeetCode/Practice/300-Longest_Increasing_Subsequence.cpp b/‎LeetCode/practice/300-Longest_Increasing_Subsequence.cpp ‎LeetCode/Practice/300-Longest_Increasing_Subsequence.cpp
diff --git a/‎LeetCode/practice/303.Range_Sum_Query-Immutable.cpp ‎LeetCode/Practice/303.Range_Sum_Query-Immutable.cpp b/‎LeetCode/practice/303.Range_Sum_Query-Immutable.cpp ‎LeetCode/Practice/303.Range_Sum_Query-Immutable.cpp
diff --git a/‎LeetCode/practice/304.Range_Sum_Query2D-Immutable.cpp ‎LeetCode/Practice/304.Range_Sum_Query2D-Immutable.cpp b/‎LeetCode/practice/304.Range_Sum_Query2D-Immutable.cpp ‎LeetCode/Practice/304.Range_Sum_Query2D-Immutable.cpp
diff --git a/‎LeetCode/practice/307.Range_Sum_Query-Mutable.cpp ‎LeetCode/Practice/307.Range_Sum_Query-Mutable.cpp b/‎LeetCode/practice/307.Range_Sum_Query-Mutable.cpp ‎LeetCode/Practice/307.Range_Sum_Query-Mutable.cpp
diff --git a/‎LeetCode/practice/31.Next_Permutation.cpp ‎LeetCode/Practice/31.Next_Permutation.cpp b/‎LeetCode/practice/31.Next_Permutation.cpp ‎LeetCode/Practice/31.Next_Permutation.cpp
diff --git a/‎LeetCode/practice/392.Is_Subsequence.cpp ‎LeetCode/Practice/392.Is_Subsequence.cpp b/‎LeetCode/practice/392.Is_Subsequence.cpp ‎LeetCode/Practice/392.Is_Subsequence.cpp
diff --git a/‎LeetCode/practice/452.Minimum_Number_of_Arriws_to_Brust_Ballons.cpp ‎LeetCode/Practice/452.Minimum_Number_of_Arriws_to_Brust_Ballons.cpp b/‎LeetCode/practice/452.Minimum_Number_of_Arriws_to_Brust_Ballons.cpp ‎LeetCode/Practice/452.Minimum_Number_of_Arriws_to_Brust_Ballons.cpp
diff --git a/‎LeetCode/practice/5.Longest_Palindromic_Substring.cpp ‎LeetCode/Practice/5.Longest_Palindromic_Substring.cpp b/‎LeetCode/practice/5.Longest_Palindromic_Substring.cpp ‎LeetCode/Practice/5.Longest_Palindromic_Substring.cpp
diff --git a/‎LeetCode/practice/53.Maximum_Subarray.cpp ‎LeetCode/Practice/53.Maximum_Subarray.cpp b/‎LeetCode/practice/53.Maximum_Subarray.cpp ‎LeetCode/Practice/53.Maximum_Subarray.cpp
diff --git a/‎LeetCode/practice/5667.Can_You_Eat_Your_Favorite_Candy_on_Your_Favorite_Day?.cpp ‎LeetCode/Practice/5667.Can_You_Eat_Your_Favorite_Candy_on_Your_Favorite_Day?.cpp b/‎LeetCode/practice/5667.Can_You_Eat_Your_Favorite_Candy_on_Your_Favorite_Day?.cpp ‎LeetCode/Practice/5667.Can_You_Eat_Your_Favorite_Candy_on_Your_Favorite_Day?.cpp
diff --git a/‎LeetCode/practice/62.Unique_Paths.cpp ‎LeetCode/Practice/62.Unique_Paths.cpp b/‎LeetCode/practice/62.Unique_Paths.cpp ‎LeetCode/Practice/62.Unique_Paths.cpp
diff --git a/‎LeetCode/practice/628-Maxumum_Product_of_Three_Numbers.cpp ‎LeetCode/Practice/628-Maxumum_Product_of_Three_Numbers.cpp b/‎LeetCode/practice/628-Maxumum_Product_of_Three_Numbers.cpp ‎LeetCode/Practice/628-Maxumum_Product_of_Three_Numbers.cpp
diff --git a/‎LeetCode/practice/63.Unique_Paths_II.cpp ‎LeetCode/Practice/63.Unique_Paths_II.cpp b/‎LeetCode/practice/63.Unique_Paths_II.cpp ‎LeetCode/Practice/63.Unique_Paths_II.cpp
diff --git a/‎LeetCode/practice/64.Minimum_Path_Sum.cpp ‎LeetCode/Practice/64.Minimum_Path_Sum.cpp b/‎LeetCode/practice/64.Minimum_Path_Sum.cpp ‎LeetCode/Practice/64.Minimum_Path_Sum.cpp
diff --git a/‎LeetCode/practice/674-Longest_Continuous_Increasing_Subsequence.cpp ‎LeetCode/Practice/674-Longest_Continuous_Increasing_Subsequence.cpp b/‎LeetCode/practice/674-Longest_Continuous_Increasing_Subsequence.cpp ‎LeetCode/Practice/674-Longest_Continuous_Increasing_Subsequence.cpp
diff --git a/‎LeetCode/practice/7.Reverse_Integer.cpp ‎LeetCode/Practice/7.Reverse_Integer.cpp b/‎LeetCode/practice/7.Reverse_Integer.cpp ‎LeetCode/Practice/7.Reverse_Integer.cpp
diff --git a/‎LeetCode/practice/70.Climbing_Stairs.cpp ‎LeetCode/Practice/70.Climbing_Stairs.cpp b/‎LeetCode/practice/70.Climbing_Stairs.cpp ‎LeetCode/Practice/70.Climbing_Stairs.cpp
diff --git a/‎LeetCode/practice/746.Min_Cost_Climbing_Stairs.cpp ‎LeetCode/Practice/746.Min_Cost_Climbing_Stairs.cpp b/‎LeetCode/practice/746.Min_Cost_Climbing_Stairs.cpp ‎LeetCode/Practice/746.Min_Cost_Climbing_Stairs.cpp
diff --git a/‎LeetCode/practice/9.Palindrome_Number.cpp ‎LeetCode/Practice/9.Palindrome_Number.cpp b/‎LeetCode/practice/9.Palindrome_Number.cpp ‎LeetCode/Practice/9.Palindrome_Number.cpp
diff --git a/‎LeetCode/practice/91.Decode_Ways.cpp ‎LeetCode/Practice/91.Decode_Ways.cpp b/‎LeetCode/practice/91.Decode_Ways.cpp ‎LeetCode/Practice/91.Decode_Ways.cpp
diff --git a/‎LeetCode/practice/Pow(x,n).cpp ‎LeetCode/Practice/Pow(x,n).cpp b/‎LeetCode/practice/Pow(x,n).cpp ‎LeetCode/Practice/Pow(x,n).cpp
diff --git a/‎LeetCode/practice/Sqrt(x).cpp ‎LeetCode/Practice/Sqrt(x).cpp b/‎LeetCode/practice/Sqrt(x).cpp ‎LeetCode/Practice/Sqrt(x).cpp
diff --git a/‎LeetCode/practice/String_to_Integer(atoi).cpp ‎LeetCode/Practice/String_to_Integer(atoi).cpp b/‎LeetCode/practice/String_to_Integer(atoi).cpp ‎LeetCode/Practice/String_to_Integer(atoi).cpp
diff --git a/‎LeetCode/weekly_contest/208/5523.Crawler_Log_Folder.cpp ‎LeetCode/Weekly_Contest/208/5523.Crawler_Log_Folder.cpp b/‎LeetCode/weekly_contest/208/5523.Crawler_Log_Folder.cpp ‎LeetCode/Weekly_Contest/208/5523.Crawler_Log_Folder.cpp
diff --git a/‎LeetCode/weekly_contest/210/5535-Maximum_Nesting_Depth_of_the_Parantheses.cpp ‎LeetCode/Weekly_Contest/210/5535-Maximum_Nesting_Depth_of_the_Parantheses.cpp b/‎LeetCode/weekly_contest/210/5535-Maximum_Nesting_Depth_of_the_Parantheses.cpp ‎LeetCode/Weekly_Contest/210/5535-Maximum_Nesting_Depth_of_the_Parantheses.cpp
diff --git a/‎LeetCode/weekly_contest/210/5536-Maximal_Network_Rank.cpp ‎LeetCode/Weekly_Contest/210/5536-Maximal_Network_Rank.cpp b/‎LeetCode/weekly_contest/210/5536-Maximal_Network_Rank.cpp ‎LeetCode/Weekly_Contest/210/5536-Maximal_Network_Rank.cpp
diff --git a/‎LeetCode/weekly_contest/210/5537.Split_two_Stings_to_Make_Palindrome.cpp ‎LeetCode/Weekly_Contest/210/5537.Split_two_Stings_to_Make_Palindrome.cpp b/‎LeetCode/weekly_contest/210/5537.Split_two_Stings_to_Make_Palindrome.cpp ‎LeetCode/Weekly_Contest/210/5537.Split_two_Stings_to_Make_Palindrome.cpp
diff --git a/‎LeetCode/weekly_contest/211/5543.Largest_Substring_Between_Two_Equal_Characters.cpp ‎LeetCode/Weekly_Contest/211/5543.Largest_Substring_Between_Two_Equal_Characters.cpp b/‎LeetCode/weekly_contest/211/5543.Largest_Substring_Between_Two_Equal_Characters.cpp ‎LeetCode/Weekly_Contest/211/5543.Largest_Substring_Between_Two_Equal_Characters.cpp
diff --git a/‎LeetCode/weekly_contest/218/Goal_Parser_Interpretation.cpp ‎LeetCode/Weekly_Contest/218/Goal_Parser_Interpretation.cpp b/‎LeetCode/weekly_contest/218/Goal_Parser_Interpretation.cpp ‎LeetCode/Weekly_Contest/218/Goal_Parser_Interpretation.cpp
diff --git a/‎LeetCode/weekly_contest/218/Max_Number_of_K-Sum_Pairs.cpp ‎LeetCode/Weekly_Contest/218/Max_Number_of_K-Sum_Pairs.cpp b/‎LeetCode/weekly_contest/218/Max_Number_of_K-Sum_Pairs.cpp ‎LeetCode/Weekly_Contest/218/Max_Number_of_K-Sum_Pairs.cpp
diff --git a/‎LeetCode/weekly_contest/223/5649.Decode_XORed_Array.cpp ‎LeetCode/Weekly_Contest/223/5649.Decode_XORed_Array.cpp b/‎LeetCode/weekly_contest/223/5649.Decode_XORed_Array.cpp ‎LeetCode/Weekly_Contest/223/5649.Decode_XORed_Array.cpp
diff --git a/‎LeetCode/weekly_contest/224/5653.Number_of_Rectangles_That_Can_Form_The_Largest_Square.cpp ‎LeetCode/Weekly_Contest/224/5653.Number_of_Rectangles_That_Can_Form_The_Largest_Square.cpp b/‎LeetCode/weekly_contest/224/5653.Number_of_Rectangles_That_Can_Form_The_Largest_Square.cpp ‎LeetCode/Weekly_Contest/224/5653.Number_of_Rectangles_That_Can_Form_The_Largest_Square.cpp
diff --git a/‎LeetCode/weekly_contest/226/5654.Maximum_Number_of_Balls_in_a_Box.cpp ‎LeetCode/Weekly_Contest/226/5654.Maximum_Number_of_Balls_in_a_Box.cpp b/‎LeetCode/weekly_contest/226/5654.Maximum_Number_of_Balls_in_a_Box.cpp ‎LeetCode/Weekly_Contest/226/5654.Maximum_Number_of_Balls_in_a_Box.cpp
diff --git a/‎LeetCode/weekly_contest/226/5665.Restore_the_Array_From_Adjacent_Pairs.cpp ‎LeetCode/Weekly_Contest/226/5665.Restore_the_Array_From_Adjacent_Pairs.cpp b/‎LeetCode/weekly_contest/226/5665.Restore_the_Array_From_Adjacent_Pairs.cpp ‎LeetCode/Weekly_Contest/226/5665.Restore_the_Array_From_Adjacent_Pairs.cpp
diff --git a/‎LeetCode/weekly_contest/227/5672.Check_if_Array_Is_Sorted_and_Rotated.cpp.cpp ‎LeetCode/Weekly_Contest/227/5672.Check_if_Array_Is_Sorted_and_Rotated.cpp.cpp b/‎LeetCode/weekly_contest/227/5672.Check_if_Array_Is_Sorted_and_Rotated.cpp.cpp ‎LeetCode/Weekly_Contest/227/5672.Check_if_Array_Is_Sorted_and_Rotated.cpp.cpp
diff --git a/‎README.md
+2-1 b/‎README.md
+2-1
@@ -0,0 +1,146 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+    Institute: National Institute of Technology, Uttarakhand
+*/
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+using namespace std;
+using namespace __gnu_pbds;
+typedef long long ll ;
+typedef unsigned long long ull;
+typedef vector<ll> vl;
+#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
+/*  Abbrevations  */
+#define ff first
+#define ss second
+#define mp make_pair
+#define line cout<<endl;
+#define pb push_back
+#define Endl "\n"
+// loops
+#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
+// Some print
+#define no cout<<"No"<<endl;
+#define yes cout<<"Yes"<<endl;
+// sort
+#define all(V) (V).begin(),(V).end()
+#define srt(V) sort(all(V))
+#define srtGreat(V) sort(all(V),greater<ll>())
+// some extra
+#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} line;
+#define precision(x) cout<<fixed<<setprecision(x);
+#define sz(V) ll(V.size())
+// template
+template <typename T>
+T mymax(T x,T y)
+{
+    return (x>y)?x:y;
+}
+// function
+ll power(ll x,ll y,ll mod)
+{
+    ll res=1;
+    // x=x%mod;
+    while(y>0)
+    {
+        if(y%2==1)
+        {
+            res*=x;
+            // res=res%mod;
+        }
+        y/=2; x*=x; // x=x%mod;
+    }
+    return res;
+}
+ll str_to_num(string s)
+{
+    stringstream pk(s);
+    ll num;
+    pk>>num;
+    return num;
+}
+
+string num_to_str(ll num)
+{
+    return to_string(num);
+}
+// datatype definination
+#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
+class Point
+{
+    public:
+        ll x;
+        ll y;
+        ll z;
+        ll getsum()
+        {
+            return x+y+z;
+        }
+};
+/* ascii value 
+A=65,Z=90,a=97,z=122
+*/
+/*  --------------------MAIN PROGRAM----------------------------*/
+// to run ctrl+b
+const ll INF=LONG_MAX;
+
+
+ll solve()
+{
+    string s;
+    cin>>s;
+    string s1,s2;
+    ll pos=-1;
+    for(auto x:s){
+        if(x!='4'){
+            s1+=x;
+            s2+='0';
+        }
+        else{
+            s1+='2';
+            s2+='2';
+        }
+    }
+    for(ll i=0;i<sz(s2);i++){
+        if(s2[i]!='0'){
+            pos=i;
+            break;
+        }
+    }
+    // cout<<"s2 is "<<s2<<endl;
+    cout<<s1<<" ";
+    if(pos>=0&&pos+1<=sz(s2)){
+        for(ll i=pos;i<sz(s2);i++)
+            cout<<s2[i];
+        line;
+    }
+    else
+        cout<<0<<endl;
+    return 0;
+}
+
+int main()
+{
+    speed;
+    /* #ifndef ONLINE_JUDGE
+        freopen("input.txt","r",stdin);
+        freopen("output.txt","w",stdout);
+    #endif */
+    ll TestCase=1;
+    cin>>TestCase;
+    for(ll i=1;i<=TestCase;i++)
+    {
+        cout<<"Case #"<<i<<": ";
+        solve();
+    }
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission 
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/