𝐅𝐢𝐧𝐚𝐥 𝐏𝐫𝐨𝐣𝐞𝐜𝐭

Author: Ashish2030

OopsBasics

@@ -0,0 +1,155 @@
+#include<iostream>
+using namespace std;
+
+class Car{
+
+private:
+
+	string name;
+	float price;
+	int model;
+	bool isAbs;
+
+public:
+
+	/*
+		Default Functions or Methods
+			1.Constructor
+			2.Destructor
+			3.Copy Constructor
+			4.Copy Assignment Operator
+	
+	*/
+
+
+	// Constructor
+
+	// Default Constructor
+	Car(){
+		cout<<"Constructer Called!!"<<endl;
+	}
+
+	// Parametarised Constructor
+	Car(string n,float p,int m){
+		price=p;
+		model=m;
+		name=n;
+		isAbs=false;
+		cout<<"Parametarised Constructor Called!!!!"<<endl;
+	}
+
+	Car(float p,int m,string n){
+		price=p;
+		model=m;
+		name=n;
+		isAbs=true;
+		cout<<"Second Parametarised Constructor Called"<<endl;
+	}
+
+	// Setter
+	void make_car(string n,float p,int m,bool ibs){
+		name=n;
+
+		if(p<0){
+			price=20000;
+		}
+		model=m;
+		isAbs=ibs;
+	}
+
+	// Getter
+	void showCar(){
+		cout<<"Name : "<<name<<endl;
+		cout<<"Price : "<<price<<endl;
+		cout<<"Model : "<<model<<endl;
+		isAbs==true?cout<<"ABS"<<endl:cout<<"Non-ABS"<<endl;
+
+	}
+
+	void updatePrice(int p){
+
+		price=p;
+
+		return;
+	}
+
+	// Copy Constructor
+
+	Car(Car &X){
+		name=X.name;
+		price=X.price;
+		model=X.model;
+		isAbs=X.isAbs;
+
+		cout<<"Copy Constructor Called"<<endl;
+	}
+
+
+	// Destructor
+	~Car(){
+		cout<<"Destructor is Called!!!!"<<endl;
+	}
+
+
+	// Friend Function in C++
+	friend int getPrice(Car X);
+
+};
+
+int getPrice(Car X){
+
+
+	return X.price;
+}
+
+
+
+void fun(){
+
+	Car X("Range Rover",40000000,2020);
+	X.showCar();
+	X.updatePrice(200);
+	X.showCar();
+
+
+}
+
+int main(){
+
+
+	// Car A,B;
+	// A.make_car("Audi",202.2020,1999,false);
+	// A.showCar();
+
+	// B.make_car("Scorpio",-100,2050,true);
+	// B.showCar();
+
+	// Car D("Maruti",10000,2030);
+	// D.showCar();
+
+	// Car E(100.5,2015,"BMW");
+	// E.showCar();
+
+	// fun();
+
+	// Car Y("Audi",100,2014);
+
+	Car *ptr=new Car("Bulero",500,2050);
+	
+	ptr->showCar();	
+
+	delete ptr;
+	// Y.showCar();
+
+	// Car Z(Y);
+	// Z.updatePrice(3000);
+	// Z.showCar();
+
+
+	// int price=getPrice(Z);
+	// cout<<"Price of Z Car is : "<<price<<endl;
+
+
+ 
+ return 0;
+}

OopsBasics.cpp

