template for vscode json file added

Author: Pankajcoder1

LeetCode/Practice/1047.Remove_All_Adjacent_Duplicates_In_String.cpp

@@ -0,0 +1,84 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+    Institute: National Institute of Technology, Uttarakhand
+*/
+typedef long long ll ;
+typedef unsigned long long ull;
+typedef vector<int> vl;
+typedef vector<vector<ll>> vvl;
+/*  Abbrevations  */
+#define ff first
+#define ss second
+#define mp make_pair
+#define pb push_back
+#define Endl "\n"
+#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]<<" ";} cout<<endl;
+#define precision(x) cout<<fixed<<setprecision(x);
+#define sz(V) ll(V.size())
+
+/* ascii value 
+A=65,Z=90,a=97,z=122
+*/
+/* Some syntax 
+//Syntax to create a min heap for priority queue
+//priority_queue <int, vector<int>, greater<int>>pq;
+*/
+
+
+/*  --------------------MAIN PROGRAM----------------------------*/
+// to run ctrl+b
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+// Experience :
+// Cp is nothing but only observation and mathematics.
+
+// add main code here
+class Solution {
+public:
+    string removeDuplicates(string s) {
+        stack<char> st;
+        string ans="";
+        for(auto x:s){
+            if(sz(st)==0){
+                st.push(x);
+            }
+            else{
+                if(st.top()==x){
+                    st.pop();
+                }
+                else{
+                    st.push(x);
+                }
+            }
+        }
+        while(sz(st)){
+            ans+=st.top();
+            st.pop();
+        }
+        reverse(all(ans));
+        return ans;
+    }
+};
+
+
+
+/* -----------------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
+*/

Template/Advanced_Template(CF).cpp

@@ -69,17 +69,7 @@ string num_to_str(ll 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
 */

Template/Atcoder_Template.cpp

@@ -66,17 +66,7 @@ string num_to_str(ll 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
 */

Template/KickStart_Template.cpp

@@ -19,7 +19,6 @@ typedef vector<vector<ll>> vvl;
 #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
@@ -39,6 +38,7 @@ T mymax(T x,T y)
 {
     return (x>y)?x:y;
 }
+// Function
 ll power(ll x,ll y,ll mod)
 {
     ll res=1;
@@ -65,17 +65,7 @@ string num_to_str(ll 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
 */

Template/Leetcode_Template.cpp

@@ -6,13 +6,12 @@
 typedef long long ll ;
 typedef unsigned long long ull;
 typedef vector<int> vl;
-typedef vector<vector<ll>> vvl;
+typedef vector<vector<int>> vvl;
 /*  Abbrevations  */
 #define ff first
 #define ss second
 #define mp make_pair
 #define pb push_back
-#define Endl "\n"
 #define all(V) (V).begin(),(V).end()
 #define srt(V) sort(all(V))
 #define srtGreat(V) sort(all(V),greater<ll>())