coder2hacker · Sirajmolla · Oct 8, 2022 · Oct 2, 2022 · Oct 2, 2022 · Oct 2, 2022
diff --git a/07 check_subset.cpp b/07 check_subset.cpp
@@ -0,0 +1,32 @@
+#include<iostream>
+#include<cstring>
+using namespace std;
+
+bool isSubset(string s1,string s2){
+
+	int i = s1.length() - 1;
+	int j = s2.length()-1;
+
+	while(i>=0 and j>=0){
+		if(s2[j]==s1[i]){
+			i--;
+			j--;
+		}
+		else{
+			i--;
+		}
+	}
+	if(j==-1){
+		return true;
+	}
+	return false;
+
+}
+
+
+int main() {
+    string s1,s2;
+    cin>>s1>>s2;
+    cout<<isSubset(s1,s2) <<endl;
+
+}
diff --git a/AdityaMandage.json b/AdityaMandage.json
@@ -0,0 +1,6 @@
+{
+    "github_username": "AdityaMandage",
+    "favourite_programming_language": "Python",
+    "dream_company": "Microsoft",
+    "favourite_os": "Ubuntu"
+}
diff --git a/Amazon - LeetCode.pdf b/Amazon - LeetCode.pdf
diff --git a/Anmol's Resume.pdf b/Anmol's Resume.pdf
diff --git a/Armstrongnumber.py b/Armstrongnumber.py
@@ -0,0 +1,12 @@
+#python program to find arm strong number
+
+num = int(input("enter the number:"))
+temp = str(num)
+num_len = len(temp)
+arr = []
+for i in temp:
+    arr.append(int(i) ** num_len)
+if num == sum(arr):
+    print("arm strong")
+else:
+    print("not arm strong")
diff --git a/ArraySumStream.java b/ArraySumStream.java
@@ -0,0 +1,12 @@
+import java.util.Arrays;
+
+public class ArraySumStream {
+
+    public static void main(String[] args) {
+        int[] array = {10, 20, 30};
+        int sum = Arrays.stream(array).reduce(Integer::sum).getAsInt();
+        System.out.println(sum);
+
+        Arrays.stream(array).reduce(Integer::sum).ifPresent(System.out::println);
+    }
+}
diff --git a/Array_2D.java b/Array_2D.java
@@ -0,0 +1,30 @@
+
+public class Array_2D {
+
+	public static void main(String[] args) {
+
+		int[][] x= new int [3][3];
+		int[][] y = { {1,2,3}, {4,5,6}, {7,8,9}};
+		for(int row=0; row<3;row++)
+		{
+			for(int col=0;col<3;col++)
+			{
+				System.out.print(x[row][col]+" ");
+			}
+			System.out.println();
+		}
+
+		System.out.println("\n");
+		for(int row=0; row<3;row++)
+		{
+			for(int col=0;col<3;col++)
+			{
+				System.out.print(y[row][col]+" ");
+			}
+			System.out.println();
+		}
+
+
+	}
+
+}
diff --git a/BST.cpp b/BST.cpp
@@ -0,0 +1,146 @@
+#include<iostream>
+#include<queue>
+using namespace std;
+
+class node{
+	public:
+		int data;
+		node* left;
+		node*right;
+	node(int d)
+	{
+		data=d;
+		left=NULL;
+		right=NULL;
+	}
+};
+
+node* buildTree(node* root) {
+
+    cout << "Enter the data: " << endl;
+    int data;
+    cin >> data;
+    root = new node(data);    
+
+    if(data == -1) {
+        return NULL;
+    }
+
+    cout << "Enter data for inserting in left of " << data << endl;
+    root->left = buildTree(root->left);
+    cout << "Enter data for inserting in right of " << data << endl;
+    root->right = buildTree(root->right);
+    return root;
+
+}
+
+void levelOrderTraversal(node* root) {
+    queue<node*> q;
+    q.push(root);
+    q.push(NULL);
+
+    while(!q.empty()) {
+        node* temp = q.front();
+        q.pop();
+
+        if(temp == NULL) { 
+            //purana level complete traverse ho chuka hai
+            cout << endl;
+            if(!q.empty()) { 
+                //queue still has some child ndoes
+                q.push(NULL);
+            }  
+        }
+        else{
+            cout << temp -> data << " ";
+            if(temp ->left) {
+                q.push(temp ->left);
+            }
+
+            if(temp ->right) {
+                q.push(temp ->right);
+            }
+        }
+    }
+}
+
+void inOrder(node* root)
+{
+	if(root==NULL)
+	{
+		return;
+	}
+	inOrder(root->left);
+	cout<< root->data <<" ";
+	inOrder(root->right);
+}
+
+void preOrder(node* root)
+{
+	if(root==NULL)
+	{
+		return;
+	}
+	cout<< root->data <<" ";
+	preOrder(root->left);
+	preOrder(root->right);
+}
+
+void postorder(node* root) {
+    //base case
+    if(root == NULL) {
+        return ;
+    }
+
+    postorder(root->left);
+    postorder(root->right);
+    cout << root-> data << " ";
+
+}
+void buildfromOrderLevel(node* &root)
+{
+	queue<node*>q;
+	cout<<"Enter data for root"<<endl;
+	int data;
+	cin>>data;
+	root=new node(data);
+	q.push(root);
+	while(!q.empty())
+	{
+		node* temp=q.front();
+		q.pop();
+		cout<<"Enter left node for "<<temp->data<<endl;
+		int leftData;
+		cin>>leftData;
+		if(leftData!=-1)
+		{
+			temp->left=new node(leftData);
+			q.push(temp->left);
+		}
+		cout<<"Enter right node for "<<temp->data<<endl;
+		int rightData;
+		cin>>rightData;
+		if(rightData!=-1)
+		{
+			temp->right=new node(rightData);
+			q.push(temp->right);
+		}
+	}
+}
+int main()
+{
+	node* root=NULL;
+	buildfromOrderLevel(root);
+	levelOrderTraversal(root);
+	/*cout<<"....Creating a tree...."<<endl;
+	root=buildTree(root);*/
+	cout << "Printing the level order tracersal output " << endl;
+    levelOrderTraversal(root);
+    cout << "inorder traversal is:  ";
+    inOrder(root); 
+    cout << endl << "preorder traversal is:  ";
+    preOrder(root); 
+    cout << endl << "postorder traversal is:  ";
+    postorder(root); 
+	return 0;
+}
diff --git a/Binary_to_Decimal.cpp b/Binary_to_Decimal.cpp
@@ -15,6 +15,6 @@ int main(void)
     string binary;
     cout << "Enter a binary number: ";
     cin >> binary;
