Oct 2, 2022 · Sep 30, 2022 · Sep 30, 2022 · Sep 30, 2022 · Sep 30, 2022 · Sep 30, 2022
diff --git a/03 string_window.cpp b/03 string_window.cpp
 #include<iostream>
 #include<climits>
 #include<string>
 using namespace std;

 string find_window(string s,string p){


 //Array as a Freq Map or you can hashmap
 int FP[256] = {0};
 int FS[256] = {0};

 for(int i=0;i<p.length();i++){
 FP[ps[i]]++;
 }

 //Sliding Window Algorithm
 int cnt = 0;
 int start = 0; // left contraction
 int start_idx = -1; //start_idx for best window
 int min_so_far = INT_MAX; //large number
 int window_size ;


 for(int i=0 ; i < s.length(); i++){
 //expand the window by including current character
 char ch = s[i];
 FS[ch]++;

 //Count how many characters have been matched till now (string and pattern)
 if(FP[ch]!=0 and FS[ch]<= FP[ch]){
 cnt += 1;
 }

 //another thing
 //if all characters of the pattern are found in the current window then you can start contracting
 if(cnt==p.length()){

 //start contracting from the left to remove unwanted characters

 while(FP[s[start]]==0 or FS[s[start]] > FP[s[start]]){
 FS[s[start]]--;
 start++;
 }

 //note. the window size
 window_size = i - start + 1;
 if(window_size < min_so_far){
 min_so_far = window_size;
 start_idx = start;
 }

 }

 }
 if(start_idx==-1){
 return "No window found";
 }
 return s.substr(start_idx,min_so_far);
 }



 int main(){

 string s,p;
 cin>>s>>p;


    cout<<find_window(s,p)<<endl;



 return 0;
 }
diff --git a/Amazon/AmazonSDE2_AkshatJain.pdf b/Amazon/AmazonSDE2_AkshatJain.pdf
diff --git a/Amazon/AmazonSDE3_Round1.pdf b/Amazon/AmazonSDE3_Round1.pdf
diff --git a/Amazon/AmazonSDE_AkshatJain.docx b/Amazon/AmazonSDE_AkshatJain.docx
diff --git a/Amazon/sheet1.pdf b/Amazon/sheet1.pdf
diff --git a/Amazon/sheet2.pdf b/Amazon/sheet2.pdf
diff --git a/Amazon/sheet3.pdf b/Amazon/sheet3.pdf
diff --git a/Disk Space Analysis.cpp b/Disk Space Analysis.cpp
 #include <bits/stdc++.h>
 using namespace std;
 vector<int> arr;
 int prevmin=-1;
 int flag=0;
 int x,n,q;

 int sorting(int start,int end)
 {
    if(start+1==n) {start=0;end=end-n;}
    if(start==end) return arr[start];
    return min(arr[start],sorting(start+1,end));
 }

 int func(int start,int end)
 {
    if(flag==0) {flag++;return prevmin=sorting(start,end);}
    if(arr[start-1]==prevmin) return prevmin;
    return prevmin=(arr[end]<=prevmin)?prevmin:sorting(start,end);

 }

 int main()
 {
    cin>>x>>n;
    int ans=0;
    for(int i=0;i<n;i++)
    {cin>>q;arr.push_back(q);}
    for(int i=0;i<n;i++)
    {
       ans=max(ans,func(i,i+x-1));
    }
    cout<<ans;
 }
