Skip to content

Instantly share code, notes, and snippets.

#include <iostream>
using namespace std;
void printArrayReverse(int arr[], int start, int end) {
for(int i = end ; i >= start; i--) {
cout<<arr[i]<<" ";
}
}
int main() {
//code
#include <iostream>
using namespace std;
int main() {
//code
int testCases;
cin>>testCases;
for(int i = 0 ; i < testCases; i++) {
int n;
cin>>n;
#include <iostream>
using namespace std;
int main() {
//code
int testCases;
cin>>testCases;
for(int i = 0 ; i < testCases; i++) {
int n;
cin>>n;
#include <iostream>
using namespace std;
/**
We could have done this problem by coounting the occurence of elements
*/
int main() {
int testCases;
cin>>testCases;
for(int i = 0 ; i < testCases; i++) {
int n;
#include <iostream>
using namespace std;
int main() {
//code
int testCases;
cin>>testCases;
for(int i = 0 ; i < testCases; i++) {
int n;
cin>>n;
#include <iostream>
using namespace std;
int main() {
//code
int testCases;
cin>>testCases;
for(int i = 0 ; i < testCases; i++) {
int n,m;
cin>>n;
#include <iostream>
using namespace std;
int main() {
//code
int testCases;
cin>>testCases;
for(int i = 0; i < testCases; i++) {
int n;
cin>>n;
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int testCases, arrayLength;
cin>>testCases;
for(int i = 0; i < testCases; i++) {
cin>>arrayLength;
int arr[arrayLength];
#include <iostream>
using namespace std;
int main() {
int arrayLength,sum,testCases;
cin>>testCases;
for(int i = 0; i < testCases; i++) {
cin>>arrayLength>>sum;
int arr[arrayLength];
for(int j = 0 ; j < arrayLength; j++) {