Create CPP code for creating Anagrams

CPP code for creating Anagrams

@@ -0,0 +1,29 @@
+#include <bits/stdc++.h>
+using namespace std;
+class Solution {
+public:
+   int minSteps(string s, string t) {
+      int n = s.size();
+      map <char, int> m1;
+      for(int i = 0; i < s.size(); i++){
+         m1[s[i]]++;
+      }
+      int ret = n;
+      map <char, int> m2;
+      for(int i = 0; i < t.size(); i++){
+         m2[t[i]]++;
+      }
+      map <char, int> :: iterator it = m1.begin();
+      while(it != m1.end()){
+         //cout << it->first << " " << it->second << " " << m2[it->first] << endl;
+         int x = min(it->second, m2[it->first]);
+         ret -= x;
+         it++;
+      }
+      return ret;
+   }
+};
+main(){
+   Solution ob;
+   cout << (ob.minSteps("yxy", "xyx"));
+}

N Queen Problem

@@ -0,0 +1,65 @@
+#include<iostream>
+using namespace std;
+bool isSafe(int** arr, int x, int y, int n){
+    for(int row=0; row < x; row++){
+        if(arr[row][y]==1){
+            return false;
+        }
+    }
+    int row = x;
+    int col;
+    while(row >= 0 && col >=0){
+        if(arr[row][col]==1){
+            return false;
+        }
+        row--;
+        col--;
+    }
+    row = x;
+    col = y;
+    while(row >= 0 && col < n){
+        if(arr[row][col]==1){
+            return false;
+        }
+        row--;
+        col++;
+    }
+    return true;
+}
+bool nQueen(int** arr, int x, int n){
+    if(x >= n){
+        return true;
+    }
+    for(int col=0; col < n; col++){
+        if(isSafe(arr, x, col, n)){
+            arr[x][col]=1;
+
+            if(nQueen(arr, x+1, n)){
+                return true;
+            }
+            arr[x][col] = 0;
+        }
+    }
+    return false;
+}
+int main(){
+    int n;
+    cin>>n;
+    int** arr=new int*[n];
+    for(int i=0; i<n; i++){
+        arr[i]=new int[n];
+        for(int j=0; j<n; j++){
+            arr[i][j]=0;
+        }
+    }
+    if(nQueen(arr, 0, n)){
+        for(int i=0; i<n; i++){
+
+        for(int j=0; j<n; j++){
+            cout<<arr[i][j]<<" "; 
+        }cout<<endl;
+        }
+    }
+
+    return 0;
+}

binary search in java

@@ -0,0 +1,22 @@
+public class BinarySearch {
+   public static void main(String args[]){
+      int array[] = {10, 20, 25, 57, 63, 96};
+      int size = array.length;
+      int low = 0;
+      int high = size-1;
+      int value = 25;
+      int mid = 0;
+      mid = low +(high-low)/2;
+
+      while(low<=high){
+         if(array[mid] == value){
+            System.out.println(mid);
+            break;
+         }
+         else if(array[mid]<value)
+         low = mid+1;
+         else high = mid - 1;
+      }
+      mid = (low+high)/2;
+   }
+}

write cpp code for merging algo with and without use of inbuilt method.

@@ -0,0 +1,15 @@
+void mergeArrays(int arr1[], int arr2[], int n1,
+  int n2, int arr3[]) {
+  int i = 0, j = 0, k = 0;
+  while (i < n1 && j < n2) {
+    if (arr1[i] < arr2[j])
+      arr3[k++] = arr1[i++];
+    else
+      arr3[k++] = arr2[j++];
+  }
+  while (i < n1)
+    arr3[k++] = arr1[i++];
+
+  while (j < n2)
+    arr3[k++] = arr2[j++];
+}