diff --git a/Fundamentals-Signals-Systems.pdf b/Fundamentals-Signals-Systems.pdf
diff --git a/Introduction to control system.pdf b/Introduction to control system.pdf
diff --git a/Linearprobing.C b/Linearprobing.C
 /* Insert keys into an array with linear probing technique of collision resolution technique. */
 /* Data Structures Using C by UDIT AGARWAL */

 #include<stdio.h>
 #include<conio.h>
 #define MAX 10

 int a[MAX];
 void lp(int , int[]);
 void lpsr(int key, int a[MAX]);
 void display(int a[MAX]);

 void main()
 {
 int i, key,ch ;
 clrscr();
 for(i=0;i<MAX;i++)
 a[i] = '\0';
  do{
 printf("\n\n Program for insertion/searching keys with linear probing ");
 printf("\n************************************************************\n\n");
 printf("\n 1. Insert keys ");
 printf("\n 2. Search key ");
 printf("\n 3. Display keys ");
 printf("\n 4. Exit ");
 printf("\n Select operation ");
 scanf("%d",&ch);
 switch(ch)
 {
 case 1: do{
 printf("\n Enter key value [type -1 for termination] ");
 scanf("%d",&key);
 if (key != -1)
    lp(key,a);
 }while(key!=-1);
 display(a);
 break;
 case 2:printf("\n Enter search key value ");
 scanf("%d",&key);
 lpsr(key,a);
 break;
 case 3: display(a);
 break;
 }
 }while(ch!=4);
 }

 /* function lp find a location for key and insert it */
 void lp(int key, int a[MAX])
 {
 int loc;
 loc = key % MAX;
 while (a[loc] !='\0')
 loc = ++loc % MAX;
 a[loc] = key;
 }

 /* function lpsr find a location for a key  */
 void lpsr(int key, int a[MAX])
 {
 int loc;
 loc = key % MAX;
 while ((a[loc] != key) && (a[loc] !='\0'))
 loc=++loc%MAX;
 if (a[loc] != '\0')
 printf("\n Search successful at index %d",loc);
 else
 printf("\n Search unsuccessful ");
 }

 void display(int a[MAX])
 {
 int i;
 printf("\n List of keys ('0' indicate that the location is empty): \n");
 for (i=0;i<MAX;i++)
 printf(" %d ",a[i]);
 }
diff --git a/Power-System-Analysis-Murthy.pdf b/Power-System-Analysis-Murthy.pdf
diff --git a/Principles-of-Power-Systems-by-VK-Mehta.pdf b/Principles-of-Power-Systems-by-VK-Mehta.pdf
diff --git a/ROCK_PAPER_SCISSORS.py b/ROCK_PAPER_SCISSORS.py
 import random

 print("ROCK\nPAPER\nSCISSORS")
 print("-----------------------------\n")
 print("r for rock\np for paper\ns for scissors\n--------\n")

 lst=['r','p','s']

 chance_taken=0
 comp_point=0
 player_point=0
 remain_chance=10

 while(remain_chance>chance_taken):
    ip=input("enter your selection: ")
    c=random.choice(lst)

    if c==ip:
        print("Both tie so 0 point to both")


    elif c=='r' and ip=='p':
        print(f"You entered {ip} and computer entered {c}")
        print("You wins 1 point")
        player_point=player_point+1
        print(f"Your score:{player_point}\t computer score:{comp_point}")

    elif c=='r' and ip=='s':
        print(f"You entered {ip} and computer entered {c}")
        print("Computer wins 1 point")
        comp_point=comp_point+1
        print(f"Your score:{player_point}\t computer score:{comp_point}")

    elif c=='p' and ip=='r':
        print(f"You entered {ip} and computer entered {c}")
        print("Computer wins 1 point")
        comp_point=comp_point+1
        print(f"Your score:{player_point}\t computer score:{comp_point}")

    elif c=='p' and ip=='s':
        print(f"You entered {ip} and computer entered {c}")
        print("You wins 1 point")
        player_point=player_point+1
        print(f"Your score:{player_point}\t computer score:{comp_point}")

    elif c == 's' and ip == 'r':
        print(f"You entered {ip} and computer entered {c}")
        print("You wins 1 point")
        player_point = player_point + 1
        print(f"Your score:{player_point}\t computer score:{comp_point}")

    elif c=='s' and ip=='p':
        print(f"You entered {ip} and computer entered {c}")
        print("Computer wins 1 point")
        comp_point=comp_point+1
        print(f"Your score:{player_point}\t computer score:{comp_point}")

    else:
        print("enter valid choice ")
        continue

    chance_taken=chance_taken+1
    print(f"you have consumed:{chance_taken} chance \t remaing chances :{remain_chance-chance_taken}")
    print("-----------------------------\n")


 if(comp_point==player_point):
    print("Gameover\nThis is a tie")

 elif comp_point>player_point:
    print("Game over\nSorry..you lose..play again")

 elif comp_point<player_point:
    print("Game over\nHurray...You win")

 print(f"Your score :{player_point}\t Computer score :{comp_point}")


