├── Arrays
    ├── Array_insert_at_end
    └── Contest
    │   ├── Get_the_shadow.cpp
    │   ├── Nearest_perfect_Square.cpp
    │   └── The_conversion_to_One.cpp
├── Binary Searcg Tree
    ├── Inorder traversal.cpp
    ├── Insert_node.cpp
    ├── Level_order.cpp
    ├── Minimum_element.cpp
    ├── Print BST in  A GIVEN RANGE
    └── Searchanode.cpp
├── Bit Magic
    ├── BinarytoGray.cpp
    ├── Bit_difference.cpp
    ├── First_set_bit.cpp
    ├── Longest_Consecutive1's.cpp
    ├── Number_is_sparse.cpp
    ├── Power_of_2.cpp
    ├── Rightmost_different_bit.cpp
    └── kth_bit_set.cpp
├── Contest
    ├── Hashing
    │   ├── K_Sum.cpp
    │   ├── XOR_Pair.cpp
    │   └── kth_smallest_distance.cpp
    └── Searching
    │   ├── A_Boolean_matRIX_problem.cpp
    │   ├── Toggle_the_middle.cpp
    │   └── Without_Adjacent.cpp
├── Greedy
    └── Shop in Candy Store.cpp
├── Hashing
    └── Pair of Element.cpp
├── LICENSE
├── Mathematics
    ├── Absolute Value.cpp
    ├── Addition_Under_Modulo.cpp
    ├── CelciusToFahrienheit.cpp
    ├── Digits_In_Factorial.cpp
    ├── Factorial_of_number.cpp
    ├── GP_Term.cpp
    ├── Modular_Multiplicative_Inverse.cpp
    ├── Multiplication_Under_Modulo.cpp
    ├── Primality_Test.cpp
    ├── Print 1 To N Without Loop
    └── Quadratic_Equation_Roots.cpp
├── README.md
├── Recursion
    └── Sum_of_digits.cpp
├── Strings
    ├── Anagram.cpp
    ├── Binary string.cpp
    ├── Distance_pattern_search.cpp
    ├── Implement_strstr.cpp
    ├── Keypad.cpp
    ├── Lexicographic.cpp
    ├── Maximum_occuring.cpp
    ├── Modified_string.cpp
    ├── Naive_pattern_search.cpp
    ├── Non_repeating.cpp
    ├── Panagram.cpp
    ├── Pattern_search_KMP.cpp
    ├── Rabincarp.cpp
    ├── Remove_characters.cpp
    ├── Repating_character.cpp
    ├── Reverse_words.cpp
    ├── String_rotated_ornot.cpp
    └── Sumofanoinastring.cpp
└── Tree
    ├── BTtoCdll.cpp
    ├── CheckforBalancedTree.cpp
    ├── Checkifsubtree.cpp
    ├── ContructBinaryTree.cpp
    ├── Count_noofsub_sum.cpp
    ├── Create_nodeat_samelevel.cpp
    ├── DiameterofBT.cpp
    ├── FOldable.cpp
    ├── LeftViewofBinaryTree.cpp
    ├── LevelOrderTraversal.cpp
    ├── LevelOrderTraversal_1.cpp
    ├── LevelOrderTraversal_SP.cpp
    ├── LowestCOmmonancestor.cpp
    ├── Makebinarytree.cpp
    ├── Maximu_sum_of_NON-ADJACENT.cpp
    ├── Maximum_diffe_bw_NA.cpp
    ├── Maximum_path_sum.cpp
    ├── Maximumwidthoftree.cpp
    ├── MirrorTree.cpp
    ├── Nodeatdistance.cpp
    ├── RightViewofBinaryTree.cpp
    ├── Serialize_and_deserialize.cpp
    ├── TreefromPostIN.cpp
    └── VerticalwidthofBT.cpp


/Arrays/Array_insert_at_end:
--------------------------------------------------------------------------------
 1 | #include <bits/stdc++.h>
 2 | #include <iostream>
 3 | using namespace std;
 4 | void insertAtEnd(int arr[],int sizeOfArray,int element);
 5 | 
 6 | void insertAtEnd(int arr[],int sizeOfArray,int element)
 7 | {
 8 |     arr[sizeOfArray-1]=element;
 9 | }
10 | 
11 | 
12 | int main() {
13 | 	int t;
14 | 	cin>>t;
15 | 	while(t--)
16 | 	{
17 | 	    int sizeOfArray;
18 | 	    cin>>sizeOfArray;
19 | 	    
20 | 	    int arr[sizeOfArray];
21 | 	    for(int i=0;i<sizeOfArray-1;i++)
22 | 	    cin>>arr[i];
23 | 	    
24 | 	    int element;
25 | 	    cin>>element;
26 | 	    
27 | 	    insertAtEnd(arr,sizeOfArray,element);
28 | 	    
29 | 	    for(int i=0;i<sizeOfArray;i++)
30 | 	    cout<<arr[i]<<" ";
31 | 	    
32 | 	    cout<<endl;
33 | 	}
34 | 	
35 | 	return 0;
36 | }
37 | 


--------------------------------------------------------------------------------
/Arrays/Contest/Get_the_shadow.cpp:
--------------------------------------------------------------------------------
 1 | 
 2 | #include <bits/stdc++.h>
 3 | using namespace std;
 4 | 
 5 | void repeated_Numbers(vector<int> A) {
 6 |     long long int act_a = 0;
 7 |     long long int act_sum_sq = 0;
 8 |     long long int exp_b;
 9 |     long long int exp_sum_sq;
10 |     long long int i = 0;
11 |     
12 |     for(i = 0; i < A.size(); i++){
13 |         act_a = act_a + (long long int)A[i];
14 |         act_sum_sq = act_sum_sq + (long long int)A[i]*A[i];
15 |     }
16 |     
17 |     exp_b = (long long int)(A.size())*(A.size()+1)/2;
18 |     exp_sum_sq = (long long int)(A.size())*(A.size()+1)*(2*A.size()+1)/6;
19 |     
20 |     long long int diff_sum_sq = exp_sum_sq - act_sum_sq;
21 |     long long int diff_a = exp_b - act_a;
22 |     
23 |     long long int toggle = diff_sum_sq/diff_a;
24 |     
25 |     long long int miss = (toggle + diff_a)/2;
26 |     long long int repp = miss - diff_a;
27 |     
28 |     cout<<(int)repp<<" "<<(int)miss<<endl;
29 | 
30 |     return ;
31 | }
32 | 
33 | int main() {
34 | 	int T;
35 | 	cin>>T;
36 | 	while(T--){
37 | 	    int N;
38 | 	    cin>>N;
39 | 	    vector<int> vect;
40 | 	    
41 | 	    for(int i=0; i<N; i++){
42 | 	        int temp;
43 | 	        cin>>temp;
44 | 	        vect.push_back(temp);
45 | 	    }
46 | 	    repeated_Numbers(vect);
47 | 	}
48 | 	return 0;
49 | }
50 | 


--------------------------------------------------------------------------------
/Arrays/Contest/Nearest_perfect_Square.cpp:
--------------------------------------------------------------------------------
 1 | #include<bits/stdc++.h>
 2 | 
 3 | using namespace std;
 4 | 
 5 | long long int NearestPerfectSquare(long long int N){
 6 | 	
 7 | 	long long int abovenumBER = ceil(sqrt(N+1)) * ceil(sqrt(N+1));
 8 | 	long long int belownumBER = floor(sqrt(N-1)) * floor(sqrt(N-1));
 9 | 	
10 | 	long long int difference_1 = N - abovenumBER;
11 | 	long long int difference_2 = belownumBER - N;
12 | 	
13 | 	if(difference_1 == difference_2){
14 | 		return belownumBER;
15 | 	}else if(difference_1 > difference_2){
16 | 		return abovenumBER;
17 | 	}else{
18 | 		return belownumBER;
19 | 	}
20 | }
21 | 
22 | 
23 | int main(){
24 | 	
25 | 	int T;
26 | 	cin>>T;
27 | 	while(T--){
28 | 		long long int N;
29 | 		cin>>N;
30 | 		cout<<NearestPerfectSquare(N)<<endl;
31 | 	}
32 | 	
33 | 	return 0;
34 | }
35 | 


--------------------------------------------------------------------------------
/Arrays/Contest/The_conversion_to_One.cpp:
--------------------------------------------------------------------------------
 1 | 
 2 | #include<bits/stdc++.h>
 3 | 
 4 | using namespace std;
 5 | 
 6 | int CountWays(int N){
 7 | 	
 8 | 	if(N == 1){
 9 | 		return 0;
10 | 	}
11 | 	
12 | 	else if(N%2 == 0){
13 | 		return 1 + CountWays(N/2);
14 | 	}else{
15 | 		return 1 + min(CountWays(N-1),CountWays(N+1));
16 | 	}
17 | 	
18 | 	
19 | }
20 | 
21 | int main(){
22 | 	
23 | 	int T;
24 | 	cin>>T;
25 | 	
26 | 	while(T--){
27 | 		int N;
28 | 		cin>>N;
29 | 		cout<<CountWays(N)<<endl;
30 | 	}
31 | }
32 | 


--------------------------------------------------------------------------------
/Binary Searcg Tree/Inorder traversal.cpp:
--------------------------------------------------------------------------------
 1 | void inorder(, ,)
 2 |     stack<Node *> s; 
 3 |     Node *curr = root; 
 4 |   
 5 |     while (curr != NULL || s.empty() == false) 
 6 |     { 
 7 |         /* Reach the left most Node of the 
 8 |            curr Node */
 9 |         while (curr !=  NULL) 
10 |         { 
11 |             /* place pointer to a tree node on 
12 |                the stack before traversing 
13 |               the node's left subtree */
14 |             s.push(curr); 
15 |             curr = curr->left; 
16 |         } 
17 |   
18 |         /* Current must be NULL at this point */
19 |         curr = s.top(); 
20 |         s.pop(); 
21 |   
22 |         cout << curr->data << " "; 
23 |   
24 |         /* we have visited the node and its 
25 |            left subtree.  Now, it's right 
26 |            subtree's turn */
27 |         curr = curr->right; 
28 |   
29 |     } /* end of while */
30 | } 
31 | 


--------------------------------------------------------------------------------
/Binary Searcg Tree/Insert_node.cpp:
--------------------------------------------------------------------------------
 1 | Node* insert(Node* root, int Key)
 2 | {
 3 | 
 4 | if(!root){
 5 | Node* t=new Node(Key);
 6 | return t;
 7 | }
 8 | if(root -> data == Key) return root;
 9 | if(Key < root->data)
10 | root->left=insert(root->left,Key);
11 | else
12 | root->right=insert(root->right,Key);
13 | 
14 | return root;
15 | }
16 | 


