Merge pull request #26 from Vanshi2504ka/main

Added SpotifyClone static template

Author: Shubhamjain287

BinarySearch.java

@@ -0,0 +1,28 @@
+class BinarySearch 
+{
+	int binarySearch(int arr[], int l, int r, int x)
+	{
+		if (r >= l) {
+			int mid = l + (r - l) / 2;
+			if (arr[mid] == x)
+				return mid;
+			if (arr[mid] > x)
+				return binarySearch(arr, l, mid - 1, x);
+			return binarySearch(arr, mid + 1, r, x);
+		}
+		return -1;
+	}
+	public static void main(String args[])
+	{
+		BinarySearch ob = new BinarySearch();
+		int arr[] = { 2, 3, 4, 10, 40 };
+		int n = arr.length;
+		int x = 10;
+		int result = ob.binarySearch(arr, 0, n - 1, x);
+		if (result == -1)
+			System.out.println("Element not present");
+		else
+			System.out.println("Element found at index "
+							+ result);
+	}
+}

DSA/1TraversalINCLL.cpp

@@ -0,0 +1,37 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+struct  Node
+{
+	int data;
+	Node *next;
+	Node(int y)
+	{
+		data = y;
+		next = NULL;
+	}
+};
+
+void print(Node *head)
+{
+	if(head == NULL){
+		return;
+	}
+	Node *value = head;
+	do{
+		cout<<value->data<<" ";
+		value = value->next;
+	}
+	while(value != head);
+
+}
+int main()
+{
+  Node *head = new Node(10);
+  head->next = new Node(11);
+  head->next->next = new Node(12);
+  head->next->next->next = new Node(13);
+  head->next->next->next->next = head;
+  print(head);
+	return 0;
+}

DSA/2InsertATBeginCLL.cpp

@@ -0,0 +1,62 @@
+// Time Complexity = O👎
+
+
+#include<bits/stdc++.h>
+using namespace std;
+struct Node
+{
+	int data;
+	Node *next;
+	Node(int d){
+		data = d;
+		next = NULL;
+	}
+};
+
+void print(Node *head)
+{
+	if(head == NULL){
+		return;
+	}
+	Node *value = head;
+	do{
+		cout<<value->data<<" ";
+		value = value->next;
+	}
+	while(value != head);
+
+}
+
+Node *InsertBegin(Node *head, int data)
+{
+	Node *temp = new Node(data);
+	if(head == NULL){
+		temp->next = temp;
+		return temp;
+	}
+	else{
+		temp->next = head->next;
+		head->next = temp;
+		int t =  head->data;
+		head->data = temp->data;
+        temp->data = t;
+        return head;
+	}
+}
+
+
+int main()
+{
+  Node *head = new Node(10);
+  head->next = new Node(11);
+  head->next->next = new Node(12);
+  head->next->next->next = new Node(13);
+  head->next->next->next->next = head;
+  print(head);
+  cout<<endl;
+  head = InsertBegin(head, 9);
+  print(head);
+	
+
+	return 0;
+}

DSA/3InsertAtEndCLL.cpp

@@ -0,0 +1,60 @@
+// Time Complexity = O(n)
+
+#include<bits/stdc++.h>
+using namespace std;
+
+struct Node
+{
+	int data;
+	Node *next;
+	Node(int y){
+		data = y;
+		next=NULL;
+	}
+};
+void print(Node *head)
+{
+	if(head == NULL){
+		return;
+	}
+	Node *value = head;
+	do{
+		cout<<value->data<<" ";
+		value = value->next;
+	}
+	while(value != head);
+
+}
+
+Node *InsertEnd(Node *head, int data)
+{
+	Node *temp = new Node(data);
+	if(head == NULL){
+		temp->next = temp;
+		return temp;
+	}
+	else{
+		temp ->next = head->next;
+		head->next = temp;
+		int t = temp->data;
+		temp->data = head->data;
+		head->data = t;
+		return temp;
+	}
+}
+int main()
+{
+  Node *head = new Node(10);
+  head->next = new Node(11);
+  head->next->next = new Node(12);
+  head->next->next->next = new Node(13);
+  head->next->next->next->next = head;
+  print(head);
+  cout<<endl;
+  int data;
+  cin>>data;
+  head = InsertEnd(head, data);
+  print(head);
+
+	return 0;
+}

DSA/4DeleteHeadCLL.cpp

