height of a binary tree

#include <stdio.h> int main() { int i, j, n; printf("Enter value of n : "); scanf("%d", &n); for(i=n/heart star pattern

@@ -0,0 +1,51 @@
+#include <stdio.h>
+
+int main()
+{
+    int i, j, n;
+
+    printf("Enter value of n : ");
+    scanf("%d", &n);
+
+    for(i=n/2; i<=n; i+=2)
+    {
+        for(j=1; j<n-i; j+=2)
+        {
+            printf(" ");
+        }
+
+        for(j=1; j<=i; j++)
+        {
+            printf("*");
+        }
+
+        for(j=1; j<=n-i; j++)
+        {
+            printf(" ");
+        }
+
+        for(j=1; j<=i; j++)
+        {
+            printf("*");
+        }
+
+        printf("\n");
+    }
+
+    for(i=n; i>=1; i--)
+    {
+        for(j=i; j<n; j++)
+        {
+            printf(" ");
+        }
+
+        for(j=1; j<=(i*2)-1; j++)
+        {
+            printf("*");
+        }
+
+        printf("\n");
+    }
+
+    return 0;
+}

02 rotated_search.cpp

@@ -0,0 +1,57 @@
+#include<iostream>
+#include<vector>
+using namespace std;
+
+int rotated_search(vector<int> a,int key) {
+	int n = a.size();
+
+	//Logic
+	int s = 0;
+	int e = n - 1;
+
+	while(s<=e){
+		int mid = (s+e)/2;
+
+		if(a[mid]==key){
+			return mid;
+		}
+
+		//2 cases
+		if(a[s]<=a[mid]){
+			//left
+			if(key>=a[s] and key<=a[mid]){
+				e = mid - 1;
+			}
+			else{
+				s = mid + 1;
+			}
+
+		}
+		else{
+			//right
+
+			if(key>=a[mid] and key<=a[e]){
+				s = mid + 1;
+			}
+			else{
+				e = mid - 1;
+			}
+
+		}
+
+	}
+	return -1;
+
+}
+
+
+
+int main() {
+
+
+	vector<int> a{4,5,6,7,0,1,2,3};
+	int key;
+	cin>>key;
+	cout<< rotated_search(a,key) <<endl;
+	return 0;
+}

3sum.cpp

@@ -0,0 +1,43 @@
+
+// 3 SUM Solution
+
+
+class Solution {
+public:
+    vector<vector<int>> threeSum(vector<int>& nums) {
+        int N = nums.size();
+        vector<vector<int>> result;
+        if (N < 2) {
+            result;
+        }
+        sort(begin(nums), end(nums));
+        for (int i = 0; i < N - 2 && nums[i] <= 0; i++) {
+            if (i > 0 && nums[i] == nums[i - 1]) {
+                continue;
+            }
+            int j = i + 1;
+            int k = N - 1;
+            while (j < k) {
+                int sum = nums[i] + nums[j] + nums[k];
+                if (sum < 0) {
+                    j++;
+                }
+                else if (sum > 0) {
+                    k--;
+                }
+                else {
+                    result.push_back({nums[i], nums[j], nums[k]});
+                    k--;
+                    while (j < k && nums[k] == nums[k + 1]) {
+                        k--;
+                    }
+                    j++;
+                    while (j < k && nums[j] == nums[j - 1]) {
+                        j++;
+                    }
+                }
+            }
+        }
+        return result;
+    }
+};

AGGRCOW.cpp