--------------------------------------------------------------------------------
/Binary Searcg Tree/Level_order.cpp:
--------------------------------------------------------------------------------
 1 | void levelOrder(Node *root) {
 2 |         queue<Node *> q;
 3 |         q.push(root);
 4 | 
 5 |         while (q.size() != 0) {
 6 |             Node *curr = q.front();
 7 |             q.pop();
 8 | 
 9 |             cout << curr->data << " ";
10 | 
11 |             if (curr->left) q.push(curr->left);
12 |             if (curr->right) q.push(curr->right);
13 |         }
14 |     }
15 | 


--------------------------------------------------------------------------------
/Binary Searcg Tree/Minimum_element.cpp:
--------------------------------------------------------------------------------
1 | if(root==NULL)
2 | return -1;
3 | 
4 | while(root->left!=NULL)
5 | root=root->left;
6 | 
7 | return(root->data);
8 | 


--------------------------------------------------------------------------------
/Binary Searcg Tree/Print BST in  A GIVEN RANGE:
--------------------------------------------------------------------------------
 1 | void insertRange(Node *root, int low, int high, vector<int> &res)
 2 | {
 3 |     if(root)
 4 |     {
 5 |         insertRange(root->left,  low, high, res);
 6 |         
 7 |         if(root->data >= low && root->data <= high)
 8 |         {
 9 |             res.push_back(root->data);
10 |         }
11 |         
12 |         insertRange(root->right, low, high, res);
13 |     }
14 | }
15 | 
16 | vector<int> printNearNodes(Node *root, int low, int high)
17 | {
18 |     vector<int> res;
19 |     
20 |     insertRange(root, low, high, res);
21 |     
22 |     return res;
23 | }
24 | 


--------------------------------------------------------------------------------
/Binary Searcg Tree/Searchanode.cpp:
--------------------------------------------------------------------------------
1 | if(root==0) {return 0;}
2 |     if(root->data==x) {return 1;}
3 |     else return search(root->left,x)||search(root->right,x);
4 | }
5 | 


--------------------------------------------------------------------------------
/Bit Magic/BinarytoGray.cpp:
--------------------------------------------------------------------------------
 1 |    #include<bits/stc++.h>
 2 |    using namespace std;
 3 |    
 4 |    int grayCOnvertor(int n)
 5 |    {
 6 |    return n ^ (n >> 1); 
 7 |    }
 8 |    
 9 |    int main()
10 |    {
11 |    int t,n;
12 |    cin>>t;
13 |    while(t--)
14 |     cin>>n;
15 |     cout<<grayConverter(n)<<endl;
16 |    
17 |    }
18 | 


--------------------------------------------------------------------------------
/Bit Magic/Bit_difference.cpp:
--------------------------------------------------------------------------------
 1 | //driver code start
 2 | #include<bits/stdc++.h>
 3 | using namespace std;
 4 | 
 5 | //function to find bit difference
 6 | int countBitsFlip(int a,int b )
 7 | {
 8 |     int count=0;
 9 |     while(a||b)
10 |     {
11 |     int ls_a = a&1;
12 |     int ls_b = b&1;
13 |     if(ls_a!=ls_b)
14 |         count++;
15 |     a=a>>1;
16 |     b=b>>1;
17 |     }
18 | return count;
19 |     
20 |     
21 | }
22 | 
23 | int main()
24 | {
25 |     int t;
26 |     cin>>t;
27 |     while(t--)
28 |     {
29 |         int a,b;
30 |         cin>>a>>b;
31 |         
32 |         cout<<countBitsFlip(a,b)<<endl;
33 |     }
34 |     return 0;
35 | }
36 | 


--------------------------------------------------------------------------------
/Bit Magic/First_set_bit.cpp:
--------------------------------------------------------------------------------
 1 | Find first set bit
 2 | 
 3 | Given an integer an N. The task is to print the position of first set bit found from right side in the binary representation of the number.
 4 | 
 5 | Input:
 6 | The first line of the input contains an integer T, denoting the number of test cases. Then T test cases follow. The only line of the each test case contains an integer N.
 7 | 
 8 | Output:
 9 | For each test case print in a single line an integer denoting the position of the first set bit found form right side of the binary representation of the number. If there is no set bit print "0".
10 | 
11 | 
12 | Using ffs() function: ffs() function returns the index of first least significant set bit.
13 | The indexing starts in ffs() function from 1.
14 | For example:
15 | n = 12 = 1100
16 | In above example, ffs(n) returns the rightmost set bit index which is 3.
17 | 


--------------------------------------------------------------------------------
/Bit Magic/Longest_Consecutive1's.cpp:
--------------------------------------------------------------------------------
 1 | int maxConsecutiveOnes(int x)
 2 | {
 3 |  
 4 |     int count =0;
 5 |     while(x!=0)
 6 |     {
 7 |         x=x& (x<<1);
 8 |         count++;
 9 |     }
10 |     return count;
11 |     
12 | }
13 | 


--------------------------------------------------------------------------------
/Bit Magic/Number_is_sparse.cpp:
--------------------------------------------------------------------------------
 1 | #include<iostream.h>
 2 | using namespace std;
 3 | 
 4 | bool isSparse(int n){
 5 |     
 6 |     int res = n & (n>>1);
 7 |     if(res==0)
 8 |         return true;
 9 |     return false;
10 |     
11 | }
12 | int main()
13 | {
14 |  int t,n;
15 |  cin>>t;
16 |  while(t--)
17 |  {
18 |   cin>>n;
19 |   if(issparse(n))
20 |     cout<<"1"<<endl;
21 |    else
22 |     cout<<"0"<<endl;
23 |  }
24 |  return 0;
25 |  }
26 | 


--------------------------------------------------------------------------------
/Bit Magic/Power_of_2.cpp:
--------------------------------------------------------------------------------
 1 | if (n == 0)  
 2 |         return 0;  
 3 |     while (n != 1)  
 4 |     {  
 5 |         if (n%2 != 0)  
 6 |             return 0;  
 7 |         n = n/2;  
 8 |     }  
 9 |     return 1;  
10 | 


--------------------------------------------------------------------------------
/Bit Magic/Rightmost_different_bit.cpp:
--------------------------------------------------------------------------------
1 | int posOfRightMostDiffBit(int m, int n)
2 | {
3 |     
4 |     int s =m^n;
5 |     return ffs(s);
6 |     
7 |     
8 | }
9 | 


--------------------------------------------------------------------------------
/Bit Magic/kth_bit_set.cpp:
--------------------------------------------------------------------------------
 1 | #include <bits/stdc++.h>
 2 | #include <iostream>
 3 | using namespace std;
 4 | 
 5 | bool checkKthBit(int n, int k)
 6 | {
 7 |      if(n & (1<<k))
 8 |      return true;
 9 |      else
10 |      return false;
11 | }
12 | int main() {
13 | 	int t;
14 | 	cin>>t;
15 | 	while(t--)
16 | 	{
17 | 	    long long n;
18 | 	    cin>>n;
19 | 	    int k;
20 | 	    cin>>k;
21 | 	    if(checkKthbit(n,k))
22 | 	        cout<<"Yes"<<endl;
23 | 	    else
24 | 	        cout<<"No"<<endl;
25 | 	    
26 | 	}
27 | 	
28 | 	return 0;
29 | }
30 | 


--------------------------------------------------------------------------------
/Contest/Hashing/K_Sum.cpp:
--------------------------------------------------------------------------------
 1 | 
 2 | 
 3 | int main() {
 4 | 	//code
 5 | 	int T;
 6 | 	cin>>T;
 7 | 	
 8 | 	while(T--){
 9 | 	  
10 | 	  int N,K;
11 | 	  cin>>N>>K;
12 | 	  int arr[N];
13 | 	  
14 | 	  for(int i=0; i<N; i++){
15 | 	      cin>>arr[i];
16 | 	  }
17 | 	  
18 | 	  sort(arr,arr + N);
19 | 	  
20 | 	  long long sum = 0;
21 | 	  for(int i=0; i<K ;i++){
22 | 	      sum += arr[i];
23 | 	  }
24 | 	  
25 | 	  cout<<sum<<endl;
26 | 	}
27 | 	return 0;
28 | }
29 | 


--------------------------------------------------------------------------------
/Contest/Hashing/XOR_Pair.cpp:
--------------------------------------------------------------------------------
 1 | 
 2 | #include <bits/stdc++.h>
 3 | using namespace std;
 4 | 
 5 | int main() {
 6 | 	//code
 7 | 	int t;
 8 | 	cin>>t;
 9 | 	
10 | 	while(t--){
11 | 	    
12 | 	    int n,c;
13 | 	    cin>>n>>c;
14 | 	    
15 | 	    int arr[n];
16 | 	    
17 | 	    for(int i=0; i<n; i++){
18 | 	        cin>>arr[i];
19 | 	    }
20 | 	    
21 | 	    unordered_set<int> s;
22 | 	    
23 | 	    bool flag = false;
24 | 	    
25 | 	    for(int i=0; i<n; i++){
26 | 	        
27 | 	        if(s.find(c^arr[i]) != s.end()){
28 | 	           flag = true;
29 | 	           break;
30 | 	        }
31 | 	        
32 | 	        s.insert(arr[i]);
33 | 	    }
34 | 	    
35 | 	    if(flag){
36 | 	        cout<<"Yes"<<endl;
37 | 	    }else{
38 | 	        cout<<"No"<<endl;
39 | 	    }
40 | 	}
41 | 	return 0;
42 | }
43 | 


--------------------------------------------------------------------------------
/Contest/Hashing/kth_smallest_distance.cpp:
--------------------------------------------------------------------------------
 1 | int kthDiff(int a[], int n, int k) 
 2 | { 
 3 |    //Your code here
 4 |     sort(a,a+n);
 5 |     vector<int>nums(a,a+n);
 6 |     int l = nums[1] - nums[0];
 7 |     for(int i = 2; i < n; i++){
 8 |         if(nums[i] - nums[i-1] < l){
 9 |             l = nums[i] - nums[i-1];
10 |         } 
11 |     }
12 |     int r = nums[n-1] - nums[0];
13 |     while(l<r){
14 |         int mid = l + (r - l)/2;
15 |         int count = 0;
16 |         for(int i = 0; i < n; i++){
17 |             int pos = upper_bound(nums.begin(), nums.end(), nums[i] + mid) - nums.begin();
18 |             count += pos - i - 1;
19 |         }
20 |         if(count < k){
21 |             l = mid+1;
22 |         }
23 |         else
24 |             r = mid;
25 |     }
26 |     return l;
27 |   
28 |   
29 |   
30 | }
31 | int main(){
32 |     int test;
33 |     cin>>test;
34 |     while(test--){
35 |         int n,k;
36 |         cin>>n>>k;
37 |         int arr[n];
38 |         for(int i=0;i<n;i++){
39 |             cin>>arr[i];
40 |         }
41 |         cout<<kthDiff(arr,n,k)<<endl;
42 |     }
43 | }
44 | 