@@ -0,0 +1,56 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+struct Node 
+{
+	int data;
+	Node *next;
+	Node(int y){
+		data = y;
+		next= NULL;
+	}
+};
+
+void print(Node *head)
+{
+	if(head == NULL){
+		return ;
+	}
+	Node *curr = head;
+	do{
+		cout<<curr->data<<" ";
+		curr = curr->next;
+	}
+	while(curr!=head);
+}
+
+Node *deleteHead(Node *head)
+{
+	if(head == NULL){
+		return NULL;
+	}
+	if(head->next == head){
+		delete head;
+		return NULL;
+	}
+	head->data = head->next->data;
+	Node * temp = head->next;
+	head->next = head->next->next;
+	delete temp;
+	return head;
+
+}
+int main()
+{
+  Node *head = new Node(10);
+  head->next = new Node(11);
+  head->next->next = new Node(12);
+  head->next->next->next = new Node(13);
+  head->next->next->next->next = head;
+  print(head);
+  cout<<endl;
+  head = deleteHead(head);
+  print(head);
+	
+	return 0;
+}

DSA/5DeleteKthNodeCLL.cpp

@@ -0,0 +1,79 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+struct Node
+{
+	int data;
+	Node *next;
+	Node(int d){
+		data = d;
+		next = NULL;
+	}
+};
+
+void print(Node *head)
+{
+	if(head == NULL){
+		return;
+	}
+	Node *value = head;
+	do{
+		cout<<value->data<<" ";
+		value = value->next;
+	}
+	while(value != head);
+}
+
+Node *deleteHead(Node *head)
+{
+	if(head == NULL){
+		return NULL;
+	}
+	if(head->next == head){
+		delete head;
+		return NULL;
+	}
+	head->data = head->next->data;
+	Node * temp = head->next;
+	head->next = head->next->next;
+	delete temp;
+	return head;
+
+}
+
+Node *DeleteKth(Node *head, int k)
+{
+   if(head == NULL){
+   	return head;
+   }
+   if(k==1){
+   	return deleteHead(head);
+   }
+   Node *curr = head;
+   for (int i = 0; i < k-2; ++i)
+   {
+      curr = curr->next;
+   }
+   Node *temp = curr->next;
+   curr->next = curr->next->next;
+   delete temp;
+   return head;
+}
+
+
+int main()
+{
+  Node *head = new Node(10);
+  head->next = new Node(11);
+  head->next->next = new Node(12);
+  head->next->next->next = new Node(13);
+  head->next->next->next->next = head;
+  print(head);
+  cout<<endl;
+  int k;
+  cin>>k;
+  head = DeleteKth(head, k);
+  print(head);
+
+	return 0;
+}

DSA/ATM_CARD_VALIDATOR.java

@@ -0,0 +1,56 @@
+//Program to validate any ATM card.
+import java.util.Scanner; 
+
+class ATM_CARD_VALIDATOR{
+    public static boolean TwoDigit(int n) {
+        int i=0; 
+        i+=n/10; 
+        if(i>=1)
+        return true;
+        else   
+        return false;
+        } 
+    public static void main(String args[]){
+        int[] cnum = new int[16];
+        int x=0,y=0; 
+        try (Scanner scn = new Scanner(System.in)) {
+            for(int i=0;i<16;i++) 
+            {
+                if(i+1==1){
+                    System.out.println("Enter the " + (i+1) +"st digit of the card:");
+                    cnum[i] = scn.nextInt();
+                    }        
+                else if(i+1==2) { 
+                    System.out.println("Enter the " + (i+1) +"nd digit of the card:");
+                    cnum[i] = scn.nextInt();       
+                    }       
+                else if(i+1==3) {     
+                    System.out.println("Enter the " + (i+1) +"3rd digit of the card:");
+                    cnum[i] = scn.nextInt();     
+                    }        
+                else{     
+                    System.out.println("Enter the " + (i+1) +"th digit of the card:");
+                    cnum[i] = scn.nextInt();
+                    }     
+
+            }
+        }
+    for(int i=cnum.length-2;i>=1;i=i-2)   
+    {        
+        cnum[i+1]+=cnum[i-1]*2;  
+        if(TwoDigit(cnum[i+1])){     
+            cnum[i+1]=cnum[i+1]-9; 
+            }             
+    }    
+    for(int i=0;i<16;i=i+2)  
+    {     
+        y+=cnum[i];    
+    }   
+    if((x+y)%2==0){      
+        System.out.println("The CARD is Valid");
+    }   
+    else{
+        System.out.println("The CARD is Not Valid");
+    }
+}
+}