diff --git a/RatInAMaze.java b/RatInAMaze.java

 public class RatInAMaze {

 public static boolean ratInAMaze(int maze[][]) {
 int n=maze.length;
 int path[][]= new int[n][n];

 return solveMaze(maze, 0, 0, path);

 }

 public static boolean solveMaze(int maze[][],int i,int j,int[][] path) {

 int n=maze.length;
 //Check if i,j cell is valid or not
 if(i<0 || i>=n || j<0 || j>=n || maze[i][j]==0 || path[i][j]==1) {
 return false;
 }

 //Include the cell in current path
 path[i][j]=1;

 if(i==n-1 && j==n-1) {
 return true;
 }

 //Explore further in all directions
 //top
 if(solveMaze(maze, i-1, j, path)) {
 return true;
 }
 //right
 if(solveMaze(maze, i, j+1, path)) {
 return true;
 }
 //Down
 if(solveMaze(maze, i+1, j, path)) {
 return true;
 }
 //Left
 if(solveMaze(maze, i, j-1, path)) {
 return true;
 }

 return false;

 }

 public static void main(String[] args) {

 int maze[][]= {{1,1,0},{1,0,1},{1,1,1}};
 boolean pathPossible =ratInAMaze(maze);
 System.out.println(pathPossible);

 }

 }