--------------------------------------------------------------------------------
/Contest/Searching/A_Boolean_matRIX_problem.cpp:
--------------------------------------------------------------------------------
 1 | using namespace std;
 2 | 
 3 | int main() {
 4 | 	int T;
 5 | 	cin>>T;
 6 | 	
 7 | 	while(T--){
 8 | 	    int M,N,temp;
 9 | 	    int i,j;
10 | 	    cin>>M>>N;
11 | 	    
12 | 	   int matRIX[M][N];
13 | 	    
14 | 	    for(i=0; i<M; i++){
15 | 	        for(j=0; j<N; j++){
16 | 	            cin>>temp;
17 | 	            matRIX[i][j] = temp;
18 | 	        }
19 | 	    }
20 | 	    
21 | 	    for(int i=0; i<M; i++){
22 | 	        for(int j = 0; j<N; j++){
23 | 	            if(matRIX[i][j]){
24 | 	                matRIX[i][0] = 1;
25 | 					break;
26 | 	            }
27 | 	        }
28 | 	    }
29 | 	    
30 | 	    
31 | 	   for (i = 0; i < M; i++) { 
32 |         for (j = 0; j < N; j++) { 
33 | 				if (matRIX[i][0] == 1) { 
34 |                     matRIX[i][j] = 1;
35 |                 }else{
36 | 					break;
37 | 				} 
38 |             } 
39 |         }
40 | 	    
41 | 	    
42 | 	    for(int i=0; i<M; i++){
43 | 	        for(int j=0; j<N; j++){
44 | 	            cout<<matRIX[i][j]<<" ";
45 | 	        }
46 | 	        cout<<endl;
47 | 	    }
48 | 	}
49 | 	return 0;
50 | }
51 | 


--------------------------------------------------------------------------------
/Contest/Searching/Toggle_the_middle.cpp:
--------------------------------------------------------------------------------
 1 | 
 2 | #include <bits/stdc++.h>
 3 | using namespace std;
 4 | 
 5 | int main() {
 6 | 	int T;
 7 | 	cin>>T;
 8 | 	
 9 | 	while(T--){
10 | 	    
11 | 	    int N;
12 | 	    cin>>N;
13 | 	    
14 | 	    if(N == 1){
15 | 	        cout<<"0"<<endl;
16 | 	    }else if(N == 0){
17 | 	        cout<<"1"<<endl;
18 | 	    }else{
19 | 	        int NumberOfBits = floor(log(N)/log(2)) + 1;
20 | 	        
21 | 	        if(!(NumberOfBits % 2)){
22 | 	            //shift the middle and middle -1 bit
23 | 	            int Middle = NumberOfBits/2;
24 | 	            int before_Middle = Middle - 1;
25 | 	            
26 | 	            N = (N ^ (1 << (Middle)));
27 | 	            N = (N ^ (1 << (before_Middle)));
28 | 	            
29 | 	            cout<<N<<endl;
30 | 	        }else{
31 | 	            //shift the middle bit only
32 | 	            int Middle = NumberOfBits/2;
33 | 	            N = (N ^ (1 << (Middle)));
34 | 	            cout<<N<<endl;
35 | 	        }
36 | 	    }
37 | 	}
38 | 	return 0;
39 | }
40 | 


--------------------------------------------------------------------------------
/Contest/Searching/Without_Adjacent.cpp:
--------------------------------------------------------------------------------
 1 | 
 2 | 
 3 | int main() {
 4 | 	
 5 | 	int T;
 6 | 	cin>>T;
 7 | 	
 8 | 	while(T--){
 9 | 	    
10 | 	    int N;
11 | 	    cin>>N;
12 | 	    
13 | 	    int Arr[N];
14 | 	    
15 | 	    for(int i=0; i<N; i++){
16 | 	        cin>>Arr[i];
17 | 	    }
18 | 	    
19 | 	    long long inclUDE = Arr[0];
20 | 	    long long exclUDE = 0;
21 | 	    long long new_excl;
22 | 	    
23 | 	    for(int i=1; i<N; i++){
24 | 	        
25 | 	        new_excl = (inclUDE > exclUDE) ? inclUDE : exclUDE;
26 | 	        
27 | 	        inclUDE = exclUDE  + Arr[i];
28 | 	        exclUDE =  new_excl;
29 | 	    }
30 | 	    
31 | 	    cout<<((inclUDE > exclUDE) ? inclUDE : exclUDE)<<endl;
32 | 	}
33 | 	return 0;
34 | }
35 | 


--------------------------------------------------------------------------------
/Greedy/Shop in Candy Store.cpp:
--------------------------------------------------------------------------------
 1 | // C++ implementation to find the minimum
 2 | // and maximum amount
 3 | #include <bits/stdc++.h>
 4 | using namespace std;
 5 | 
 6 | // Function to find the minimum amount
 7 | // to buy all candies
 8 | int findMinimum(int arr[], int n, int k)
 9 | {
10 | 	int res = 0;
11 | 	for (int i = 0; i < n; i++) {
12 | 		// Buy current candy
13 | 		res += arr[i];
14 | 
15 | 		// And take k candies for free
16 | 		// from the last
17 | 		n = n - k;
18 | 	}
19 | 	return res;
20 | }
21 | 
22 | // Function to find the maximum amount
23 | // to buy all candies
24 | int findMaximum(int arr[], int n, int k)
25 | {
26 | 	int res = 0, index = 0;
27 | 
28 | 	for (int i = n - 1; i >= index; i--)
29 | 	{
30 | 		// Buy candy with maximum amount
31 | 		res += arr[i];
32 | 
33 | 		// And get k candies for free from
34 | 		// the starting
35 | 		index += k;
36 | 	}
37 | 	return res;
38 | }
39 | 
40 | // Driver code
41 | int main()
42 | {
43 | 	int arr[] = { 3, 2, 1, 4 };
44 | 	int n = sizeof(arr) / sizeof(arr[0]);
45 | 	int k = 2;
46 | 	sort(arr, arr + n);
47 | 
48 | 	// Function call
49 | 	cout << findMinimum(arr, n, k) << " "
50 | 		<< findMaximum(arr, n, k) << endl;
51 | 	return 0;
52 | }
53 | 


--------------------------------------------------------------------------------
/Hashing/Pair of Element.cpp:
--------------------------------------------------------------------------------
 1 | // CPP code naive solution to find a pair swapping
 2 | // which makes sum of arrays sum.
 3 | #include <iostream>
 4 | using namespace std;
 5 | 
 6 | // Function to calculate sum of elements of array
 7 | int getSum(int X[], int n)
 8 | {
 9 | 	int sum = 0;
10 | 	for (int i = 0; i < n; i++)
11 | 		sum += X[i];
12 | 	return sum;
13 | }
14 | 
15 | void findSwapValues(int A[], int n, int B[], int m)
16 | {
17 | 	// Calculation of sums from both arrays
18 | 	int sum1 = getSum(A, n);
19 | 	int sum2 = getSum(B, m);
20 | 
21 | 	// Look for val1 and val2, such that
22 | 	// sumA - val1 + val2 = sumB - val2 + val1
23 | 	int newsum1, newsum2, val1, val2;
24 | 	for (int i = 0; i < n; i++) {
25 | 		for (int j = 0; j < m; j++) {
26 | 			newsum1 = sum1 - A[i] + B[j];
27 | 			newsum2 = sum2 - B[j] + A[i];
28 | 			if (newsum1 == newsum2) {
29 | 				val1 = A[i];
30 | 				val2 = B[j];
31 | 			}
32 | 		}
33 | 	}
34 | 
35 | 	cout << val1 << " " << val2;
36 | }
37 | 
38 | // Driver code
39 | int main()
40 | {
41 | 	int A[] = { 4, 1, 2, 1, 1, 2 };
42 | 	int n = sizeof(A) / sizeof(A[0]);
43 | 	int B[] = { 3, 6, 3, 3 };
44 | 	int m = sizeof(B) / sizeof(B[0]);
45 | 
46 | 	// Call to function
47 | 	findSwapValues(A, n, B, m);
48 | 	return 0;
49 | }
50 | 


