Abhishek Srivastava abhishek2x

## union_find.cpp
struct DisjointSet {
    vector<int> parent;
    vector<int> size;

    DisjointSet(int maxSize) {
        parent.resize(maxSize);
        size.resize(maxSize);
        for (int i = 0; i < maxSize; i++) {
            parent[i] = i;
            size[i] = 1;

## webpack.config.js
const path = require('path');

module.exports = {
  entry: './src/index.js',
  output: {
    path: path.resolve(__dirname, 'dist'),
    filename: 'bundle.js',
  },
};

## 2d.cpp
/*!
* Copyright (c) 2020 Abhishek Srivastava
*/

#include <bits/stdc++.h>
using namespace std;
#define ll long long int

int main(){

## binf.cpp
/*!
* Copyright (c) 2020 Abhishek Srivastava
*/

#include <bits/stdc++.h>
using namespace std;
#define ll long long int

int main(){

## inf.cpp
/*!
* Copyright (c) 2020 Abhishek Srivastava
*/

#include <bits/stdc++.h>
using namespace std;
#define ll long long int

int binaryPlay(vector<int> a, int l, int h, int key){
    while(l<=h){

## near.cpp
/*!
* Copyright (c) 2020 Abhishek Srivastava
*/

#include <bits/stdc++.h>
using namespace std;
#define ll long long int

int main(){

## cnt.cpp
/*!
* Copyright (c) 2020 Abhishek Srivastava
*/

#include <bits/stdc++.h>
using namespace std;
#define ll long long int


int countRotations(int arr[], int low, int high)

## sq.cpp
/*!
* Copyright (c) 2020 Abhishek Srivastava
*/

/*
 For demstration of concept we are using
 int variable. But ideally we will prefer using
 double value with an Epison error estimation.
*/

## peak.cpp
/*!
* Finding the peak of an array
*/

#include <bits/stdc++.h>
using namespace std;
#define ll long long int

int main(){

## Ceil.cpp
/*!
* Finding Ceil of an Element in a Sorted array
*/

#include <bits/stdc++.h>
using namespace std;
#define ll long long int

int main(){
	struct DisjointSet {
	vector<int> parent;
	vector<int> size;

	DisjointSet(int maxSize) {
	parent.resize(maxSize);
	size.resize(maxSize);
	for (int i = 0; i < maxSize; i++) {
	parent[i] = i;
	size[i] = 1;
	const path = require('path');

	module.exports = {
	entry: './src/index.js',
	output: {
	path: path.resolve(__dirname, 'dist'),
	filename: 'bundle.js',
	},
	};
	/*!
	* Copyright (c) 2020 Abhishek Srivastava
	*/

	#include <bits/stdc++.h>
	using namespace std;
	#define ll long long int

	int main(){
	/*!
	* Copyright (c) 2020 Abhishek Srivastava
	*/

	/*
	For demstration of concept we are using
	int variable. But ideally we will prefer using
	double value with an Epison error estimation.
	*/
	/*!
	* Finding the peak of an array
	*/

	#include <bits/stdc++.h>
	using namespace std;
	#define ll long long int

	int main(){
	/*!
	* Finding Ceil of an Element in a Sorted array
	*/

	#include <bits/stdc++.h>
	using namespace std;
	#define ll long long int

	int main(){