Added hacker rank java basic code

Author: sunilkumarmaurya786693

.DS_Store

@@ -2,8 +2,12 @@
 *
 !*.*
 !*/
-.vscode
 .DS_Store
+._.DS_Store
+**/.DS_Store
+**/._.DS_Store
+.vscode
+*.class
 testCPP/*
 Coding-ninjas-competitive
 Competitive-Coding
@@ -13,3 +17,11 @@ comptetive-programming_interview-resource
 coding template by other
 low level/Online_Examination_CPP
 low level/Online_Examination_CPP
+hackerRank-java/out/
+hackerRank-java/.cph/
+hackerRank-java/.idea
+leetcode/array/.cph/
+hello.dSYM/Contents/Info.plist
+hackerRank-java/hackerRank-jav  a.iml
+leetcode/array/save.bin
+.cph

.gitignore

@@ -1,95 +1,24 @@
-#include <bits/stdc++.h>
+#include <iostream>
 using namespace std;
-const int MAX_N = 3e5 + 6;
 
-struct Node {
-  Node* child[2];
-  Node() {
-    this -> child[0] = this -> child[1] = NULL;
-  }
-};
-void insert(Node* root, int x) {
-  Node* cur = root;
-  for(int bit = 21; bit >= 0; bit--) {
-    int p = (x & (1 << bit)) ? 1 : 0;
-    if(!cur -> child[p]) {
-      cur -> child[p] = new Node();
+void fizzBuzz(int n) {
+    for (int i = 1; i <= n; ++i) {
+        if (i % 3 == 0 && i % 5 == 0) {
+            cout << "FizzBuzz" << endl;
+        } else if (i % 3 == 0) {
+            cout << "Fizz" << endl;
+        } else if (i % 5 == 0) {
+            cout << "Buzz" << endl;
+        } else {
+            cout << i << endl;
+        }
     }
-    cur = cur -> child[p];
-  }
-}
-int xor_max_query(Node* root, int x) {
-  int ans = 0;
-  Node* cur = root;
-  for(int bit = 21; bit >= 0; bit--) {
-    int p = (x & (1 << bit)) ? 1 : 0;
-    if(cur -> child[1^p]) {
-      ans += (1 << bit);
-      cur = cur -> child[1^p];
-    } else if(cur -> child[p]) {
-      cur = cur -> child[p];
-    } else {
-      break;
-    }
-  }
-  return ans;
 }
 
-// vector<Node*> tree;
-Node* tree[4 * MAX_N];
-void merge(Node* &root, Node* root1, Node* root2) {
-  if(!root1 && !root2)
-    return;
-  root = new Node();
-  if(!root1) {
-    root = root2;
-    return;
-  }
-  if(!root2) {
-    root = root1;
-    return;
-  }
-  merge(root -> child[0], root1 -> child[0], root2 -> child[0]);
-  merge(root -> child[1], root1 -> child[1], root2 -> child[1]);
-}
-void build(int id, int l, int r, vector<int>& a) {
-  if(l == r) {
-    tree[id] = new Node();
-    insert(tree[id], a[l]);
-    return;
-  }
-  int mid = (l + r) / 2;
-  build(2 * id, l, mid, a);
-  build(2 * id + 1, mid + 1, r, a);
-  merge(tree[id], tree[2 * id], tree[2 * id + 1]);
-}
-int query(int id, int l, int r, int lq, int rq, int x) {
-  if(lq > r || l > rq)
-    return 0;
-  if(lq <= l && r <= rq)
-    return xor_max_query(tree[id], x);
-  int mid = (l + r) / 2;
-  int on_left = query(2 * id, l, mid, lq, rq, x);
-  int on_right = query(2 * id + 1, mid + 1, r, lq, rq, x);
-  return max(on_left, on_right);
-}
 int main() {
-  ios::sync_with_stdio(false);
-  cin.tie(0); 
-  int n;
-  cin >> n;
-  vector<int> a(n);
-  for(int i = 0; i < n; i++) 
-    cin >> a[i];
-  build(1, 0, n - 1, a);
-  int Q;
-  cin >> Q;
-  for(int q = 0; q < Q; q++) {
-    int l, r, x;
-    cin >> l >> r >> x;
-    l -= 1;
-    r -= 1;
-    cout << query(1, 0, n - 1, l, r, x) << '\n';
-  }
-  return 0;
-} 
+    int n;
+    // cout << "Enter the upper limit: ";
+    cin >> n;
+    fizzBuzz(n);
+    return 0;
+}

Untitled-1.bin

@@ -0,0 +1,14 @@
+import java.util.*;
+public class JAVA_4_multiLine {
+    public static void main(String args[]){
+        Scanner sc = new Scanner(System.in);
+        int index=1;
+        while(sc.hasNext()){
+            String s = sc.nextLine();
+
+            s=Integer.toString(index)+" "+s;
+            index+=1;
+            System.out.println(s);
+        }
+    }
+}

Untitled-1.cpp

@@ -0,0 +1,7 @@
+public class Java_1_BasicJava {
+
+    public static void main(String[] args) {
+        System.out.println("Hello, World.");
+        System.out.println("Hello, Java.");
+    }
+}

hackerRank-java/JAVA_4_multiLine.java

@@ -0,0 +1,12 @@
+import java.util.*;
+class Java_2_InputJava {
+    public static void main(String args[]){
+        Scanner sc = new Scanner(System.in);
+        int a = sc.nextInt();
+        int b = sc.nextInt();
+        int c=sc.nextInt();
+        System.out.println(a);
+        System.out.println(b);
+        System.out.println(c);
+    }
+}

hackerRank-java/Java_1_BasicJava.java

@@ -0,0 +1,22 @@
+import java.util.*;
+
+public class Java_3_ifElse{
+    public static void main(String args[]){
+        Scanner sc = new Scanner(System.in);
+
+        int n = sc.nextInt();
+
+        if(n%2==1){
+            System.out.println("Weird");
+        }else{
+            if(n>=2 && n<=5){
+                System.out.println("Not Weird");
+            }else if (n>=6 && n<=20){
+                System.out.println("Weird");
+            }else {
+                System.out.println("Not Weird");
+            }
+        }
+
+    }
+}

hackerRank-java/Java_2_InputJava.java

@@ -0,0 +1,21 @@
+import java.util.*;
+public class Java_5_try_catch {
+    public static void main(String args[]){
+        try{
+            Scanner sc = new Scanner(System.in);
+            int a = sc.nextInt();
+            int b = sc.nextInt();
+            
+            if(a>=0 && b>=0){
+                int area = (a*b);
+                System.out.println(area);       
+            }
+            else{
+                throw new Exception("Breadth and height must be positive");
+            }
+        }catch(Exception e){
+            System.out.println(e);
+        }
+        
+    }
+}

hackerRank-java/Java_3_ifElse.java

@@ -0,0 +1,15 @@
+import java.util.Calendar;
+
+public class Java_6_Calendar {
+    enum Days{
+        SUNDAY, MONDAY, TUESDAY, WEDNESDAY, THURSDAY, FRIDAY, SATURDAY
+    }
+    public static  void main(String args[]){
+        Calendar c = Calendar.getInstance();
+        c.set(2024,11,5);
+//        System.out.println(c.getTime());
+        int x = c.get(Calendar.DAY_OF_WEEK);
+        String Day[]={"SUNDAY", "MONDAY", "TUESDAY", "WEDNESDAY", "THURSDAY", "FRIDAY", "SATURDAY"};
+        System.out.println(Day[x-1]);
+    }
+}