--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
  1 |                     GNU GENERAL PUBLIC LICENSE
  2 |                        Version 3, 29 June 2007
  3 | 
  4 |  Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
  5 |  Everyone is permitted to copy and distribute verbatim copies
  6 |  of this license document, but changing it is not allowed.
  7 | 
  8 |                             Preamble
  9 | 
 10 |   The GNU General Public License is a free, copyleft license for
 11 | software and other kinds of works.
 12 | 
 13 |   The licenses for most software and other practical works are designed
 14 | to take away your freedom to share and change the works.  By contrast,
 15 | the GNU General Public License is intended to guarantee your freedom to
 16 | share and change all versions of a program--to make sure it remains free
 17 | software for all its users.  We, the Free Software Foundation, use the
 18 | GNU General Public License for most of our software; it applies also to
 19 | any other work released this way by its authors.  You can apply it to
 20 | your programs, too.
 21 | 
 22 |   When we speak of free software, we are referring to freedom, not
 23 | price.  Our General Public Licenses are designed to make sure that you
 24 | have the freedom to distribute copies of free software (and charge for
 25 | them if you wish), that you receive source code or can get it if you
 26 | want it, that you can change the software or use pieces of it in new
 27 | free programs, and that you know you can do these things.
 28 | 
 29 |   To protect your rights, we need to prevent others from denying you
 30 | these rights or asking you to surrender the rights.  Therefore, you have
 31 | certain responsibilities if you distribute copies of the software, or if
 32 | you modify it: responsibilities to respect the freedom of others.
 33 | 
 34 |   For example, if you distribute copies of such a program, whether
 35 | gratis or for a fee, you must pass on to the recipients the same
 36 | freedoms that you received.  You must make sure that they, too, receive
 37 | or can get the source code.  And you must show them these terms so they
 38 | know their rights.
 39 | 
 40 |   Developers that use the GNU GPL protect your rights with two steps:
 41 | (1) assert copyright on the software, and (2) offer you this License
 42 | giving you legal permission to copy, distribute and/or modify it.
 43 | 
 44 |   For the developers' and authors' protection, the GPL clearly explains
 45 | that there is no warranty for this free software.  For both users' and
 46 | authors' sake, the GPL requires that modified versions be marked as
 47 | changed, so that their problems will not be attributed erroneously to
 48 | authors of previous versions.
 49 | 
 50 |   Some devices are designed to deny users access to install or run
 51 | modified versions of the software inside them, although the manufacturer
 52 | can do so.  This is fundamentally incompatible with the aim of
 53 | protecting users' freedom to change the software.  The systematic
 54 | pattern of such abuse occurs in the area of products for individuals to
 55 | use, which is precisely where it is most unacceptable.  Therefore, we
 56 | have designed this version of the GPL to prohibit the practice for those
 57 | products.  If such problems arise substantially in other domains, we
 58 | stand ready to extend this provision to those domains in future versions
 59 | of the GPL, as needed to protect the freedom of users.
 60 | 
 61 |   Finally, every program is threatened constantly by software patents.
 62 | States should not allow patents to restrict development and use of
 63 | software on general-purpose computers, but in those that do, we wish to
 64 | avoid the special danger that patents applied to a free program could
 65 | make it effectively proprietary.  To prevent this, the GPL assures that
 66 | patents cannot be used to render the program non-free.
 67 | 
 68 |   The precise terms and conditions for copying, distribution and
 69 | modification follow.
 70 | 
 71 |                        TERMS AND CONDITIONS
 72 | 
 73 |   0. Definitions.
 74 | 
 75 |   "This License" refers to version 3 of the GNU General Public License.
 76 | 
 77 |   "Copyright" also means copyright-like laws that apply to other kinds of
 78 | works, such as semiconductor masks.
 79 | 
 80 |   "The Program" refers to any copyrightable work licensed under this
 81 | License.  Each licensee is addressed as "you".  "Licensees" and
 82 | "recipients" may be individuals or organizations.
 83 | 
 84 |   To "modify" a work means to copy from or adapt all or part of the work
 85 | in a fashion requiring copyright permission, other than the making of an
 86 | exact copy.  The resulting work is called a "modified version" of the
 87 | earlier work or a work "based on" the earlier work.
 88 | 
 89 |   A "covered work" means either the unmodified Program or a work based
 90 | on the Program.
 91 | 
 92 |   To "propagate" a work means to do anything with it that, without
 93 | permission, would make you directly or secondarily liable for
 94 | infringement under applicable copyright law, except executing it on a
 95 | computer or modifying a private copy.  Propagation includes copying,
 96 | distribution (with or without modification), making available to the
 97 | public, and in some countries other activities as well.
 98 | 
 99 |   To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies.  Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 | 