-    cout << "The decimal representation of binary number " << binary << " is " << bintodec(binary) << endl;
+    cout << "The Decimal Representation of the Binary Number " << binary << " is " << bintodec(binary) << endl;
     return 0;
-}
+}
diff --git a/BlindDSASheet b/BlindDSASheet
@@ -0,0 +1,92 @@
+Hi folks,
+
+I found a list of Blind 75 Leetcode problems. Sharing it as I found it very useful.
+
+Happy Coding!
+
+Array
+Two Sum
+Best Time to Buy and Sell Stock
+Contains Duplicate
+Product of Array Except Self
+Maximum Subarray
+Maximum Product Subarray
+Find Minimum in Rotated Sorted Array
+Search in Rotated Sorted Array
+3 Sum
+Container With Most Water
+Binary
+Sum of Two Integers
+Number of 1 Bits
+Counting Bits
+Missing Number
+Reverse Bits
+Dynamic Programming
+Climbing Stairs
+Coin Change
+Longest Increasing Subsequence
+Longest Common Subsequence
+Word Break Problem
+Combination Sum
+House Robber
+House Robber II
+Decode Ways
+Unique Paths
+Jump Game
+Graph
+Clone Graph
+Course Schedule
+Pacific Atlantic Water Flow
+Number of Islands
+Longest Consecutive Sequence
+Alien Dictionary (Leetcode Premium)
+Graph Valid Tree (Leetcode Premium)
+Number of Connected Components in an Undirected Graph (Leetcode Premium)
+Interval
+Insert Interval
+Merge Intervals
+Non-overlapping Intervals
+Meeting Rooms (Leetcode Premium)
+Meeting Rooms II (Leetcode Premium)
+Linked List
+Reverse a Linked List
+Detect Cycle in a Linked List
+Merge Two Sorted Lists
+Merge K Sorted Lists
+Remove Nth Node From End Of List
+Reorder List
+Matrix
+Set Matrix Zeroes
+Spiral Matrix
+Rotate Image
+Word Search
+String
+Longest Substring Without Repeating Characters
+Longest Repeating Character Replacement
+Minimum Window Substring
+Valid Anagram
+Group Anagrams
+Valid Parentheses
+Valid Palindrome
+Longest Palindromic Substring
+Palindromic Substrings
+Encode and Decode Strings (Leetcode Premium)
+Tree
+Maximum Depth of Binary Tree
+Same Tree
+Invert/Flip Binary Tree
+Binary Tree Maximum Path Sum
+Binary Tree Level Order Traversal
+Serialize and Deserialize Binary Tree
+Subtree of Another Tree
+Construct Binary Tree from Preorder and Inorder Traversal
+Validate Binary Search Tree
+Kth Smallest Element in a BST
+Lowest Common Ancestor of BST
+Implement Trie (Prefix Tree)
+Add and Search Word
+Word Search II
+Heap
+Merge K Sorted Lists
+Top K Frequent Elements
+Find Median from Data Stream
diff --git a/BubbleSort1.java b/BubbleSort1.java
@@ -0,0 +1,33 @@
+import java.util.*;
+class BubbleSort1{
+    // Bubble Sort Function 
+    public static void BubbleSort(int arr[]){
+        for(int i=0;i<=arr.length-1;i++){
+            // Inner loop to visit two adjacent elements
+            for(int j=0;j<arr.length-1-i;j++){
+                // Swaping two adjacent elements 
+                if (arr[j]>arr[j+1]){
+                    int temp=arr[j];
+                    arr[j]=arr[j+1];
+                    arr[j+1]=temp;
+                }
+            }
+        }
+    }
+    // Function to print Array
+    public static void PrintArray(int arr[]){
+        for (int i=0;i<arr.length;i++)
+            System.out.print(arr[i]+" ");
+    }
+
+    public static void main(String[] args){
+        Scanner sc=new Scanner(System.in);
+        int arr[]=new int[5];
+        for(int i=0;i<arr.length;i++)
+            arr[i]=sc.nextInt();
+        sc.close();
+
+        BubbleSort(arr);
+        PrintArray(arr);
+    }
+}