java practice at hackerrank started

Pankajcoder1 · Pankajcoder1 · commit 8a6ace7ad34e · 2022-03-19T14:26:14.000+05:30
diff --git a/Codeforces/After Placement/1647A-Madoka_and_Math_Dad.cpp b/Codeforces/After Placement/1647A-Madoka_and_Math_Dad.cpp
@@ -0,0 +1,163 @@
+/*
+    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 vector<ll> vl;
+typedef vector<vector<ll>> vvl;
+#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
+// 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())
+// datatype definination
+#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
+
+
+class Codeforces{
+    private:
+        // read only variable
+        const ll INF=1e18;
+        const ll mod1=1e9+7;
+        const ll mod2=998244353;
+
+
+    public:
+        Codeforces(){
+
+        }
+
+        ll power(ll x,ll y){
+            ll result=1;
+            while(y>0){
+                if(y&1){
+                    result*=x;
+                }
+                y>>=1;
+                x*=x;
+            }
+            return result;
+        }
+
+        ll power(ll x,ll y,ll mod){
+            ll result=1;
+            x%=mod;
+            while(y>0){
+                if(y&1){
+                    result*=x;
+                    result%=mod;
+                }
+                y>>=1;
+                x*=x;
+                x%=mod;
+            }
+            return result;
+        }
+
+        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);
+        }
+        // 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.
+        ll solve(){
+            int n;
+            cin>>n;
+            if(n<=2){
+                cout<<n<<endl;
+            }
+            else{
+                string s1="";
+                for(int i=0;i<1000;i++){
+                    if(i&1){
+                        s1+='1';
+                    }
+                    else{
+                        s1+='2';
+                    }
+                }
+                int sum=0;
+                for(int i=0;i<s1.size();i++){
+                    sum+=(s1[i]-'0');
+                    if(sum==n){
+                        string ans=s1.substr(0,i+1);
+                        cout<<ans<<endl;
+                        return 0;
+                    }
+                    else if(sum>n){
+                        break;
+                    }
+                }
+                sum=0;
+                for(int i=1;i<sz(s1);i++){
+                    sum+=(s1[i]-'0');
+                    if(sum==n){
+                        string ans=s1.substr(1,i);
+                        cout<<ans<<endl;
+                        return 0;
+                    }
+                    else if(sum>n){
+                        break;
+                    }
+                }
+                line;
+            }
+            return 0;
+        }
+};
+
+
+/*  --------------------MAIN PROGRAM----------------------------*/
+
+int main()
+{
+    speed;
+    /* #ifndef ONLINE_JUDGE
+        freopen("input.txt","r",stdin);
+        freopen("output.txt","w",stdout);
+    #endif */
+    ll TestCase=1;
+    cin>>TestCase;
+    while(TestCase--){
+        Codeforces cf;
+        cf.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
+*/
diff --git a/HackerRank/Java/Java_Currency_Formatter.java b/HackerRank/Java/Java_Currency_Formatter.java
@@ -0,0 +1,26 @@
+import java.util.*;
+import java.text.*;
+import java.text.DecimalFormat;
+import java.math.*;
+import java.util.regex.*;
+public class Solution {
+    // use java 7 or java 8
+    // this code will give error in java 15
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        double payment = scanner.nextDouble();
+        scanner.close();
+      
+        Locale indiaLocale = new Locale("en", "IN");
+        NumberFormat us     = NumberFormat.getCurrencyInstance(Locale.US);
+        NumberFormat india = NumberFormat.getCurrencyInstance(indiaLocale);    
+        NumberFormat china  = NumberFormat.getCurrencyInstance(Locale.CHINA);
+        NumberFormat france = NumberFormat.getCurrencyInstance(Locale.FRANCE);
+
+        System.out.println("US: "+ us.format(payment));
+        System.out.println("India: "+india.format(payment));
+        System.out.println("China: "  + china.format(payment));
+        System.out.println("France: " + france.format(payment));
+    }
+}
diff --git a/HackerRank/Java/Java_If-Else.java b/HackerRank/Java/Java_If-Else.java
@@ -0,0 +1,27 @@
+import java.io.*;
+import java.math.*;
+import java.security.*;
+import java.text.*;
+import java.util.*;
+import java.util.concurrent.*;
+import java.util.regex.*;
+
+public class Solution {
+
+
+
+    private static final Scanner scanner = new Scanner(System.in);
+
+    public static void main(String[] args) {
+        int N = scanner.nextInt();
+        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+        
+         if(N%2==1 || (N>=6 && N <= 20)){
+          System.out.println("Weird");
+          }
+        else{
+          System.out.println("Not Weird");
+        }
+        scanner.close();
+    }
+}
diff --git a/HackerRank/Java/Java_Loops.java b/HackerRank/Java/Java_Loops.java
@@ -0,0 +1,22 @@
+import java.io.*;
+import java.math.*;
+import java.security.*;
+import java.text.*;
+import java.util.*;
+import java.util.concurrent.*;
+import java.util.regex.*;
+
+
+
+public class Solution {
+    public static void main(String[] args) throws IOException {
+        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
+
+        int N = Integer.parseInt(bufferedReader.readLine().trim());
+
+        bufferedReader.close();
+        for(int i=1;i<=10;i++){
+            System.out.println(N+" x "+i+" = "+N*i);
+        }
+    }
+}
diff --git a/HackerRank/Java/Java_Output_Formatting.java b/HackerRank/Java/Java_Output_Formatting.java
@@ -0,0 +1,21 @@
+import java.util.Scanner;
+
+public class Solution {
+
+    public static void main(String[] args) {
+            Scanner sc=new Scanner(System.in);
+            System.out.println("================================");
+            for(int i=0;i<3;i++){
+                String s1=sc.next();
+                int x=sc.nextInt();
+                //Complete this line
+                System.out.printf("%-15s%03d",s1,x);
+                System.out.printf("\n");
+            }
+            System.out.println("================================");
+
+    }
+}
+
+
+
diff --git a/HackerRank/Java/Java_Stdin_and_Stdout.java b/HackerRank/Java/Java_Stdin_and_Stdout.java
@@ -0,0 +1,20 @@
+import java.util.*;
+
+public class Solution {
+
+    public static void main(String[] args) {
+        Scanner scan = new Scanner(System.in);
+        int a = scan.nextInt();
+        int b = scan.nextInt();
+        int c = scan.nextInt();
+        // Complete this line
+        // Complete this line
+
+        System.out.println(a);
+        System.out.println(b);
+        System.out.println(c);
+        // Complete this line
+        // Complete this line
+    }
+}
+
diff --git a/HackerRank/Java/Welcome_to_Java!.java b/HackerRank/Java/Welcome_to_Java!.java
@@ -0,0 +1,9 @@
+public class Solution {
+
+    public static void main(String[] args) {
+        /* Enter your code here. Print output to STDOUT. Your class should be named Solution. */
+        System.out.println("Hello, World.");
+        System.out.println("Hello, Java.");
+    }
+}
+
diff --git a/LeetCode/1249.Minimum_Remove_to_Make_Valid_Parentheses.cpp b/LeetCode/1249.Minimum_Remove_to_Make_Valid_Parentheses.cpp
@@ -0,0 +1,99 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+    Institute: National Institute of Technology, Uttarakhand
+*/
+typedef long long ll ;
+typedef vector<int> vl;
+typedef vector<vector<int>> vvl;
+#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 pb push_back
+// 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]<<" ";} 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 minRemoveToMakeValid(string s) {
+        string ans="";
+        stack<pair<char,int>> st;
+        for(int i=0;i<s.length();i++){
+            if(s[i]>='a'&&s[i]<='z'){
+                continue;
+            }
+            else{
+                if(s[i]=='('){
+                    st.push({s[i],i});
+                }
+                else{
+                    if(st.empty()){
+                        s[i]=',';
+                    }
+                    else if(st.top().ff=='('){
+                        st.pop();
+                    }
+                    else{
+                        s[i]=',';
+                    }
+                }
+            }
+        }
+        while(!st.empty()){
+            s[st.top().ss]=',';
+            st.pop();
+        }
+        for(auto x:s){
+            if(x!=','){
+                ans+=x;
+            }
+        }
+        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
+*/
diff --git a/LeetCode/20.Valid_Parentheses.cpp b/LeetCode/20.Valid_Parentheses.cpp
diff --git a/LeetCode/946.Validate_Stack_Sequences.cpp b/LeetCode/946.Validate_Stack_Sequences.cpp