103 |   An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License.  If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 | 
112 |   1. Source Code.
113 | 
114 |   The "source code" for a work means the preferred form of the work
115 | for making modifications to it.  "Object code" means any non-source
116 | form of a work.
117 | 
118 |   A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 | 
123 |   The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form.  A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 | 
134 |   The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities.  However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work.  For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 | 
147 |   The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 | 
151 |   The Corresponding Source for a work in source code form is that
152 | same work.
153 | 
154 |   2. Basic Permissions.
155 | 
156 |   All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met.  This License explicitly affirms your unlimited
159 | permission to run the unmodified Program.  The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work.  This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 | 
164 |   You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force.  You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright.  Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 | 
175 |   Conveying under any other circumstances is permitted solely under
176 | the conditions stated below.  Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 | 
179 |   3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 | 
181 |   No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 | 
187 |   When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 | 
195 |   4. Conveying Verbatim Copies.
196 | 
197 |   You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 | 
205 |   You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 | 
208 |   5. Conveying Modified Source Versions.
209 | 
210 |   You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 | 
214 |     a) The work must carry prominent notices stating that you modified
215 |     it, and giving a relevant date.
216 | 
217 |     b) The work must carry prominent notices stating that it is
218 |     released under this License and any conditions added under section
219 |     7.  This requirement modifies the requirement in section 4 to
220 |     "keep intact all notices".
221 | 
222 |     c) You must license the entire work, as a whole, under this
223 |     License to anyone who comes into possession of a copy.  This
224 |     License will therefore apply, along with any applicable section 7
225 |     additional terms, to the whole of the work, and all its parts,
226 |     regardless of how they are packaged.  This License gives no
227 |     permission to license the work in any other way, but it does not
228 |     invalidate such permission if you have separately received it.
229 | 
230 |     d) If the work has interactive user interfaces, each must display
231 |     Appropriate Legal Notices; however, if the Program has interactive
232 |     interfaces that do not display Appropriate Legal Notices, your
233 |     work need not make them do so.
234 | 
235 |   A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit.  Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 | 
245 |   6. Conveying Non-Source Forms.
246 | 
247 |   You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 | 
252 |     a) Convey the object code in, or embodied in, a physical product
253 |     (including a physical distribution medium), accompanied by the
254 |     Corresponding Source fixed on a durable physical medium
255 |     customarily used for software interchange.
256 | 
257 |     b) Convey the object code in, or embodied in, a physical product
258 |     (including a physical distribution medium), accompanied by a
259 |     written offer, valid for at least three years and valid for as
260 |     long as you offer spare parts or customer support for that product
261 |     model, to give anyone who possesses the object code either (1) a
262 |     copy of the Corresponding Source for all the software in the
263 |     product that is covered by this License, on a durable physical
264 |     medium customarily used for software interchange, for a price no
265 |     more than your reasonable cost of physically performing this
266 |     conveying of source, or (2) access to copy the
267 |     Corresponding Source from a network server at no charge.
268 | 
269 |     c) Convey individual copies of the object code with a copy of the
270 |     written offer to provide the Corresponding Source.  This
271 |     alternative is allowed only occasionally and noncommercially, and
272 |     only if you received the object code with such an offer, in accord
273 |     with subsection 6b.
274 | 
275 |     d) Convey the object code by offering access from a designated
276 |     place (gratis or for a charge), and offer equivalent access to the
277 |     Corresponding Source in the same way through the same place at no
278 |     further charge.  You need not require recipients to copy the
279 |     Corresponding Source along with the object code.  If the place to
280 |     copy the object code is a network server, the Corresponding Source
281 |     may be on a different server (operated by you or a third party)
282 |     that supports equivalent copying facilities, provided you maintain
283 |     clear directions next to the object code saying where to find the
284 |     Corresponding Source.  Regardless of what server hosts the
285 |     Corresponding Source, you remain obligated to ensure that it is
286 |     available for as long as needed to satisfy these requirements.
287 | 
288 |     e) Convey the object code using peer-to-peer transmission, provided
289 |     you inform other peers where the object code and Corresponding
290 |     Source of the work are being offered to the general public at no
291 |     charge under subsection 6d.
292 | 
293 |   A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 | 
297 |   A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling.  In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage.  For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product.  A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 | 
310 |   "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source.  The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 | 
318 |   If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information.  But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 | 
329 |   The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed.  Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 | 
337 |   Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 | 
343 |   7. Additional Terms.
344 | 
345 |   "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law.  If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 | 
354 |   When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it.  (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.)  You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 | 
361 |   Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 | 
365 |     a) Disclaiming warranty or limiting liability differently from the
366 |     terms of sections 15 and 16 of this License; or
367 | 
368 |     b) Requiring preservation of specified reasonable legal notices or
369 |     author attributions in that material or in the Appropriate Legal
370 |     Notices displayed by works containing it; or
371 | 
372 |     c) Prohibiting misrepresentation of the origin of that material, or
373 |     requiring that modified versions of such material be marked in
374 |     reasonable ways as different from the original version; or
375 | 
376 |     d) Limiting the use for publicity purposes of names of licensors or
377 |     authors of the material; or
378 | 
379 |     e) Declining to grant rights under trademark law for use of some
380 |     trade names, trademarks, or service marks; or
381 | 
382 |     f) Requiring indemnification of licensors and authors of that
383 |     material by anyone who conveys the material (or modified versions of
384 |     it) with contractual assumptions of liability to the recipient, for
385 |     any liability that these contractual assumptions directly impose on
386 |     those licensors and authors.
387 | 
388 |   All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10.  If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term.  If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 | 
398 |   If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 | 
403 |   Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 | 
407 |   8. Termination.
408 | 
409 |   You may not propagate or modify a covered work except as expressly
410 | provided under this License.  Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 | 
415 |   However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 | 
422 |   Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 | 
429 |   Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License.  If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 | 
435 |   9. Acceptance Not Required for Having Copies.
436 | 
437 |   You are not required to accept this License in order to receive or
438 | run a copy of the Program.  Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance.  However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work.  These actions infringe copyright if you do
443 | not accept this License.  Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 | 
446 |   10. Automatic Licensing of Downstream Recipients.
447 | 
448 |   Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License.  You are not responsible
451 | for enforcing compliance by third parties with this License.
452 | 
453 |   An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations.  If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 | 
463 |   You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License.  For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 | 
471 |   11. Patents.
472 | 
473 |   A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based.  The
475 | work thus licensed is called the contributor's "contributor version".
476 | 
477 |   A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version.  For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 | 
487 |   Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 | 
492 |   In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement).  To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 | 
499 |   If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients.  "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 | 
513 |   If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 | 
521 |   A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License.  You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 | 
536 |   Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 | 
540 |   12. No Surrender of Others' Freedom.
541 | 
542 |   If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License.  If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all.  For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 | 
552 |   13. Use with the GNU Affero General Public License.
553 | 
554 |   Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work.  The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 | 
563 |   14. Revised Versions of this License.
564 | 
565 |   The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time.  Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 | 
570 |   Each version is given a distinguishing version number.  If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation.  If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 | 
579 |   If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 | 
584 |   Later license versions may give you additional or different
585 | permissions.  However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 | 
589 |   15. Disclaimer of Warranty.
590 | 
591 |   THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 | 
600 |   16. Limitation of Liability.
601 | 
602 |   IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 | 
612 |   17. Interpretation of Sections 15 and 16.
613 | 
614 |   If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 | 
621 |                      END OF TERMS AND CONDITIONS
622 | 
623 |             How to Apply These Terms to Your New Programs
624 | 
625 |   If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 | 
629 |   To do so, attach the following notices to the program.  It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 | 
634 |     <one line to give the program's name and a brief idea of what it does.>
635 |     Copyright (C) <year>  <name of author>
636 | 
637 |     This program is free software: you can redistribute it and/or modify
638 |     it under the terms of the GNU General Public License as published by
639 |     the Free Software Foundation, either version 3 of the License, or
640 |     (at your option) any later version.
641 | 
642 |     This program is distributed in the hope that it will be useful,
643 |     but WITHOUT ANY WARRANTY; without even the implied warranty of
644 |     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
645 |     GNU General Public License for more details.
646 | 
647 |     You should have received a copy of the GNU General Public License
648 |     along with this program.  If not, see <https://www.gnu.org/licenses/>.
649 | 
650 | Also add information on how to contact you by electronic and paper mail.
651 | 
652 |   If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 | 
655 |     <program>  Copyright (C) <year>  <name of author>
656 |     This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 |     This is free software, and you are welcome to redistribute it
658 |     under certain conditions; type `show c' for details.
659 | 
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License.  Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 | 
664 |   You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | <https://www.gnu.org/licenses/>.
668 | 
669 |   The GNU General Public License does not permit incorporating your program
670 | into proprietary programs.  If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library.  If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License.  But first, please read
674 | <https://www.gnu.org/licenses/why-not-lgpl.html>.
675 | 


--------------------------------------------------------------------------------
/Mathematics/Absolute Value.cpp:
--------------------------------------------------------------------------------
 1 | //driver code
 2 | #include <bits/stdc++.h>
 3 | using namespace std;
 4 | int absolute(int I);
 5 | int main()
 6 | {
 7 | int T;
 8 | cin>>T;
 9 | while(T--)
10 | {
11 | int I;
12 | cin>>I;
13 | cout<<absolute(I)<<endl;
14 | }
15 | int absolute(int I)
16 | {
17 | if( I >= 0)
18 |   return I;
19 | else
20 |   return -I;
21 | }
22 | }
23 | 
24 | 


--------------------------------------------------------------------------------
/Mathematics/Addition_Under_Modulo.cpp:
--------------------------------------------------------------------------------
 1 | You are given two numbers a and b. You need to find the sum of a and b under modulo M.
 2 | Note: Take M as 109+7
 3 | 
 4 | Input:
 5 | The first line of input contains T denoting the number of testcases. T testcases follow. Each testcase contains one line of input containing a and b.
 6 | 
 7 | Output:
 8 | For each testcase, in a new line, print sum of a and b under modulo M.
 9 | 
10 | 
11 | //User function Template for C++
12 | 
13 | 
14 | int sumUnderModulo(long long a,long long b)
15 | {
16 |     int M=1000000007;
17 |     a = a%M;
18 |     b = b%M;
19 |     return (a+b)%M;
20 | }
21 | 


--------------------------------------------------------------------------------
/Mathematics/CelciusToFahrienheit.cpp:
--------------------------------------------------------------------------------
 1 | **rest code is already available in IDE**
 2 | 
 3 | 
 4 | //You need to complete this function
 5 | double cToF(int C)
 6 | {
 7 |     //Your code here
 8 |     return (1.8*C+32);
 9 | }
10 | 


--------------------------------------------------------------------------------
/Mathematics/Digits_In_Factorial.cpp:
--------------------------------------------------------------------------------
 1 | int digitsInFactorial(int N)
 2 | {
 3 |     if(N<0)
 4 |     return 0;
 5 |     if(N<=1)
 6 |     return 1;
 7 |     else
 8 |     {
 9 |         double d=0;
10 |         for(int i=2;i<=N;i++)
11 |             d+=log10(i);
12 |         return floor(d)+1;
13 |     }
14 |     
15 | }
16 | 


--------------------------------------------------------------------------------
/Mathematics/Factorial_of_number.cpp:
--------------------------------------------------------------------------------
 1 | long long factorial (int N)
 2 | {
 3 |     //Your code here
 4 |     {
 5 |     if(N > 1)
 6 |         return N * factorial(N - 1);
 7 |     else
 8 |         return 1;
 9 | }    
10 | }
11 | 


--------------------------------------------------------------------------------
/Mathematics/GP_Term.cpp:
--------------------------------------------------------------------------------
1 | double termOfGP(int A,double B,int N)
2 | {
3 |    double r = B/A; 
4 |     return A * pow(r, N-1);
5 | }
6 | 


--------------------------------------------------------------------------------
/Mathematics/Modular_Multiplicative_Inverse.cpp:
--------------------------------------------------------------------------------
 1 | int modInverse(int a, int m)
 2 | {
 3 |      a = a%m; 
 4 |     for (int x=1; x<m; x++) 
 5 |        if ((a*x) % m == 1) 
 6 |           return x; 
 7 | 
 8 |     return -1;
 9 | }
10 | 


--------------------------------------------------------------------------------
/Mathematics/Multiplication_Under_Modulo.cpp:
--------------------------------------------------------------------------------
 1 | Multiplication Under Modulo
 2 | 
 3 | You are given two numbers a and b. You need to find the multiplication of a and b under modulo M.
 4 | Note: Take M as 109+7
 5 | 
 6 | Input:
 7 | The first line of input contains T denoting the number of testcases. T testcases follow. Each testcase contains one line of input containing a and b.
 8 | 
 9 | Output:
10 | For each testcase, in a new line, print multiplication of a and b under modulo M.
11 | 
12 | 
13 | int multiplicationUnderModulo(long long a,long long b)
14 | {
15 |     int M=1000000007;
16 |     a=a%M;
17 |     b=b%M;
18 |     return (a*b)%M;
19 | }
20 | 


--------------------------------------------------------------------------------
/Mathematics/Primality_Test.cpp:
--------------------------------------------------------------------------------
1 | bool isPrime(int N)
2 | {
3 |     if(N<=1) return false;
4 |     for(int i=2;i<N;i++)
5 |         if(N%i==0)
6 |             return false;
7 |         return true;
8 | }
9 | 


--------------------------------------------------------------------------------
/Mathematics/Print 1 To N Without Loop:
--------------------------------------------------------------------------------
1 | void printNos(int N)
2 | {
3 |     if(N==0)
4 |     return;
5 |     printNos(N-1);
6 |     cout<<N<<" ";
7 | }
8 | 


--------------------------------------------------------------------------------
/Mathematics/Quadratic_Equation_Roots.cpp:
--------------------------------------------------------------------------------
 1 | **rest of code is available in IDE**
 2 | 
 3 | void quadraticRoots(int a,int b, int c)
 4 | {
 5 |     float D = b*b-4*a*c;
 6 |     if(D<0)
 7 |      cout<<"Imaginary";
 8 |     else if(D==0)
 9 |     {
10 |        float r= floor((-b + sqrt(D)) / (2.0*a));
11 |        cout<<r<<" "<<r;
12 |     }
13 |     else
14 |      {
15 |          float r1 = floor((-b+sqrt(D))/(2.0*a));
16 |          float r2 = floor((-b-sqrt(D))/(2.0*a));
17 |          cout<<r1<<" "<<r2;
18 |      }
19 | }
20 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # DSA--GeeksForGeeks
 2 |  DSA-Self Paced Course Solutions in C++
 3 | 
 4 | 
 5 | ### About this course:  
 6 | This is a course designed by geeksforgeeks for Data Structures and Algorithms which covers below contents:  
 7 | + Introduction
 8 | + [Mathematics](Mathematics)
 9 | + [Bit Magic](BitMagic)
10 | + [Recursion](Recursion)
11 | + [Arrays](Arrays)
12 | + Searching
13 | + Sorting
14 | + Matrix
15 | + Hashing
16 | + [Strings](Strings)
17 | + LinkedList
18 | + Stack
19 | + Queue
20 | + [Tree](Tree)
21 | + [Binary Search Tree](BST)
22 | + Heap
23 | + Graph
24 | + Greedy 
25 | + Dynamic Programming
26 | + Backtracking
27 | + Graph (Advanced)
28 | + Tree
29 | + Segment-Tree
30 | + Disjoint set
31 | 
32 | All the problems solutions are provided here , click on desired option to jump on that folder directly 
33 | 
34 | 
35 |  
36 | 


--------------------------------------------------------------------------------
/Recursion/Sum_of_digits.cpp:
--------------------------------------------------------------------------------
 1 | #include<iostream.h>
 2 | using namespace std;
 3 | 
 4 | int sumOfDigits(int n)
 5 | {
 6 |  if(n<10)
 7 |     return n;
 8 |  else
 9 |     return sumOfDigits(n/10)+n%10;
10 | }
11 | 
12 | int main()
13 | {
14 | int t,n;
15 | cin>>t;
16 | while(t--)
17 | {
18 | cin>>n;
19 | cout<<sumOfDigits(n)<<endl;
20 | }
21 | return 0;
22 | }
23 | 


--------------------------------------------------------------------------------
/Strings/Anagram.cpp:
--------------------------------------------------------------------------------
 1 | bool isAnagram(string c, string d){
 2 |      if(c.length()!=d.length())
 3 |     return false;
 4 |     
 5 |     int count[256]={0};
 6 |     for(int i=0;i<c.length();i++){
 7 |         count[c[i]]++;
 8 |         
 9 |     }
10 |     for(int i=0;i<d.length();i++){
11 |         count[d[i]]--;
12 |     }
13 |     for(int i=0;i<c.length();i++)
14 |     if(count[c[i]]!=0)
15 |     return false;
16 |     
17 |     return true;
18 |     // Your code here
19 |     
20 | }
21 | 


--------------------------------------------------------------------------------
/Strings/Binary string.cpp:
--------------------------------------------------------------------------------
 1 | long binarySubstring(int n, string a){
 2 |     int ones = 0;
 3 |     
 4 |     for(int i=0;i<n;i++){
 5 |         if(a[i] == '1')
 6 |             ones++;
 7 |     }
 8 |     
 9 |     //total number of possible pairs of one
10 |     return ones * (ones-1) / 2;
11 | }
12 | 
13 | 


--------------------------------------------------------------------------------
/Strings/Distance_pattern_search.cpp:
--------------------------------------------------------------------------------
 1 | bool search(string pat, string txt)
 2 | {
 3 | 
 4 | int n = txt.length();
 5 | int m = pat.length();
 6 | for(int i = 0; i < n; i++)
 7 | {
 8 | int j;
 9 | for(j = 0; j < m; j++)
10 | {
11 | if(txt[i+j] != pat[j])
12 | break;
13 | }
14 | if(j == m)
15 | return true;
16 | }
17 | return false;
18 | }
19 | 


--------------------------------------------------------------------------------
/Strings/Implement_strstr.cpp:
--------------------------------------------------------------------------------
1 | int strstr(string s, string x)
2 | {
3 | int f=-1;
4 | f=s.find(x);
5 | return f;
6 | 
7 | }
8 | 


--------------------------------------------------------------------------------
/Strings/Keypad.cpp:
--------------------------------------------------------------------------------
 1 | #include<bits/stdc++.h>
 2 | using namespace std;
 3 | int main()
 4 |  {
 5 | 	//code
 6 | 	int c;
 7 | 	int t;
 8 | 	cin>>t;
 9 | 	while(t--){
10 | 	    string s;
11 |     	cin>>s;
12 |     	for(int i=0; i<s.length(); i++){
13 |     	    c = int(s[i]);
14 |     	    if(c>=97 && c<=99)
15 |         	    cout<<2;
16 |     	    else if(c>=100 && c<=102)
17 |     	        cout<<3;
18 |     	    else if(c>=103 && c<=105)
19 |     	        cout<<4;
20 |     	    else if(c>=106 && c<=108)
21 |     	        cout<<5;
22 |     	    else if(c>=109 && c<=111)
23 |     	        cout<<6;
24 |     	    else if(c>=112 && c<=115)
25 |     	        cout<<7;
26 |     	    else if(c>=116 && c<=118)
27 |     	        cout<<8;
28 |     	    else if(c>=119 && c<=122)
29 |     	        cout<<9;
30 | 	    }
31 | 	    cout<<endl;
32 | 	}
33 | 	
34 | 	
35 | 	return 0;
36 | }
37 | 


--------------------------------------------------------------------------------
/Strings/Lexicographic.cpp:
--------------------------------------------------------------------------------
 1 | int fact(int n)
 2 | {
 3 |     if(n==1 || n==0)
 4 |         return 1;
 5 |     else
 6 |         return n*fact(n-1);
 7 | }
 8 | 
 9 | int findRank(string S) 
10 | {
11 |     int n=S.length();
12 |     
13 |     long long rank=0;
14 |     
15 |     for(int i=0;i<n-1;i++)
16 |     {
17 |         int count=0;
18 |         
19 |         for(int j=i+1;j<n;j++)
20 |         {
21 |             if(S[j]==S[i])
22 |                 return 0;
23 |             if(S[j]<S[i])
24 |                 count++;
25 |         }
26 |         
27 |         rank+=count*fact(n-i-1);
28 |     }
29 |     
30 |     return (rank+1)%1000000007;
31 | }
32 | 


--------------------------------------------------------------------------------
/Strings/Maximum_occuring.cpp:
--------------------------------------------------------------------------------
 1 | char getMaxOccuringChar(char* str)
 2 | {
 3 |     // Your code here
 4 |     int count[256]={0};
 5 |     int i;
 6 |     int max=INT_MIN;
 7 |     int c;
 8 |     i=0;
 9 |     while(str[i]!='\0')
10 |     {
11 |         count[str[i]]++;
12 |         i++;
13 |     }
14 |     for(int j=0;j<256;j++)
15 |     {
16 |         if(count[j]>max)
17 |         {
18 |             max=count[j];
19 |             c=j;
20 |         }
21 |     }
22 |     
23 |     return char(c);
24 | }
25 | 


--------------------------------------------------------------------------------
/Strings/Modified_string.cpp:
--------------------------------------------------------------------------------
 1 | int modified (string a){
 2 |     // Your code here
 3 |     int n=0, insert=0;
 4 |     for(int i=1; i<a.length(); i++){
 5 |         if(a[i]==a[i-1])
 6 |             n++;
 7 |         else{
 8 |             insert+=n/2;
 9 |             n=0;
10 |         }
11 |     }
12 |     insert+=n/2;
13 |     return insert;}
14 | 


--------------------------------------------------------------------------------
/Strings/Naive_pattern_search.cpp:
--------------------------------------------------------------------------------
 1 | bool search(string pat, string txt)
 2 | {
 3 | 
 4 | int n = txt.length();
 5 | int m = pat.length();
 6 | for(int i = 0; i < n; i++)
 7 | {
 8 | int j;
 9 | for(j = 0; j < m; j++)
10 | {
11 | if(txt[i+j] != pat[j])
12 | break;
13 | }
14 | if(j == m)
15 | return true;
16 | }
17 | return false;
18 | }
19 | 


--------------------------------------------------------------------------------
/Strings/Non_repeating.cpp:
--------------------------------------------------------------------------------
 1 | char nonrepeatingCharacter(string str)
 2 | {
 3 |     unordered_map<char, int> m;
 4 |     
 5 |     for(int i=0;i<str.length();i++){
 6 |         m[str[i]]++;
 7 |     }
 8 |     
 9 |     for(int i=0;i<str.length();i++){
10 |         if(m[str[i]] == 1){
11 |             return str[i];
12 |         }
13 |     }
14 |     
15 |     return '$';
16 | }
17 | 


--------------------------------------------------------------------------------
/Strings/Panagram.cpp:
--------------------------------------------------------------------------------
 1 | bool checkPangram (string &str)
 2 | {
 3 |     bool alphacount[26];
 4 |     int size = str.length();
 5 |     
 6 |     for(int i=0;i<size;i++){
 7 |         if(str[i]>='a' && str[i]<='z'){
 8 |             alphacount[str[i]-97] = true;
 9 |         }else if(str[i]>='A' && str[i]<='Z'){
10 |             alphacount[str[i]-65] = true;
11 |         }
12 |     }
13 |     
14 |     for(int i=0;i<26;i++){
15 |         if(alphacount[i] != true)
16 |             return false;
17 |     }
18 |     
19 |     return true;
20 | }
21 | 


--------------------------------------------------------------------------------
/Strings/Pattern_search_KMP.cpp:
--------------------------------------------------------------------------------
 1 | void computeLPSArray(string pat, int M, int* lps) 
 2 | { 
 3 | 	int len=0;
 4 | 	
 5 | 	lps[0]=0;
 6 | 	
 7 | 	int i=1;
 8 | 	
 9 | 	while(i<M)
10 | 	{
11 | 	    if(pat[len]==pat[i])
12 | 	    {
13 | 	        len++;
14 | 	        
15 | 	        lps[i]=len;
16 | 	        
17 | 	        i++;
18 | 	    }
19 | 	    else 
20 | 	    {
21 | 	        if(len!=0)
22 | 	        {
23 | 	            len=lps[len-1];
24 | 	        }
25 | 	        else
26 | 	        {
27 | 	            lps[i]=len;
28 |                 i++;	            
29 | 	        }
30 | 	    }
31 | 	}
32 | } 
33 | // Returns true if pat found in txt
34 | bool KMPSearch(string pat, string txt) {
35 |     
36 |     int N=txt.length();
37 |     int M=pat.length();
38 |     
39 |     int lps[M];
40 |     
41 |     computeLPSArray(pat,M,lps);
42 |     
43 |     int i=0;
44 |     int j=0;
45 |     
46 |     while(i<N)
47 |     {
48 |         if(pat[j]==txt[i])
49 |         {
50 |             i++;
51 |             j++;
52 |             
53 |         }
54 |         if(j==M)
55 |             return true;
56 |         else if(i<N && pat[j]!=txt[i])
57 |         {
58 |             if(j!=0)
59 |             {
60 |                 j=lps[j-1];
61 |             }
62 |             else
63 |             {
64 |                 i++;
65 |             }
66 |         }
67 |     }
68 |     
69 |     return false;
70 | }
71 | 


--------------------------------------------------------------------------------
/Strings/Rabincarp.cpp:
--------------------------------------------------------------------------------
 1 | #define d 256 
 2 | 
 3 | bool search(string pat, string txt, int q)
 4 | {
 5 | if(txt.find(pat)==string::npos)
 6 | return false;
 7 | 
 8 | return true;
 9 | }
10 | 


--------------------------------------------------------------------------------
/Strings/Remove_characters.cpp:
--------------------------------------------------------------------------------
 1 | string concatenatedString(string s1, string s2) 
 2 | { 
 3 |  int a[26]={0};
 4 |     string s="";
 5 |     for(int i=0;i<s1.length();i++){
 6 |         a[s1[i]-'a']=2;
 7 |     }
 8 |     for(int i=0;i<s2.length();i++){
 9 |         if(a[s2[i]-'a']==-1)continue;
10 |         if(a[s2[i]-'a']==2)a[s2[i]-'a']=-1;
11 |         if(a[s2[i]-'a']==0||a[s2[i]-'a']==1)a[s2[i]-'a']=1;
12 |     }
13 |     for(int i=0;i<s1.length();i++){
14 |         if(a[s1[i]-'a']==2)s+=s1[i];
15 |     }
16 |     for(int i=0;i<s2.length();i++){
17 |         if(a[s2[i]-'a']==1)s+=s2[i];
18 |     }
19 |     return s;
20 | }
21 | 


--------------------------------------------------------------------------------
/Strings/Repating_character.cpp:
--------------------------------------------------------------------------------
 1 | int repeatedCharacter (string str) 
 2 | { 
 3 |     unordered_set<int> s;
 4 |     int pos=-1;
 5 |     
 6 |     for(int i=str.length()-1;i>=0;i--){
 7 |         if(s.find(str[i]) != s.end()){
 8 |             pos = i;
 9 |         }
10 |         
11 |         s.insert(str[i]);
12 |     }
13 |     
14 |     return pos;
15 | } 
16 | 


--------------------------------------------------------------------------------
/Strings/Reverse_words.cpp:
--------------------------------------------------------------------------------
 1 | void reverseWords(char *s) {
 2 |     
 3 |     // Your code here
 4 |     int i = strlen(s)-1;
 5 | 
 6 | 
 7 | int j=i;
 8 | while(1)
 9 | {
10 | 
11 | 
12 |     while(s[j] != '.' && j !=0 )
13 |  {  
14 |     j--;
15 |  }
16 |     if(j==0)
17 |     {
18 |       for(int k = j;k<=i;k++)
19 |         {cout<<s[k];
20 |         }
21 |       break;
22 |     }
23 |     else{
24 |           
25 |         for(int k = j+1;k<=i;k++)
26 |         {cout<<s[k];
27 |         }
28 |         cout<<".";
29 |     }
30 |     i=j-1;
31 |     j=i;
32 | 
33 | }
34 | }
35 | 


--------------------------------------------------------------------------------
/Strings/String_rotated_ornot.cpp:
--------------------------------------------------------------------------------
 1 | bool isRotated(string str1, string str2)
 2 | {
 3 |     // Your code here
 4 |     if(str1.length() != str2.length())
 5 |         return false;
 6 |         
 7 |     if(str1.length() <= 2 && str1.compare(str2) == 0)
 8 |         return true;
 9 |     
10 |     if(str1.length() <= 2 && str1.compare(str2) != 0)
11 |         return false;
12 |     
13 |     int i = str1.length();
14 |     
15 |     string sol1 = "";
16 |     sol1 += str1.substr(i-2, 2) + str1.substr(0,i-2);
17 |     
18 |     string sol2 = "";
19 |     sol2 += str1.substr(2, i-2) + str1.substr(0,2);
20 |     
21 |     return (str2.compare(sol1) == 0 || str2.compare(sol2) == 0);
22 | }
23 | 


--------------------------------------------------------------------------------
/Strings/Sumofanoinastring.cpp:
--------------------------------------------------------------------------------
 1 | int findSum(string str)
 2 | {
 3 | 	
 4 | 	// Your code here
 5 | 	int sum=0;
 6 | 	for(int i=0;i<str.length();i++){
 7 | 	   if(isdigit(str[i]))
 8 | 	   {
 9 | 	    int j=i;
10 | 	    while(isdigit(str[j]))
11 | 	       j++;
12 | 	    sum+=atoi((str.substr(i,j-i+1)).c_str());
13 | 	    i=j;
14 | 	   }
15 | 	}
16 | 	return sum;     
17 | 	
18 | }
19 | 


--------------------------------------------------------------------------------
/Tree/BTtoCdll.cpp:
--------------------------------------------------------------------------------
 1 | Node *head=NULL;
 2 | Node *temp=NULL;
 3 | void in(Node *root)
 4 | {
 5 | if(root==NULL)
 6 | {
 7 | return;
 8 | }
 9 | in(root->left);
10 | if(head==NULL)
11 | {
12 | head=root;
13 | temp=head;
14 | }
15 | else
16 | {
17 | temp->right=root;
18 | temp->right->left=temp;
19 | temp=temp->right;
20 | }
21 | in(root->right);
22 | }
23 | Node *bTreeToCList(Node *root)
24 | {
25 | if(root==NULL)
26 | {
27 | return NULL;
28 | }
29 | 
30 | in(root);
31 | temp->right=head;
32 | head->left=temp;
33 | Node *x=head;
34 | head=NULL;
35 | return x;
36 | }
37 | 


--------------------------------------------------------------------------------
/Tree/CheckforBalancedTree.cpp:
--------------------------------------------------------------------------------
 1 | int solve(Node* root,bool &check)
 2 | {
 3 |     if(!root)
 4 |         return 0;
 5 |     
 6 |     int l=solve(root->left,check);
 7 |     int r=solve(root->right,check);
 8 |     
 9 |     if(abs(l-r)>1)
10 |         check=false;
11 |     
12 |     return (max(l,r)+1);    
13 |     
14 | }
15 | 
16 | 
17 | bool isBalanced(Node *root)
18 | {
19 |     bool check=true;
20 |     solve(root,check);
21 |     
22 |     return check;
23 | }
24 | 


--------------------------------------------------------------------------------
/Tree/Checkifsubtree.cpp:
--------------------------------------------------------------------------------
 1 | bool isIdentical(Node *r1, Node *r2)
 2 | {
 3 |     if(r1==NULL&&r2==NULL)
 4 |         return true;
 5 |     else if(r1==NULL&&r2!=NULL)
 6 |         return false;
 7 |     else if(r1!=NULL&&r2==NULL)
 8 |         return false;
 9 |     else if(r1->data==r2->data)
10 |         return (isIdentical(r1->left,r2->left)&&isIdentical(r1->right,r2->right));
11 |     else
12 |         return false;
13 | }
14 | bool isSubTree(Node* T, Node* S) {
15 |     if(S==NULL)
16 |         return true;
17 |     if(T==NULL)
18 |         return false;
19 |     if(isIdentical(T,S)){
20 |         return true;
21 |     }
22 |     return (isSubTree(T->left,S)||isSubTree(T->right,S));
23 | }
24 | 


--------------------------------------------------------------------------------
/Tree/ContructBinaryTree.cpp:
--------------------------------------------------------------------------------
 1 | Node *createTree(int a[], int len)
 2 | {
 3 |     vector<pair<Node*,bool>> arr;
 4 |     for(int i=0;i<len;i++)
 5 |     {
 6 |         Node *temp = new Node(i);
 7 |         temp->left = NULL;
 8 |         temp->right = NULL;
 9 |         arr.push_back(make_pair(temp,false));
10 |     }
11 |     int ans;
12 |     for(int i=0;i<len;i++)
13 |     {
14 |         if(a[i]==-1)
15 |         {
16 |             ans = i;
17 |             continue;
18 |         }
19 |         int parent = a[i];
20 |         bool dir = arr[parent].second;
21 |         if(dir==false)
22 |         {
23 |             (arr[parent]).first->left = arr[i].first;
24 |             (arr[parent]).second = true;
25 |         }
26 |         else
27 |             (arr[parent].first)->right = arr[i].first;
28 |     }
29 |     return arr[ans].first;
30 | }
31 | 


--------------------------------------------------------------------------------
/Tree/Count_noofsub_sum.cpp:
--------------------------------------------------------------------------------
 1 | int countSubtreesWithSumX(Node* root, int x){
 2 |     if(root){
 3 |         int a = countSubtreesWithSumX(root->left,x);
 4 |         int b = countSubtreesWithSumX(root->right,x);
 5 |         if(root->left)
 6 |             root->data += root->left->data;
 7 |         if(root->right)
 8 |             root->data += root->right->data;
 9 |         int ans = a+b;
10 |         if(root->data==x)
11 |             ans++;
12 |         return ans;
13 |     }
14 |     return 0;
15 | }
16 | 


--------------------------------------------------------------------------------
/Tree/Create_nodeat_samelevel.cpp:
--------------------------------------------------------------------------------
 1 | void util(Node *p, int l, map<int , vector<Node * > > &m ){
 2 |     if(!p)return;
 3 |     m[l].push_back(p);
 4 |     util(p->left, l+1,m);
 5 |     util(p->right, l+1, m);
 6 | }
 7 | void connect(Node *p)
 8 | {
 9 |     if(!p)return;
10 |     map<int , vector<Node *> >m;
11 |     util(p,0,m);
12 |     for(auto it = m.begin(); it != m.end(); it++){
13 |         for(int i=0; i< (it->second).size() ; i++){
14 |             if(i !=  (it->second).size() -1){
15 |                 it->second[i]->nextRight = it->second[i+1];
16 |             }
17 |             else{
18 |                 it->second[i]->nextRight = NULL;
19 |                 
20 |             }
21 |         }
22 |     }
23 | }
24 | 


--------------------------------------------------------------------------------
/Tree/DiameterofBT.cpp:
--------------------------------------------------------------------------------
 1 | int find(Node *root,int &h)
 2 | {
 3 | if(root==NULL)return 0;
 4 | int lh=find(root->left,h);
 5 | int rh=find(root->right,h);
 6 | h=max(h,lh+rh+1);
 7 | return max(lh,rh)+1;
 8 | }
 9 | int diameter(Node *root)
10 | {
11 | int h=-1;
12 | find(root,h);
13 | return h;
14 | }
15 | 


--------------------------------------------------------------------------------
/Tree/FOldable.cpp:
--------------------------------------------------------------------------------
 1 | bool areMirror(Node* left, Node* right){
 2 | if(left==NULL && right==NULL)
 3 | return true;
 4 | if(left==NULL|| right==NULL)
 5 | return false;
 6 | return areMirror(left->left,right->right) && areMirror(left->right, right->left);
 7 | }
 8 | bool IsFoldable(Node* root)
 9 | {
10 | if(!root)
11 | return true;
12 | return areMirror(root->left,root->right);
13 | 
14 | }
15 | 


--------------------------------------------------------------------------------
/Tree/LeftViewofBinaryTree.cpp:
--------------------------------------------------------------------------------
 1 | int max_depth=-1;
 2 | 
 3 | void solve(Node* root,int depth) {
 4 | if(!root)
 5 | return;
 6 | if(depth>max_depth)
 7 | {cout<<root->data<<" ";max_depth=depth;}
 8 | 
 9 | solve(root->left,depth+1);
10 | solve(root->right,depth+1);
11 | 
12 | }
13 | void leftView(Node *root)
14 | {
15 | max_depth=-1;
16 | solve(root,0);
17 | }
18 | 


--------------------------------------------------------------------------------
/Tree/LevelOrderTraversal.cpp:
--------------------------------------------------------------------------------
 1 | void levelOrder(Node* root)
 2 | {
 3 |     queue<Node*>q;
 4 |     q.push(root);
 5 |     cout<<root->data<<" ";
 6 |     while(!q.empty())
 7 |     {
 8 |         int g=q.size();
 9 |         while(g--)
10 |         {
11 |             if(q.front()->left)
12 |             { cout<<q.front()->left->data<<" "; q.push(q.front()->left);}
13 |             if(q.front()->right)
14 |            { cout<<q.front()->right->data<<" "; q.push(q.front()->right); }
15 |             q.pop();
16 |         }
17 |     }
18 |     
19 | }
20 | 


--------------------------------------------------------------------------------
/Tree/LevelOrderTraversal_1.cpp:
--------------------------------------------------------------------------------
 1 | void levelOrder(Node* node)
 2 | {   
 3 |     if (!node)  return;
 4 |     queue <Node*> q;
 5 |     q.push(node);
 6 |     q.push(NULL);
 7 |     
 8 |     while (q.size() > 1 ){
 9 |         
10 |         Node *x = q.front();
11 |         q.pop();
12 |         
13 |         if ( x == NULL ){
14 |             cout<<"$ ";
15 |             q.push(NULL);
16 |         }
17 |         
18 |         else{
19 |             cout<< x -> data <<" ";
20 |             if ( x -> left != NULL )
21 |                 q.push( x -> left );
22 |             if ( x -> right != NULL )
23 |                 q.push( x -> right );
24 |                 
25 |         }
26 |         
27 |     }
28 |     cout<<"$";
29 |  
30 | }
31 | 


--------------------------------------------------------------------------------
/Tree/LevelOrderTraversal_SP.cpp:
--------------------------------------------------------------------------------
 1 | void levelorder(Node * root,map<int,vector<pair<int,int> > >&m,int lvl,int hd)
 2 | {
 3 |     if(root==NULL) return;
 4 |     m[lvl].push_back({hd,root->data});
 5 |     levelorder(root->left,m,lvl+1,hd-1);
 6 |     levelorder(root->right,m,lvl+1,hd+1);
 7 | }
 8 | 
 9 | void printSpiral(Node *root)
10 | {
11 |     map<int,vector<pair<int,int> > >  m;
12 |     int lvl=0;
13 |     int hd=0;
14 |     levelorder(root,m,lvl,hd);
15 |      map<int,vector<pair<int,int> > > :: iterator it;
16 |     
17 |      int temp=0;
18 |     for(it=m.begin();it!=m.end();it++)
19 |     {
20 |          //sort(((*it).second).begin(),((*it).second).end());
21 |         if(temp%2==0)
22 |         {
23 |             for(int i=(*it).second.size()-1;i>=0;i--)
24 |             {
25 |                 cout<<((*it).second)[i].second<<" ";
26 |             }
27 |         }
28 |         else
29 |         {
30 |              for(int i=0;i<(*it).second.size();i++)
31 |             {
32 |                 cout<<((*it).second)[i].second<<" ";
33 |             }
34 |         }
35 |         temp++;
36 |     }
37 |     
38 | }
39 | 


--------------------------------------------------------------------------------
/Tree/LowestCOmmonancestor.cpp:
--------------------------------------------------------------------------------
 1 | Node* lca(Node *root, int n1, int n2)
 2 | {
 3 | if(root==NULL)return NULL;
 4 | if((n1<root->data)&&(n2<root->data))
 5 | return lca(root->left,n1,n2);
 6 | if((n1>root->data)&&(n2>root->data))
 7 | return lca(root->right,n1,n2);
 8 | 
 9 | return root;
10 | }
11 | 


--------------------------------------------------------------------------------
/Tree/Makebinarytree.cpp:
--------------------------------------------------------------------------------
 1 | void convert(Node *head, TreeNode *&root) {
 2 |    TreeNode *newnode=new TreeNode(head->data);
 3 |   
 4 |    root=newnode;
 5 |    queue<TreeNode*>q;
 6 |    q.push(root);
 7 |    Node *temp=head->next;
 8 |     TreeNode *new1;
 9 |      TreeNode *new2;
10 |    while(temp!=NULL)
11 |    {  
12 |      new1=new  TreeNode(temp->data);
13 |      TreeNode *t=q.front();
14 |         q.pop();
15 |         t->left=new1;
16 |         q.push(t->left);
17 |        temp=temp->next;
18 |        if(temp!=NULL)
19 |      { new2=new  TreeNode(temp->data);
20 |   t->right=new2;
21 |         q.push(t->right);}
22 |        
23 |        
24 |         if(temp!=NULL)
25 |         temp=temp->next;
26 |        
27 |    }
28 |     // Your code here
29 | }
30 | 


--------------------------------------------------------------------------------
/Tree/Maximu_sum_of_NON-ADJACENT.cpp:
--------------------------------------------------------------------------------
 1 | int getMaxSum(Node *root) {
 2 |     if(root==NULL)
 3 |         return 0;
 4 |     int include_root = 0, exclude_root = 0;
 5 |     if(root->left){
 6 |         include_root+=  getMaxSum(root->left->left)+getMaxSum(root->left->right);
 7 |     }
 8 |     if(root->right)
 9 |         include_root+=  getMaxSum(root->right->left)+getMaxSum(root->right->right);
10 |     include_root+= root->data;
11 |     exclude_root = getMaxSum(root->left) + getMaxSum(root->right);
12 |     return max(include_root,exclude_root);    
13 | }
14 | 


--------------------------------------------------------------------------------
/Tree/Maximum_diffe_bw_NA.cpp:
--------------------------------------------------------------------------------
 1 | int Traverse(Node *root, int &maxm){
 2 |   if(root == nullptr)
 3 |     return INT_MAX;
 4 |   int mini = min(Traverse(root->left, maxm), Traverse(root->right, maxm));
 5 |   maxm = max(maxm, root->data-mini);
 6 |   mini = min(mini, root->data);
 7 |   return mini;
 8 | }
 9 | 
10 | int maxDiff(Node* root){
11 |   int maxm = INT_MIN;
12 |   Traverse(root, maxm);
13 |   return maxm;
14 | }
15 | 


--------------------------------------------------------------------------------
/Tree/Maximum_path_sum.cpp:
--------------------------------------------------------------------------------
 1 | int maxpathsum(Node *root, bool isanytaken)
 2 | {
 3 |     if(root==NULL && isanytaken==false)
 4 |         return INT_MIN;
 5 |     if(root==NULL)
 6 |         return 0;
 7 |     if(isanytaken==false)
 8 |     {
 9 |         int op1 = root->data + maxpathsum(root->left,true);
10 |         int op2 = root->data + maxpathsum(root->right,true);
11 |         int op3 = root->data + maxpathsum(root->left,true) + maxpathsum(root->right,true);
12 |         int op4 = max(maxpathsum(root->left,isanytaken),maxpathsum(root->right,isanytaken));        
13 |         return max(op1,max(op2,max(op3,op4)));
14 |     }
15 |     int op1 = root->data + maxpathsum(root->left,true);
16 |     int op2 = root->data + maxpathsum(root->right,true);
17 |     int op3 = 0;
18 |     return max(op1,max(op2,op3));
19 | }
20 | int findMaxSum(Node* root)
21 | {
22 |     // Your code goes here
23 |     return maxpathsum(root,false);
24 | }
25 | 


--------------------------------------------------------------------------------
/Tree/Maximumwidthoftree.cpp:
--------------------------------------------------------------------------------
 1 | map<int,int>mp;
 2 | int getMaxWidth(Node* root)
 3 | {
 4 | mp.clear();
 5 | if(!root) return 0;
 6 | pair<Node*,int>p;
 7 | queue<pair<Node*,int>>q;
 8 | q.push(make_pair(root,0));
 9 | while(!q.empty()){
10 | p=q.front();
11 | mp[p.second]++;
12 | q.pop();
13 | if(p.first->left){
14 | q.push(make_pair(p.first->left,p.second+1));
15 | }
16 | if(p.first->right){
17 | q.push(make_pair(p.first->right,p.second+1));
18 | }
19 | }
20 | int val=1;
21 | for(auto it=mp.begin();it!=mp.end();it++) val=max(val,it->second);
22 | return val;
23 | }
24 | 


--------------------------------------------------------------------------------
/Tree/MirrorTree.cpp:
--------------------------------------------------------------------------------
 1 | Node * treemirror(Node *P)
 2 | {
 3 | Node *tmp=nullptr;
 4 | 
 5 | if(!P || (!P->left && !P->right)) return P;
 6 | else
 7 | {
 8 | tmp=P->right;
 9 | P->right=treemirror(P->left);
10 | P->left=treemirror(tmp);
11 | }
12 | 
13 | return P;
14 | }
15 | void mirror(Node* node)
16 | {
17 | node=treemirror(node);
18 | }
19 | 


--------------------------------------------------------------------------------
/Tree/Nodeatdistance.cpp:
--------------------------------------------------------------------------------
 1 | bool funcount(Node*root,int k)
 2 | {
 3 | if(root==NULL)
 4 | return false;
 5 | if(!root->left&&!root->right&&!k)
 6 | {
 7 | return true;
 8 | }
 9 | return funcount(root->left,k-1)||funcount(root->right,k-1);
10 | }
11 | int printKDistantfromLeaf(Node* root, int k)
12 | {
13 | int count=0;
14 | if(root==NULL)
15 | return 0;
16 | if(funcount(root,k))
17 | return 1+printKDistantfromLeaf(root->left,k)+printKDistantfromLeaf(root->right,k);
18 | else
19 | return printKDistantfromLeaf(root->left,k)+printKDistantfromLeaf(root->right,k);
20 | 
21 | }
22 | 


--------------------------------------------------------------------------------
/Tree/RightViewofBinaryTree.cpp:
--------------------------------------------------------------------------------
 1 | void traversal(Node*root, map<int,int>&m,int dist)
 2 | {
 3 | if(root==NULL) return;
 4 | m[dist]=root->data;
 5 | traversal(root->left,m,dist+1);
 6 | traversal(root->right,m,dist+1);
 7 | }
 8 | void rightView(Node *root)
 9 | {
10 | map<int,int>m;
11 | traversal(root,m,0);
12 | for(auto i=m.begin(); i!=m.end(); i++)
13 | cout << i->second << " ";
14 | }
15 | 


--------------------------------------------------------------------------------
/Tree/Serialize_and_deserialize.cpp:
--------------------------------------------------------------------------------
 1 | void serialize(Node *root,vector<int> &A)
 2 | {
 3 |     //Your code here
 4 |     if(root==NULL){
 5 |         A.push_back(-1);
 6 |         return;
 7 |     }
 8 |     A.push_back(root->data);
 9 |     serialize(root->left,A);
10 |     serialize(root->right,A);
11 | }
12 | /*this function deserializes
13 |  the serialized vector A*/
14 | 
15 | 
16 | int pre_index = 0;
17 | Node * deSerialize(vector<int> &Arr)
18 | {
19 |     if (pre_index == Arr.size() || Arr[pre_index] == -1) {
20 |         pre_index += 1;
21 |         pre_index %= Arr.size();
22 |         return NULL; 
23 |     } 
24 |     Node *root = new Node(Arr[pre_index]); 
25 |     pre_index += 1;
26 |     pre_index %= Arr.size();
27 |     root->left = deSerialize(Arr); 
28 |     root->right = deSerialize(Arr); 
29 |     return root;
30 | }
31 | 


--------------------------------------------------------------------------------
/Tree/TreefromPostIN.cpp:
--------------------------------------------------------------------------------
 1 | Node *buildTreeUtil(int in[],int post[],int in_st,int in_end,int post_st,int post_end)
 2 | {
 3 |     if(in_end<in_st) return NULL;
 4 |     Node * root = new Node(post[post_end]);
 5 |     if(in_st == in_end) return root;
 6 |     
 7 |     int ind = -1;
 8 |     for(int i=in_st;i<=in_end;i++)
 9 |     {
10 |         if(in[i]==root->data) 
11 |         {
12 |             ind = i;
13 |             break;
14 |         }
15 |     }
16 |     
17 |     root->left = buildTreeUtil(in,post,in_st,ind-1,post_st,post_st+ind-in_st-1);
18 |     root->right = buildTreeUtil(in,post,ind+1,in_end,post_st+ind-in_st,post_end-1);
19 |     return root;
20 | }
21 | Node *buildTree(int in[], int post[], int n)
22 | {
23 |     return(buildTreeUtil(in,post,0,n-1,0,n-1));
24 | }
25 | 


--------------------------------------------------------------------------------
/Tree/VerticalwidthofBT.cpp:
--------------------------------------------------------------------------------
 1 | void vertical_width(Node *root,set<int> &s,int hd)
 2 | {
 3 |     if(root)
 4 |     {
 5 |         s.insert(hd);
 6 |         vertical_width(root->left,s,hd-1);
 7 |         vertical_width(root->right,s,hd+1);
 8 |     }
 9 | }
10 | 
11 | int verticalWidth(Node* root)
12 | {
13 |     set<int> s;
14 |     vertical_width(root,s,0);
15 |     return s.size();
16 | }
17 | 


--------------------------------------------------------------------------------