@@ -0,0 +1,72 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+#define endl '\n'
+#define vi vector<int>
+#define pii pair<int, int>
+#define all(c) c.begin(), c.end()
+#define pb push_back
+#define f first
+#define s second
+#define int long long
+#define fo(i, n) for (int i = 0; i < n; i++)
+#define IOS ios::sync_with_stdio(0);
+vector<int> arr(100100);
+int n,c;
+
+bool check(int x){
+    int sum =0;int count = 1;
+    int left =0;
+    for(int i =1; i<n;i++){
+        sum += arr[i]-arr[i-1];
+        if(sum >= x)
+        {
+            count++;
+            sum=0;
+        }
+    }
+    return (count >=   c);
+}
+void solve();
+signed main()
+{
+
+    IOS
+    cin.tie(0);
+    cout.tie(0);
+
+    int _t;cin >> _t;while (_t--) solve();
+
+    }
+
+
+void solve(){
+    cin>>n>>c;
+    arr.resize(n);
+
+    for(int i = 0; i<n;i++){
+        cin>>arr[i];
+    }
+    sort(arr.begin(),arr.end());
+
+    int hi=0; int lo =0 ;
+    for(int i =1; i<n;i++){
+        hi =max(arr[i]-arr[i-1],hi);
+        lo = min(arr[i]-arr[i-1],lo);
+    }
+    int ans =lo;
+    while(hi>= lo){
+        int mid =lo + (hi-lo)/2;
+
+        if(check(mid)){
+            lo =mid+1;
+            ans  = mid;
+        }
+        else{
+
+           hi = mid-1;
+        }
+    }
+    cout<<ans<<endl;
+
+}

Abstract data types

@@ -0,0 +1,66 @@
+#include<iostream>
+#include<stdlib.h>
+using namespace std;
+struct stocked{
+	int stcks[5];
+	int topq;};
+stocked stonks;
+int main(){
+	int pili,takbo,numstock; bool runner=true;stonks.topq=-1;
+		while(runner){
+cout << "      #-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#" <<"\n";	
+cout << "      #- - -  Abstract Data Types  - - -#" <<"\n";
+cout << "      # - - -   STACK OPERATION   - - - #" <<"\n";
+cout << "      #  - -    [1] PUSH           - -  #" <<"\n";
+cout << "      # - - -   [2] POP           - - - #" <<"\n"; 
+cout << "      #  - -    [3] DISPLAY        - -  #" <<"\n";
+cout << "      #-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#" <<"\n";	
+cout << "      #Choose [1-3]: ";	
+		cin >> pili;
+	switch(pili){
+	case 1: {
+ 				if(stonks.topq == (5-1)){
+ 				cout <<"\n" <<"\n";
+cout << "      ! ! ! ! ! -STACK IS FULL- ! ! ! ! !" <<"\n";
+} else{  system("cls");
+cout << "      - - - - - - - - - - - - - - - - - -" <<"\n";
+cout << "      -Element to Push: ";
+	cin >> numstock;
+cout << "      - - - - - - - - - - - - - - - - - -" <<"\n";
+	stonks.topq=stonks.topq +1;
+stonks.stcks[stonks.topq]=numstock;
+cout <<"\n";
+cout << "      - - - - - - - - - - - - - - - - - -" <<"\n";	
+cout << "       - - - - - - PUSH ADDED- - - - - -" <<"\n";
+cout << "      - - - - - - - - - - - - - - - - - -" <<"\n";	} break;}
+case 2: { 
+if(stonks.topq == -1){
+cout <<"\n" <<"\n";
+cout << "      ! ! ! ! ! -STACK IS EMPTY- ! ! ! ! !" <<"\n";		}
+else{	system("cls");
+numstock = stonks.stcks[stonks.topq];
+cout << "      + + + + + + + + + + + + + + + + + + +" <<"\n";		
+cout << "      +         POP Element: " << stonks.stcks[stonks.topq] << "            +";
+stonks.topq = stonks.topq-1;		}
+cout << "\n";
+cout << "      + + + + + + + + + + + + + + + + + + +" <<"\n" <<"\n"; break; }
+case 3: {system("cls");
+if(stonks.topq == -1){
+cout << "     / / / / / / / / / / / / / / / / / / /" <<"\n";
+cout << "      ! ! ! ! ! -STACK IS EMPTY- ! ! ! ! !" <<"\n";
+cout << "     / / / / / / / / / / / / / / / / / / /" <<"\n";}	
+else{cout <<"\n"; 
+cout << "     - - - - - - - - - - - - - - - - - - - - - -" <<"\n";	
+for(numstock=stonks.topq; numstock>=0; numstock--){
+cout <<"    "; cout << " ["<< stonks.stcks[numstock] <<"] " << " " ;} }cout <<"\n"; 
+cout << "     - - - - - - - - - - - - - - - - - - - - - -" <<"\n";	break;}
+default:{cout << "\n";
+cout <<"     ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~" <<"\n"; 
+cout <<"    | | | | | | |ERROR: ONLY [1-3]| | | | | | | |" <<"\n"; 
+cout <<"     ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~" <<"\n" << "\n";break; }}
+cout<<"\n" <<"\n";
+cout<<  "      -#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-#-" << "\n";		
+cout<<  "      #    Back to MAIN MENU [0 | 1]?   #" <<"\n";
+cout<<  "                       "; cin>>takbo;   if(takbo==1){  }else{ runner=false; } system("cls");
+}
+system(“pause”);

Add 3 numbers

@@ -0,0 +1,17 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+  double num1, num2,num3, Sum;
+  cout << "Enter three numbers: ";
+
+  // stores two floating point numbers in num1 and num2 respectively
+  cin >> num1 >> num2>>num3;
+
+  // performs multiplication and stores the result in product variable
+  product = num1 + num2 + num3;  
+
+  cout << "Sum = " << Sum;    
+
+  return 0;
+}