diff --git a/Solutions-Manual-Automatic-Control-Systems-9th-Edition-by-KUO.pdf b/Solutions-Manual-Automatic-Control-Systems-9th-Edition-by-KUO.pdf
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,75 @@
		#include<iostream>
		#include<climits>
		#include<string>
		using namespace std;

		string find_window(string s,string p){


		//Array as a Freq Map or you can hashmap
		int FP[256] = {0};
		int FS[256] = {0};

		for(int i=0;i<p.length();i++){
		FP[ps[i]]++;
		}

		//Sliding Window Algorithm
		int cnt = 0;
		int start = 0; // left contraction
		int start_idx = -1; //start_idx for best window
		int min_so_far = INT_MAX; //large number
		int window_size ;


		for(int i=0 ; i < s.length(); i++){
		//expand the window by including current character
		char ch = s[i];
		FS[ch]++;

		//Count how many characters have been matched till now (string and pattern)
		if(FP[ch]!=0 and FS[ch]<= FP[ch]){
		cnt += 1;
		}

		//another thing
		//if all characters of the pattern are found in the current window then you can start contracting
		if(cnt==p.length()){

		//start contracting from the left to remove unwanted characters

		while(FP[s[start]]==0 or FS[s[start]] > FP[s[start]]){
		FS[s[start]]--;
		start++;
		}

		//note. the window size
		window_size = i - start + 1;
		if(window_size < min_so_far){
		min_so_far = window_size;
		start_idx = start;
		}

		}

		}
		if(start_idx==-1){
		return "No window found";
		}
		return s.substr(start_idx,min_so_far);
		}



		int main(){

		string s,p;
		cin>>s>>p;


		cout<<find_window(s,p)<<endl;



		return 0;
		}
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,34 @@
		#include <bits/stdc++.h>
		using namespace std;
		vector<int> arr;
		int prevmin=-1;
		int flag=0;
		int x,n,q;

		int sorting(int start,int end)
		{
		if(start+1==n) {start=0;end=end-n;}
		if(start==end) return arr[start];
		return min(arr[start],sorting(start+1,end));
		}

		int func(int start,int end)
		{
		if(flag==0) {flag++;return prevmin=sorting(start,end);}
		if(arr[start-1]==prevmin) return prevmin;
		return prevmin=(arr[end]<=prevmin)?prevmin:sorting(start,end);

		}

		int main()
		{
		cin>>x>>n;
		int ans=0;
		for(int i=0;i<n;i++)
		{cin>>q;arr.push_back(q);}
		for(int i=0;i<n;i++)
		{
		ans=max(ans,func(i,i+x-1));
		}
		cout<<ans;
		}
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,77 @@
		/* Insert keys into an array with linear probing technique of collision resolution technique. */
		/* Data Structures Using C by UDIT AGARWAL */

		#include<stdio.h>
		#include<conio.h>
		#define MAX 10

		int a[MAX];
		void lp(int , int[]);
		void lpsr(int key, int a[MAX]);
		void display(int a[MAX]);

		void main()
		{
		int i, key,ch ;
		clrscr();
		for(i=0;i<MAX;i++)
		a[i] = '\0';
		do{
		printf("\n\n Program for insertion/searching keys with linear probing ");
		printf("\n************************************************************\n\n");
		printf("\n 1. Insert keys ");
		printf("\n 2. Search key ");
		printf("\n 3. Display keys ");
		printf("\n 4. Exit ");
		printf("\n Select operation ");
		scanf("%d",&ch);
		switch(ch)
		{
		case 1: do{
		printf("\n Enter key value [type -1 for termination] ");
		scanf("%d",&key);
		if (key != -1)
		lp(key,a);
		}while(key!=-1);
		display(a);
		break;
		case 2:printf("\n Enter search key value ");
		scanf("%d",&key);
		lpsr(key,a);
		break;
		case 3: display(a);
		break;
		}
		}while(ch!=4);
		}

		/* function lp find a location for key and insert it */
		void lp(int key, int a[MAX])
		{
		int loc;
		loc = key % MAX;
		while (a[loc] !='\0')
		loc = ++loc % MAX;
		a[loc] = key;
		}

		/* function lpsr find a location for a key */
		void lpsr(int key, int a[MAX])
		{
		int loc;
		loc = key % MAX;
		while ((a[loc] != key) && (a[loc] !='\0'))
		loc=++loc%MAX;
		if (a[loc] != '\0')
		printf("\n Search successful at index %d",loc);
		else
		printf("\n Search unsuccessful ");
		}

		void display(int a[MAX])
		{
		int i;
		printf("\n List of keys ('0' indicate that the location is empty): \n");
		for (i=0;i<MAX;i++)
		printf(" %d ",a[i]);
		}
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,78 @@
		import random

		print("ROCK\nPAPER\nSCISSORS")
		print("-----------------------------\n")
		print("r for rock\np for paper\ns for scissors\n--------\n")

		lst=['r','p','s']

		chance_taken=0
		comp_point=0
		player_point=0
		remain_chance=10

		while(remain_chance>chance_taken):
		ip=input("enter your selection: ")
		c=random.choice(lst)

		if c==ip:
		print("Both tie so 0 point to both")


		elif c=='r' and ip=='p':
		print(f"You entered {ip} and computer entered {c}")
		print("You wins 1 point")
		player_point=player_point+1
		print(f"Your score:{player_point}\t computer score:{comp_point}")

		elif c=='r' and ip=='s':
		print(f"You entered {ip} and computer entered {c}")
		print("Computer wins 1 point")
		comp_point=comp_point+1
		print(f"Your score:{player_point}\t computer score:{comp_point}")

		elif c=='p' and ip=='r':
		print(f"You entered {ip} and computer entered {c}")
		print("Computer wins 1 point")
		comp_point=comp_point+1
		print(f"Your score:{player_point}\t computer score:{comp_point}")

		elif c=='p' and ip=='s':
		print(f"You entered {ip} and computer entered {c}")
		print("You wins 1 point")
		player_point=player_point+1
		print(f"Your score:{player_point}\t computer score:{comp_point}")

		elif c == 's' and ip == 'r':
		print(f"You entered {ip} and computer entered {c}")
		print("You wins 1 point")
		player_point = player_point + 1
		print(f"Your score:{player_point}\t computer score:{comp_point}")

		elif c=='s' and ip=='p':
		print(f"You entered {ip} and computer entered {c}")
		print("Computer wins 1 point")
		comp_point=comp_point+1
		print(f"Your score:{player_point}\t computer score:{comp_point}")

		else:
		print("enter valid choice ")
		continue

		chance_taken=chance_taken+1
		print(f"you have consumed:{chance_taken} chance \t remaing chances :{remain_chance-chance_taken}")
		print("-----------------------------\n")


		if(comp_point==player_point):
		print("Gameover\nThis is a tie")

		elif comp_point>player_point:
		print("Game over\nSorry..you lose..play again")

		elif comp_point<player_point:
		print("Game over\nHurray...You win")

		print(f"Your score :{player_point}\t Computer score :{comp_point}")
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,57 @@

		public class RatInAMaze {

		public static boolean ratInAMaze(int maze[][]) {
		int n=maze.length;
		int path[][]= new int[n][n];

		return solveMaze(maze, 0, 0, path);

		}

		public static boolean solveMaze(int maze[][],int i,int j,int[][] path) {

		int n=maze.length;
		//Check if i,j cell is valid or not
		if(i<0 \|\| i>=n \|\| j<0 \|\| j>=n \|\| maze[i][j]==0 \|\| path[i][j]==1) {
		return false;
		}

		//Include the cell in current path
		path[i][j]=1;

		if(i==n-1 && j==n-1) {
		return true;
		}

		//Explore further in all directions
		//top
		if(solveMaze(maze, i-1, j, path)) {
		return true;
		}
		//right
		if(solveMaze(maze, i, j+1, path)) {
		return true;
		}
		//Down
		if(solveMaze(maze, i+1, j, path)) {
		return true;
		}
		//Left
		if(solveMaze(maze, i, j-1, path)) {
		return true;
		}

		return false;

		}

		public static void main(String[] args) {

		int maze[][]= {{1,1,0},{1,0,1},{1,1,1}};
		boolean pathPossible =ratInAMaze(maze);
		System.out.println(pathPossible);

		}

		}