Added new ques

DSA Sheets/Love Babbar DSA Sheet/01. Arrays/04. Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo/code.cpp

@@ -0,0 +1,58 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define db double
+#define ld long double
+#define el "\n"
+
+/*
+Input :-
+1
+12
+0 1 1 0 1 2 1 2 0 0 0 1
+
+Output :-
+0 0 0 0 0 1 1 1 1 1 2 2 
+*/
+
+// Time Complexity: O(n)
+// We are using Dutch National Flag Algorithm
+void sort012(int a[], int n){
+  int low = 0, mid = 0, high = n-1;
+
+  while(mid <= high){
+    if(a[mid] == 0)
+      swap(a[low++], a[mid++]);
+    else if(a[mid] == 1)
+      mid++;
+    else if(a[mid] == 2)
+      swap(a[mid], a[high--]);
+  }
+}
+
+int main(){
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+
+  int t;
+  cin >> t;
+  while (t--){
+    int n;
+    cin >> n;
+
+    int arr[n];
+    for (int i = 0; i < n; i++)
+      cin >> arr[i];
+
+    sort012(arr, n);
+
+    cout << "Solution - ";
+
+    for (int i = 0; i < n; i++)
+      cout << arr[i] << " "; 
+
+    cout << el;
+  }
+
+  return 0;
+}