@@ -0,0 +1,118 @@
+#include<iostream>
+#include<unordered_map>
+#include<cstring>
+using namespace std;
+
+
+class node{
+public:
+
+	bool isTerminal;
+	char ch;
+	unordered_map<char,node*>mp;
+
+	node(char data){
+		ch=data;
+		isTerminal=false;
+	}
+};
+
+class Trie{
+
+	node*root;
+
+public:
+
+	Trie(){
+		root=new node('\0');
+	}
+
+	void AddWord(string word){
+
+		node*temp=root;
+
+		for(int i=0;i<word.size();i++){
+			char ch=word[i];
+			if(temp->mp.count(ch)==0){
+				node*n=new node(ch);
+				temp->mp[ch]=n;
+				temp=n;
+			}else{
+				temp=temp->mp[ch];
+			}
+
+		}
+		temp->isTerminal=true;
+	}
+
+	bool searchWord(string word){
+
+		node*temp=root;
+
+		for(int i=0;i<word.size();i++){
+			char ch=word[i];
+
+			if(temp->mp.count(ch)==0){
+				return false;
+			}else{
+				temp=temp->mp[ch];
+			}
+		}
+		return temp->isTerminal;
+	}
+
+	void solve(char ch,node*temp,vector<char>p){
+
+		if(temp->isTerminal==true and mp.count(temp->char)==0){
+			return;
+		}
+
+		for(auto x:temp->mp[ch]){
+			
+		}
+
+
+
+	}
+
+	void print(string word){
+		node*temp=root;
+		vector<char>p;
+
+		for(int i=0;i<word.size();i++){
+			char ch=word[i];
+			if(temp->mp.count(ch)==0){
+				return;
+			}else{
+				temp=temp->mp[ch];
+				p.push_back(ch);
+				solve(char ch,temp,p);
+			}
+		}
+
+	}
+
+	
+
+};
+
+
+int main(){
+ 	
+
+	Trie T;
+
+	T.AddWord("bat");
+	T.AddWord("batman");
+	T.AddWord("aabbc");
+	T.AddWord("abc");
+
+	if(T.searchWord("batman")){
+		cout<<"Present"<<endl;
+	}else{
+		cout<<"Not Present"<<endl;
+	}
+
+ 
+ return 0;
+}

SelectionSort

@@ -0,0 +1,47 @@
+#include<iostream>
+using namespace std;
+
+int solve(int a[][50],int i,int j,int r,int c){
+
+	if(i<0||j<0||i>=r||j>=c||a[i][j]!=1){
+		return 0;
+	}
+
+	a[i][j]=2;
+
+	int q1=solve(a,i-1,j,r,c);
+	int q2=solve(a,i+1,j,r,c);
+	int q3=solve(a,i,j-1,r,c);
+	int q4=solve(a,i,j+1,r,c);
+
+	return 1+q1+q2+q3+q4;
+}
+
+int main(){
+ 	
+ 	int n,m;
+ 	cin>>n>>m;
+
+ 	int a[50][50];
+
+ 	for(int i=0;i<n;i++){
+ 		for(int j=0;j<m;j++){
+ 			cin>>a[i][j];
+ 		}
+ 	} 
+
+ 	int maxArea=INT_MIN;
+ 	
+ 	for(int i=0;i<n;i++){
+ 		for(int j=0;j<m;j++){
+ 			if(a[i][j]==1){
+ 				int area=solve(a,i,j,n,m);
+ 				maxArea=max(area,maxArea);
+ 			}
+ 		}
+ 	}
+
+ 	cout<<maxArea<<endl;
+ 
+ return 0;
+}

Test

@@ -0,0 +1,41 @@
+
+bool compare(vector<int>a,vector<int>b){
+    
+    return a[0]<b[0];
+}
+
+class Solution {
+public:
+    vector<vector<int>> merge(vector<vector<int>>& intervals) {
+        
+        sort(intervals.begin(),intervals.end());
+        int n=intervals.size();
+        
+        vector<vector<int>>ans;
+    
+        vector<int>curr=intervals[0];
+        int s=intervals[0][0];
+        int e=intervals[0][1];
+        
+        
+        for(int i=1;i<n;i++){
+            
+            if(e>=intervals[i][0]){
+                s=min(intervals[i][0],s);
+                e=max(intervals[i][1],e);
+            }
+            else{
+                ans.push_back({s,e});
+                s=intervals[i][0];
+                e=intervals[i][1];
+                
+            }
+        }
+        
+        ans.push_back({s,e});
+        
+        
+        
+        return ans;
+    }
+};