AllocateMinNoOfPages

@@ -0,0 +1,42 @@
+class AllocateMinNoOfPages 
+{
+    public static int findPages(int[]A,int N,int M)
+    {
+        int sum = 0;
+        int maxNum = 0;
+        for(int i = 0;i<N;i++){
+            sum+=A[i];
+            maxNum = Math.max(maxNum,A[i]);
+        }
+
+        int low = maxNum;
+        int high = sum;
+        int res = -1;
+        while(low<=high){
+            int mid = low+(high-low)/2;
+            if(isValid(A,N,M,mid)){
+                res = mid;
+                high = mid-1;
+            }else{
+                low = mid+1;
+            }
+        }
+        return res;
+
+    }
+    public static boolean isValid(int[] A,int N,int M,int max){
+        int student = 1;
+        int s = 0;
+        for(int i = 0;i<N;i++){
+            s+=A[i];
+            if(s>max){
+                student++;
+                s = A[i];
+            }
+            if(student>M){
+                return false;
+            }
+            }
+            return true;
+        }
+    };

AnagramOfStrings.java

@@ -0,0 +1,39 @@
+# This is the code for finding anagram of the string in java
+
+//Anagram : a word or phrase that is made by arranging the letters of another word or phrase in a different order
+//Example: "Worth" is an anagram of ‘throw’.
+//This java anagram program compares the letters of both words/strings entered and then shows
+//wheather they are anagram of each other or not
+
+import java.util.Scanner;
+public class AnagramOfStrings {
+
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.print("Enter first string : ");
+		String a = sc.nextLine();
+		System.out.print("Enter second string : ");
+		String b = sc.nextLine();
+
+		boolean isAnagram = false;
+		boolean visited[] = new boolean[b.length()];
+
+		if (a.length()==b.length()) {
+			for (int i=0; i<a.length(); i++) {
+				isAnagram = false;
+				for (int j=0; j<b.length(); j++) {
+					if (a.charAt(i)==b.charAt(j) && !visited[j]) {
+						isAnagram = true;
+						visited [j] = true;
+						break;
+					}
+				}if (!isAnagram) break;
+			}
+		}
+		if (isAnagram) System.out.println("an anagram");
+		else System.out.println("not an anagram");
+	}
+
+}
+
+