├── Images ├── v.png ├── Aditya.jpg ├── Divya.jpg ├── Jai.jpeg ├── Lsam18.png ├── ananya.jpg ├── ankit.jpg ├── biyu.png ├── debghs.png ├── eshu.png ├── mrlive.jpg ├── sachin.jpg ├── yash.jpg ├── 69886936.jpg ├── 72961594.png ├── Abhish7k.jpg ├── Atharva.jpg ├── Hrishap.jpg ├── Mannxxx.png ├── Sreerag.jpg ├── bharath.jpeg ├── manisha.jpg ├── porkalai.jpg ├── saurabh.jpg ├── shinchan.png ├── shourya.jpg ├── C0dewordSky.jpg ├── Dhananjay.png ├── OmBhambale.jpg ├── RajMishra.jpg ├── Sahil-K123.jpeg ├── krishaynair.jpg ├── xvisierra.png ├── Ashish Mishra.jpg ├── digvijayimg.jpeg ├── hritikkumar.jpeg ├── yuvrajverma.jpeg ├── AnirudhBelwadi.jpeg ├── Satyajit-2003.jpeg ├── SyedSumaimaly.jpeg ├── digvijaysinghh.jpeg ├── piyush_jindal.jpeg ├── HarshitVijayKumar.png ├── Rupayan-Dirghangi.jpg ├── ashfaque-mustaque.png ├── shubhankar-ranjan.jpg ├── koppisettivenkatesh.jpg └── PicsArt_01-21-08.53.26.jpg ├── assets ├── hka.png ├── .DS_Store ├── images │ ├── Yash.jpg │ ├── sami.jpg │ ├── Aditya.jpg │ ├── Ananya.jpg │ ├── Divya.jpg │ ├── Lsam18.png │ ├── Mansi.jpg │ ├── ankit.jpg │ ├── aviral.jpg │ ├── rikin.jpg │ ├── Atharva.jpg │ ├── Sreerag.jpg │ ├── bharath.jpeg │ ├── manisha.jpg │ ├── nimishhh.jpeg │ ├── porkalai.jpg │ ├── shourya.jpg │ ├── soubhik.jpg │ ├── Satyajit-2003.jpeg │ ├── SyedSumaimaly.jpeg │ ├── AnirudhBelwadi.jpeg │ ├── digvijaysinghh.jpeg │ ├── Rupayan-Dirghangi.jpg │ ├── koppisettivenkatesh.jpg │ └── shubhankar-ranjan.jpg ├── favicon-16x16.png └── favicon-32x32.png ├── .github ├── logo.png └── ananya.jpg ├── participant ├── biyu.md ├── thebigjoe29.md ├── xvisierra.md ├── porkalai.md ├── C0dewordSky.md ├── v.md ├── sachin.md ├── Divya.md ├── Gayathri.md ├── Himanshu.md ├── Sami.md ├── debghs.md ├── yuvrajverma01.md ├── Mannxxx.md ├── Pallavi.md ├── Sahil.md ├── Satyajit-2003.md ├── SaurabhTripathi25.md ├── digvijay.md ├── Rupayan13.md ├── Abhish7k ├── OmBhambale.md ├── RajMishra.md ├── Shourya.md ├── SyedSumaimaly.md ├── anirudhbelwadi.md ├── digvijaysinghh.md ├── Ankit.md ├── Hrishap.md ├── Jai.md ├── lsam18.md ├── rikin.md ├── Dhananjay.md ├── Rudra.md ├── Yash.md ├── piyush.md ├── Ash0807.md ├── Aviral.md ├── Nitin.md ├── Ananya.md ├── Atharva.md ├── KrishayNair.md ├── Sreerag.md ├── manisha.md ├── prajjwal.md ├── shubhankar-ranjan.md ├── ashfaque-mustaque.md ├── HarshitVijayKumar.md ├── Hritik_kumar.md ├── BharathKumar.md ├── Aditya.md └── koppisettivenkatesh.md ├── Project ├── Cpp Progs │ ├── commit │ ├── valid anagram.cpp │ ├── SimpleInterest.cpp │ ├── Pyramid pattern │ ├── Sum of digits │ ├── armstrongNumber.cpp │ ├── FloyedTriangle.cpp │ ├── Fibonacci program │ ├── Reverse a number │ ├── Prime Number.cpp │ ├── fahrenheitToCelsius │ ├── sorting │ │ ├── bubbleSort.cpp │ │ └── quickSort.cpp │ ├── Sum of Subset.cpp │ ├── PascalTriangle.cpp │ ├── Kadanes.cpp │ ├── Linked_List_Cycle.cpp │ ├── sortzeroone.cpp │ ├── 3 Sum Closest.cpp │ ├── Letter Combinations of a phone number.cpp │ ├── 3 Sum.cpp │ ├── 4 Sum.cpp │ ├── KMPmatcher_Mohak1301.cpp │ ├── Boundary-traversal-of-matrix │ ├── Prims.cpp │ ├── mergesort.cpp │ ├── TowerOfHanoi.cpp │ ├── Check-if-Tree-is-Isomorphic.cpp │ └── FibonacciHeap.cpp └── Python Progs │ ├── 136-single-number.py │ ├── 198-house-robber.py │ ├── linear-search.py │ ├── Dynamic programming.py │ ├── Kadane's-Algorithm │ ├── 151-reverse-words-in-a-string.py │ ├── 62-unique-paths.py │ ├── second_max_num.py │ ├── knapsack │ ├── 162-find-peak-element.py │ ├── sorting │ └── bubbleSort.py │ ├── Binarysearch_ineedtochangemyusername.py │ ├── remove_duplicates.py │ ├── 11-container-with-most-water.py │ ├── Dijkastra_ineedtochangemyusername.py │ ├── FloyddWarshall.py │ ├── 104-maximum-depth-of-binary-tree.py │ ├── Stack.py │ ├── d10.py │ ├── 72-edit-distance.py │ ├── 17-letter-combinations-of-a-phone-number.py │ ├── 199-binary-tree-right-side-view.py │ ├── graph.py │ ├── mergeSort.py │ ├── simple-linear-regressioni.py │ ├── linked list.py │ ├── 208-implement-trie-prefix-tree.py │ ├── Interactive-pet.py │ ├── Vigenere.py │ ├── Calculator.py │ ├── Passwordmanager.py │ └── calender.py ├── palidrome.py ├── README.md ├── style.css └── index.html /Images/v.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/v.png -------------------------------------------------------------------------------- /assets/hka.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/hka.png -------------------------------------------------------------------------------- /.github/logo.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/.github/logo.png -------------------------------------------------------------------------------- /Images/Aditya.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Aditya.jpg -------------------------------------------------------------------------------- /Images/Divya.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Divya.jpg -------------------------------------------------------------------------------- /Images/Jai.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Jai.jpeg -------------------------------------------------------------------------------- /Images/Lsam18.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Lsam18.png -------------------------------------------------------------------------------- /Images/ananya.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/ananya.jpg -------------------------------------------------------------------------------- /Images/ankit.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/ankit.jpg -------------------------------------------------------------------------------- /Images/biyu.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/biyu.png -------------------------------------------------------------------------------- /Images/debghs.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/debghs.png -------------------------------------------------------------------------------- /Images/eshu.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/eshu.png -------------------------------------------------------------------------------- /Images/mrlive.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/mrlive.jpg -------------------------------------------------------------------------------- /Images/sachin.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/sachin.jpg -------------------------------------------------------------------------------- /Images/yash.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/yash.jpg -------------------------------------------------------------------------------- /assets/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/.DS_Store -------------------------------------------------------------------------------- /.github/ananya.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/.github/ananya.jpg -------------------------------------------------------------------------------- /Images/69886936.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/69886936.jpg -------------------------------------------------------------------------------- /Images/72961594.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/72961594.png -------------------------------------------------------------------------------- /Images/Abhish7k.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Abhish7k.jpg -------------------------------------------------------------------------------- /Images/Atharva.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Atharva.jpg -------------------------------------------------------------------------------- /Images/Hrishap.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Hrishap.jpg -------------------------------------------------------------------------------- /Images/Mannxxx.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Mannxxx.png -------------------------------------------------------------------------------- /Images/Sreerag.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Sreerag.jpg -------------------------------------------------------------------------------- /Images/bharath.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/bharath.jpeg -------------------------------------------------------------------------------- /Images/manisha.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/manisha.jpg -------------------------------------------------------------------------------- /Images/porkalai.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/porkalai.jpg -------------------------------------------------------------------------------- /Images/saurabh.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/saurabh.jpg -------------------------------------------------------------------------------- /Images/shinchan.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/shinchan.png -------------------------------------------------------------------------------- /Images/shourya.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/shourya.jpg -------------------------------------------------------------------------------- /participant/biyu.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Abiha Sami 3 | Institution: CUST University 4 | Github: CodingBiyu 5 | --- -------------------------------------------------------------------------------- /participant/thebigjoe29.md: -------------------------------------------------------------------------------- 1 | name: eshaan joshi 2 | institution/company: VIT Chennai 3 | github:thebigjoe29 -------------------------------------------------------------------------------- /participant/xvisierra.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Sameer 3 | institution/company: RNSIT 4 | github: xvisierra 5 | --- -------------------------------------------------------------------------------- /Images/C0dewordSky.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/C0dewordSky.jpg -------------------------------------------------------------------------------- /Images/Dhananjay.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Dhananjay.png -------------------------------------------------------------------------------- /Images/OmBhambale.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/OmBhambale.jpg -------------------------------------------------------------------------------- /Images/RajMishra.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/RajMishra.jpg -------------------------------------------------------------------------------- /Images/Sahil-K123.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Sahil-K123.jpeg -------------------------------------------------------------------------------- /Images/krishaynair.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/krishaynair.jpg -------------------------------------------------------------------------------- /Images/xvisierra.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/xvisierra.png -------------------------------------------------------------------------------- /assets/images/Yash.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/Yash.jpg -------------------------------------------------------------------------------- /assets/images/sami.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/sami.jpg -------------------------------------------------------------------------------- /participant/porkalai.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Porkalai Selvi S 3 | institution/company: PSG 4 | github: porkalai39 5 | --- -------------------------------------------------------------------------------- /Images/Ashish Mishra.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Ashish Mishra.jpg -------------------------------------------------------------------------------- /Images/digvijayimg.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/digvijayimg.jpeg -------------------------------------------------------------------------------- /Images/hritikkumar.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/hritikkumar.jpeg -------------------------------------------------------------------------------- /Images/yuvrajverma.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/yuvrajverma.jpeg -------------------------------------------------------------------------------- /assets/favicon-16x16.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/favicon-16x16.png -------------------------------------------------------------------------------- /assets/favicon-32x32.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/favicon-32x32.png -------------------------------------------------------------------------------- /assets/images/Aditya.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/Aditya.jpg -------------------------------------------------------------------------------- /assets/images/Ananya.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/Ananya.jpg -------------------------------------------------------------------------------- /assets/images/Divya.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/Divya.jpg -------------------------------------------------------------------------------- /assets/images/Lsam18.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/Lsam18.png -------------------------------------------------------------------------------- /assets/images/Mansi.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/Mansi.jpg -------------------------------------------------------------------------------- /assets/images/ankit.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/ankit.jpg -------------------------------------------------------------------------------- /assets/images/aviral.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/aviral.jpg -------------------------------------------------------------------------------- /assets/images/rikin.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/rikin.jpg -------------------------------------------------------------------------------- /participant/C0dewordSky.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Aakash 3 | institution/Company: xFusionCorp 4 | github:C0dewordSky 5 | --- -------------------------------------------------------------------------------- /participant/v.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: VARTIKA GOEL 3 | institution/company: AMITY UNIVERSITY 4 | github: vartikagoel01 5 | --- -------------------------------------------------------------------------------- /Images/AnirudhBelwadi.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/AnirudhBelwadi.jpeg -------------------------------------------------------------------------------- /Images/Satyajit-2003.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Satyajit-2003.jpeg -------------------------------------------------------------------------------- /Images/SyedSumaimaly.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/SyedSumaimaly.jpeg -------------------------------------------------------------------------------- /Images/digvijaysinghh.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/digvijaysinghh.jpeg -------------------------------------------------------------------------------- /Images/piyush_jindal.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/piyush_jindal.jpeg -------------------------------------------------------------------------------- /assets/images/Atharva.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/Atharva.jpg -------------------------------------------------------------------------------- /assets/images/Sreerag.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/Sreerag.jpg -------------------------------------------------------------------------------- /assets/images/bharath.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/bharath.jpeg -------------------------------------------------------------------------------- /assets/images/manisha.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/manisha.jpg -------------------------------------------------------------------------------- /assets/images/nimishhh.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/nimishhh.jpeg -------------------------------------------------------------------------------- /assets/images/porkalai.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/porkalai.jpg -------------------------------------------------------------------------------- /assets/images/shourya.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/shourya.jpg -------------------------------------------------------------------------------- /assets/images/soubhik.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/soubhik.jpg -------------------------------------------------------------------------------- /participant/sachin.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Sachin 3 | institution/company: MBM University 4 | github:sachinbarupal 5 | --- 6 | -------------------------------------------------------------------------------- /Images/HarshitVijayKumar.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/HarshitVijayKumar.png -------------------------------------------------------------------------------- /Images/Rupayan-Dirghangi.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/Rupayan-Dirghangi.jpg -------------------------------------------------------------------------------- /Images/ashfaque-mustaque.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/ashfaque-mustaque.png -------------------------------------------------------------------------------- /Images/shubhankar-ranjan.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/shubhankar-ranjan.jpg -------------------------------------------------------------------------------- /participant/Divya.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Divya 3 | institution/company: Infosis, Pune 4 | github: https://github.com/DivyaSis 5 | --- -------------------------------------------------------------------------------- /participant/Gayathri.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Gayathri Sankar 3 | institution/company: MITS 4 | github: gayathri-commits 5 | --- 6 | -------------------------------------------------------------------------------- /participant/Himanshu.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Himanshu 3 | Institution/company: DTU 4 | Github: https://github.com/him2016 5 | --- 6 | -------------------------------------------------------------------------------- /participant/Sami.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Muhammad Sami Bhat 3 | institution/company: Galgotias University 4 | github:msami625 5 | --- -------------------------------------------------------------------------------- /Images/koppisettivenkatesh.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/koppisettivenkatesh.jpg -------------------------------------------------------------------------------- /assets/images/Satyajit-2003.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/Satyajit-2003.jpeg -------------------------------------------------------------------------------- /assets/images/SyedSumaimaly.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/SyedSumaimaly.jpeg -------------------------------------------------------------------------------- /participant/debghs.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: debghs 3 | Institution/company: Jadavpur University 4 | Github: https://github.com/debghs 5 | --- -------------------------------------------------------------------------------- /participant/yuvrajverma01.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Yuvraj Verma 3 | institution/company: Chitkara University 4 | github: yuvrajverma01 5 | --- -------------------------------------------------------------------------------- /Images/PicsArt_01-21-08.53.26.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/Images/PicsArt_01-21-08.53.26.jpg -------------------------------------------------------------------------------- /assets/images/AnirudhBelwadi.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/AnirudhBelwadi.jpeg -------------------------------------------------------------------------------- /assets/images/digvijaysinghh.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/digvijaysinghh.jpeg -------------------------------------------------------------------------------- /participant/Mannxxx.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Mansi 3 | institution/company: Indian Institute of Technology Delhi 4 | github:Mannxxx 5 | --- 6 | -------------------------------------------------------------------------------- /participant/Pallavi.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: PALLAVI 3 | institution/company: IIT (BHU), VARANASI 4 | github: https://github.com/PS-11 5 | --- 6 | -------------------------------------------------------------------------------- /participant/Sahil.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Sahil 3 | institution: Swami Keshvanand Institute of Technology, Jaipur 4 | github: Sahil-K123 5 | --- -------------------------------------------------------------------------------- /participant/Satyajit-2003.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Satyajit Satapathy 3 | institution/company: KIIT University 4 | github:Satyajit-2003 5 | --- -------------------------------------------------------------------------------- /assets/images/Rupayan-Dirghangi.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/Rupayan-Dirghangi.jpg -------------------------------------------------------------------------------- /assets/images/koppisettivenkatesh.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/koppisettivenkatesh.jpg -------------------------------------------------------------------------------- /assets/images/shubhankar-ranjan.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FarhaKousar1601/Hacktoberfest2023/HEAD/assets/images/shubhankar-ranjan.jpg -------------------------------------------------------------------------------- /participant/SaurabhTripathi25.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Saurabh Kumar Tripathi 3 | institution/company: BIET,Jhansi 4 | github:SaurabhTripathi25 5 | --- -------------------------------------------------------------------------------- /participant/digvijay.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Digvijay shelar 3 | institution/company: Bhavans vivekananda college 4 | github:shelar1423 5 | --- 6 | -------------------------------------------------------------------------------- /participant/Rupayan13.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: RUPAYAN DIRGHANGI 3 | institution/company: GURU NANAK INSTITUTE OF TECHNOLOGY 4 | github: Rupayan13 5 | --- -------------------------------------------------------------------------------- /participant/Abhish7k: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Abhishek 3 | Institution/company: Savitribai Phule Pune University 4 | Github: https://github.com/Abhish7k 5 | --- 6 | -------------------------------------------------------------------------------- /participant/OmBhambale.md: -------------------------------------------------------------------------------- 1 | name: Om Bhambale 2 | institution/company: MCT's Rajiv Gandhi Institute of Technology, Versova, Mumbai 3 | github:OmBhambale -------------------------------------------------------------------------------- /participant/RajMishra.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Raj Mishra 3 | institution/company: National Institute of Technology Rourkela 4 | github:rajmishra-47 5 | --- 6 | -------------------------------------------------------------------------------- /participant/Shourya.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Shourya 3 | institution/company: School of Information technology RGPV 4 | github:shouryasinghrathore 5 | --- 6 | -------------------------------------------------------------------------------- /participant/SyedSumaimaly.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Syed Sumaim Ali 3 | Institution/company: WebSensePro 4 | Github: https://github.com/SyedSumaimaly 5 | --- 6 | -------------------------------------------------------------------------------- /participant/anirudhbelwadi.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Anirudh Belwadi 3 | Institution/company: Reliance Jio 4 | Github: https://github.com/anirudhbelwadi 5 | --- -------------------------------------------------------------------------------- /participant/digvijaysinghh.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Digvijay Singh 3 | institution/company: GL Bajaj Institute of Management 4 | github: digvijaysinghh 5 | --- -------------------------------------------------------------------------------- /participant/Ankit.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Ankit Goyal 3 | Institution/company: JCD Vidyapeeth Colleghe Of Engineering 4 | Github: https://github.com/Ankit9126 5 | --- -------------------------------------------------------------------------------- /participant/Hrishap.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Hrishap Joshi 3 | institution/company: Indian Institute of Information Technology , Lucknow 4 | github:Hrishap 5 | --- -------------------------------------------------------------------------------- /participant/Jai.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Jai Yadav 3 | institution/company: Graphic Era Deemed University,Dehradun 4 | github: https://github.com/Jaiyadav88 5 | --- -------------------------------------------------------------------------------- /participant/lsam18.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Lakshan Sameera 3 | institution/company: Plymouth University, United Kingdom 4 | github: https://github.com/Lsam18 5 | --- -------------------------------------------------------------------------------- /participant/rikin.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Rikin R. 3 | institution/company: Symbiosis University of Applied Sciences 4 | github: https://github.com/CrazyRikin 5 | --- -------------------------------------------------------------------------------- /participant/Dhananjay.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Dhananjay Goyal 3 | institution/Company: Linsible Technologies 4 | github: https://github.com/DhananjayGoyalGL 5 | --- 6 | -------------------------------------------------------------------------------- /participant/Rudra.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Rudra 3 | institution/company: Symbiosis University of Applied Sciences 4 | github: https://github.com/Rudrahota-1 5 | --- 6 | -------------------------------------------------------------------------------- /participant/Yash.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Yash Jaiswal 3 | institution/company: Bharati Vidyapeeth Deemed University, Pune 4 | github: https://github.com/boltjazz 5 | --- -------------------------------------------------------------------------------- /participant/piyush.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Piyush Jindal 3 | institution/company: Chitkara University , Rajpura , Punjab. 4 | github: github.com/itzpiyushjindal 5 | --- -------------------------------------------------------------------------------- /participant/Ash0807.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Ashish Mishra 3 | institution/company: Dr . Bimrao Ambedkar University, Agra 4 | github: https://github.com/Ash0807 5 | --- 6 | -------------------------------------------------------------------------------- /participant/Aviral.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Aviral singh 3 | institution/company: Sony India Software Centre, Bengaluru 4 | github: https://github.com/aviralsingh108 5 | --- -------------------------------------------------------------------------------- /participant/Nitin.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: K.M Nitin 3 | Institution/company: Muthoot Institute of Technology and Science 4 | Github: https://github.com/Nitin320 5 | --- 6 | -------------------------------------------------------------------------------- /participant/Ananya.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Ananya singh 3 | institution/company: Bharati Vidyapeeth Deemed University, Pune 4 | github: https://github.com/Ananyasingh2002 5 | --- -------------------------------------------------------------------------------- /participant/Atharva.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Atharva saraiya 3 | institution/company: Bharati Vidyapeeth Deemed University, Pune 4 | github: https://github.com/Atharvasaraiya 5 | --- -------------------------------------------------------------------------------- /participant/KrishayNair.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Krishay Nair 3 | institution/company: MCT's Rajiv Gandhi Institute of Technology 4 | github: https://github.com/KrishayNair 5 | --- -------------------------------------------------------------------------------- /participant/Sreerag.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Sreerag P 3 | Institution/company: SRM Institute of Science and Technology,Chennai 4 | Github: https://github.com/srexrg 5 | --- 6 | -------------------------------------------------------------------------------- /participant/manisha.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Manisha Roy 3 | institution/company: Bharati Vidyapeeth Deemed University, Pune 4 | github: https://github.com/ManishaRoy2002 5 | --- -------------------------------------------------------------------------------- /participant/prajjwal.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Prajjwal Live 3 | Institution/company: United Technical College, Nepal 4 | Github: https://github.com/prajjwallive 5 | --- 6 | -------------------------------------------------------------------------------- /participant/shubhankar-ranjan.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Shubhankar Ranjan 3 | institution/company: Manipal University Jaipur 4 | github: https://github.com/Shubhankar-Ranjan 5 | --- -------------------------------------------------------------------------------- /participant/ashfaque-mustaque.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Ashfaque Mustaque 3 | Institution/company: Haldwani Institute of Technology 4 | Github: https://github.com/ashfaque-mustaque 5 | --- -------------------------------------------------------------------------------- /participant/HarshitVijayKumar.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Harshit Vijay Kumar 3 | institution/company: Vellore Institute of Technology 4 | github: https://github.com/HarshitVijayKumar 5 | --- 6 | -------------------------------------------------------------------------------- /participant/Hritik_kumar.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Hritik Kumar 3 | institution/company: Techno main salt lake , kolkata , West Bengal, India. 4 | github: https://github.com/hritik-6918 5 | --- 6 | -------------------------------------------------------------------------------- /participant/BharathKumar.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Bharath-KumarReddy 3 | institution/company: Indian Institute of Information Technology Lucknow 4 | github: https://github.com/Bharath-KumarReddy 5 | --- -------------------------------------------------------------------------------- /participant/Aditya.md: -------------------------------------------------------------------------------- 1 | --- 2 | Name: Aditya Ghorpade 3 | Institution/company: Bharati Vidyapeeth Deemed University College of Engineering, Pune 4 | Github: https://github.com/adighorpade 5 | --- 6 | -------------------------------------------------------------------------------- /participant/koppisettivenkatesh.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: koppisetti venkatesh 3 | institution/company: Rajiv Gandhi University of Knowledge Technologies (RGUKT) Rk Valley 4 | github: koppisettivenkatesh 5 | --- -------------------------------------------------------------------------------- /Project/Cpp Progs/commit: -------------------------------------------------------------------------------- 1 | I have added mergesort program in c++ language(.cpp) , as sorting techniques are very important in Computer Science 2 | as well as Data Structures in the branch named as sortingtechnique 3 | -------------------------------------------------------------------------------- /Project/Python Progs/136-single-number.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def singleNumber(self, nums: List[int]) -> int: 3 | ans = 0 4 | for num in nums: 5 | ans ^= num 6 | 7 | return ans -------------------------------------------------------------------------------- /Project/Cpp Progs/valid anagram.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | bool isAnagram(string s, string t) { 4 | 5 | sort(s.begin(),s.end()); 6 | sort(t.begin(),t.end()); 7 | 8 | return s == t; 9 | } 10 | }; 11 | -------------------------------------------------------------------------------- /Project/Python Progs/198-house-robber.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def rob(self, nums: List[int]) -> int: 3 | r1 = r2 = 0 4 | 5 | for h in nums: 6 | temp = max(r1+h, r2) 7 | r1 = r2 8 | r2 = temp 9 | 10 | return r2 -------------------------------------------------------------------------------- /Project/Cpp Progs/SimpleInterest.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | 9 | float P = 22, R = 10, T = 12; 10 | 11 | 12 | float SI = (P * T * R) / 100; 13 | 14 | 15 | cout << "Simple Interest = " << SI; 16 | 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /palidrome.py: -------------------------------------------------------------------------------- 1 | val = int(input("Enter a value : ")) 2 | str_val = str(val) 3 | if str_val == str_val[::-1]: 4 | print("Palindrome") 5 | else: 6 | print("Not Palindrome") 7 | for i in range(10): 8 | if str_val.count(str(i)) > 0: 9 | print(str(i),"appears", str_val.count(str(i)), "times"); 10 | -------------------------------------------------------------------------------- /Project/Python Progs/linear-search.py: -------------------------------------------------------------------------------- 1 | 2 | def linear_search(n, search): 3 | flag = 0 4 | for num in n: 5 | if num == search: 6 | flag = 1 7 | if flag == 1: 8 | print("elem found") 9 | else: 10 | print("elem not found") 11 | 12 | linear_search([1,2,3,4,5], 4) 13 | 14 | -------------------------------------------------------------------------------- /Project/Python Progs/Dynamic programming.py: -------------------------------------------------------------------------------- 1 | def fibonacci_tabulation(n): 2 | if n <= 1: 3 | return n 4 | fib = [0] * (n+1) 5 | fib[1] = 1 6 | for i in range(2, n+1): 7 | fib[i] = fib[i-1] + fib[i-2] 8 | return fib[n] 9 | 10 | # Example usage: 11 | print(fibonacci_tabulation(10)) # Output: 55 12 | -------------------------------------------------------------------------------- /Project/Python Progs/Kadane's-Algorithm: -------------------------------------------------------------------------------- 1 | def kadanes_algorithm(l): 2 | max_sum = current_max = 0 3 | 4 | for num in l: 5 | current_max = max(num, current_max+num) 6 | if current_max > max_sum: 7 | max_sum = current_max 8 | 9 | print(max_sum) 10 | 11 | kadanes_algorithm([4, -5, 5, 7, 9, 85, 92, 45]) 12 | -------------------------------------------------------------------------------- /Project/Python Progs/151-reverse-words-in-a-string.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def reverseWords(self, s: str) -> str: 3 | words = s.split() 4 | l = len(words)-1 5 | for i in range(int(len(words)/2)): 6 | temp = words[i] 7 | words[i] = words[l-i] 8 | words[l-i] = temp 9 | 10 | return ' '.join(words) -------------------------------------------------------------------------------- /Project/Python Progs/62-unique-paths.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def uniquePaths(self, m: int, n: int) -> int: 3 | row = [1] * n 4 | 5 | for i in range(m-1): 6 | new = [1] * n 7 | for ind in range(n-2, -1, -1): 8 | new[ind] = new[ind + 1] + row[ind] 9 | row = new 10 | 11 | return row[0] -------------------------------------------------------------------------------- /Project/Cpp Progs/Pyramid pattern: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | 6 | int rows; 7 | 8 | cout << "Enter number of rows: "; 9 | cin >> rows; 10 | 11 | for(int i = 1; i <= rows; ++i) { 12 | for(int j = 1; j <= i; ++j) { 13 | cout << "* "; 14 | } 15 | cout << "\n"; 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /Project/Python Progs/second_max_num.py: -------------------------------------------------------------------------------- 1 | list1 = [100, 20, 49, 45, 99] 2 | mx = max(list1) 3 | secondmax = min(list1) 4 | n = len(list1) 5 | for i in range(2, n): 6 | if list1[i] > mx: 7 | secondmax = mx 8 | mx = list1[i] 9 | elif list1[i] > secondmax and mx != list1[i]: 10 | secondmax = list1[i] 11 | 12 | print("Second highest number is:", str(secondmax)) 13 | -------------------------------------------------------------------------------- /Project/Cpp Progs/Sum of digits: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int val, num, sum = 0; 7 | 8 | cout << "Enter the number : "; 9 | cin >> val; 10 | num = val; 11 | while (num != 0) 12 | { 13 | sum = sum + num % 10; 14 | num = num / 10; 15 | } 16 | cout << "The sum of the digits of " 17 | << val << " is " << sum; 18 | } 19 | -------------------------------------------------------------------------------- /Project/Cpp Progs/armstrongNumber.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int n = 153; 7 | int temp = n; 8 | int p = 0; 9 | 10 | while (n > 0) { 11 | int rem = n % 10; 12 | p = (p) + (rem * rem * rem); 13 | n = n / 10; 14 | } 15 | 16 | if (temp == p) { 17 | cout << ("Yes. It is Armstrong No."); 18 | } 19 | else { 20 | cout << ("No. It is not an Armstrong No."); 21 | } 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /Project/Cpp Progs/FloyedTriangle.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | 6 | int rows, number = 1; 7 | 8 | cout << "Enter number of rows: "; 9 | cin >> rows; 10 | 11 | for(int i = 1; i <= rows; i++) { 12 | for(int j = 1; j <= i; ++j) { 13 | cout << number << " "; 14 | ++number; 15 | } 16 | 17 | cout << endl; 18 | } 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Project/Python Progs/knapsack: -------------------------------------------------------------------------------- 1 | w=[int(x) for x in input("enter weights: ").split()] 2 | v=[int(x) for x in input("enter values: ").split()] 3 | bag=int(input("enter bag capacity: ")) 4 | n=len(v) 5 | def knapSack(bag,w,v,n): 6 | if n==0 or bag==0: 7 | return 0 8 | if (w[n-1] > bag): 9 | return knapSack(bag, w, v, n-1) 10 | else: 11 | return max(v[n-1] + knapSack(bag-w[n-1], w, v, n-1),knapSack(bag, w, v, n-1)) 12 | knapSack(bag,w,v,n) 13 | -------------------------------------------------------------------------------- /Project/Cpp Progs/Fibonacci program: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int fib1 = 0, fib2 = 1, fib3 = 1; 7 | 8 | cout << "The Fibonacci Series is follows : " << endl << fib1 << " " << fib2 << " "; 9 | while (fib1 + fib2 < 1000) 10 | { 11 | fib3 = fib1 + fib2; 12 | fib1 = fib2; 13 | fib2 = fib3; 14 | cout << fib3 << " "; 15 | } 16 | cout << endl; 17 | 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /Project/Python Progs/162-find-peak-element.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def findPeakElement(self, nums: List[int]) -> int: 3 | l, r = 0, len(nums) - 1 4 | 5 | while l <= r: 6 | mid = l + ( (r-l) // 2 ) 7 | 8 | if mid > 0 and nums[mid] < nums[mid-1]: 9 | r = mid -1 10 | elif mid < len(nums)-1 and nums[mid] < nums[mid+1]: 11 | l = mid + 1 12 | else: 13 | return mid -------------------------------------------------------------------------------- /Project/Python Progs/sorting/bubbleSort.py: -------------------------------------------------------------------------------- 1 | def bubbleSort(arr): 2 | n = len(arr) 3 | 4 | for i in range(n): 5 | swapped = False 6 | 7 | for j in range(0, n-i-1): 8 | 9 | if arr[j] > arr[j+1]: 10 | arr[j], arr[j+1] = arr[j+1], arr[j] 11 | swapped = True 12 | if (swapped == False): 13 | break 14 | 15 | if __name__ == "__main__": 16 | arr = [64, 34, 25, 12, 22, 11, 90] 17 | 18 | bubbleSort(arr) 19 | 20 | print("Sorted array:") 21 | for i in range(len(arr)): 22 | print("%d" % arr[i], end=" ") 23 | 24 | -------------------------------------------------------------------------------- /Project/Cpp Progs/Reverse a number: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int val, temp, num = 0; 7 | 8 | cout << "Enter the number " 9 | << "(avoid entering numbers with leading zeroes) : "; 10 | cin >> val; 11 | temp = val; 12 | while (temp != 0) 13 | { 14 | num = num * 10 + temp % 10; 15 | temp = temp / 10; 16 | } 17 | cout << "The given number " << val 18 | << " with its digits reversed is " 19 | << num << endl; 20 | } 21 | -------------------------------------------------------------------------------- /Project/Cpp Progs/Prime Number.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int num, i, j = 0; 7 | 8 | cout << "Enter number: "; 9 | cin >> num; 10 | 11 | //check for prime number 12 | for (i = 1; i <= num; i++) 13 | { 14 | if ((num % i) == 0) 15 | { 16 | j++; 17 | } 18 | } 19 | 20 | if (j == 2) 21 | cout << "\n" << num << " is a prime number.\n"; 22 | else 23 | cout << num << " is not a prime number.\n"; 24 | 25 | return 0; 26 | } 27 | 28 | 29 | -------------------------------------------------------------------------------- /Project/Cpp Progs/fahrenheitToCelsius: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | double fahrenheitToCelsius(double fahrenheit) 4 | { 5 | double celsius; 6 | 7 | celsius = (fahrenheit - 32.0) * 5.0 / 9.0; 8 | return celsius; 9 | } 10 | 11 | int main() 12 | { 13 | double fahrenheit; 14 | 15 | std::cout << "Enter temperature in fahrenheit (in degrees) "; 16 | std::cin >> fahrenheit; 17 | std::cout << "Temperature in Celsius (in degrees) = " 18 | << fahrenheitToCelsius(fahrenheit) << std::endl; 19 | } 20 | -------------------------------------------------------------------------------- /Project/Python Progs/Binarysearch_ineedtochangemyusername.py: -------------------------------------------------------------------------------- 1 | def bin(arr, x,low, high): 2 | if high >= low: 3 | mid = (high + low) // 2 4 | if arr[mid] == x: 5 | return mid 6 | elif arr[mid] > x: 7 | return bin(arr, low, mid - 1, x) 8 | else: 9 | return bin(arr, mid+ 1, high, x) 10 | else: 11 | return -1 12 | arr = [ 2, 3, 4, 10, 40 ] 13 | x = 10 14 | 15 | result = bin(arr, 0, len(arr)-1, x) 16 | if result != -1: 17 | print(str(result)) 18 | else: 19 | print("Element not there in array") -------------------------------------------------------------------------------- /Project/Python Progs/remove_duplicates.py: -------------------------------------------------------------------------------- 1 | ''' 2 | Given a SORTED array, remove all the duplicates from the array. 3 | 4 | Input - [0,0,1,1,1,2,2,3,3,4] 5 | Output - [0,1,2,3,4] 6 | ''' 7 | 8 | def Remove_Duplicates(L1): 9 | 10 | i = 1 11 | check = L1[0] 12 | 13 | while i < len(L1): 14 | 15 | if check == L1[i]: 16 | L1.pop(i) 17 | i -= 1 18 | 19 | else: 20 | check = L1[i] 21 | 22 | i += 1 23 | 24 | print(L1) 25 | 26 | Remove_Duplicates( [0, 0, 1, 1, 1, 2, 2, 3, 3, 4] ) -------------------------------------------------------------------------------- /Project/Python Progs/11-container-with-most-water.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def maxArea(self, height: List[int]) -> int: 3 | l, r = 0, len(height)-1 4 | h = max(height) 5 | res = 0 6 | 7 | while l < r: 8 | ar = min( [height[l] , height[r]] ) * (r-l) 9 | if ar > res: 10 | res = ar 11 | if height[l] < height[r]: 12 | l += 1 13 | else: 14 | r -= 1 15 | if (r - l) * h <= res: 16 | break 17 | 18 | return res -------------------------------------------------------------------------------- /Project/Cpp Progs/sorting/bubbleSort.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int n; 7 | cin >> n; 8 | int arr[n]; 9 | for (int i = 0; i < n; i++) 10 | cin >> arr[i]; 11 | 12 | for (int i = 0; i < n - 1; i++) 13 | { 14 | for (int j = 0; j < n - i - 1; j++) 15 | { 16 | if (arr[j] > arr[j + 1]) 17 | swap(arr[j], arr[j + 1]); 18 | } 19 | } 20 | 21 | for (int i = 0; i < n; i++) 22 | cout << arr[i] << " "; 23 | cout << endl; 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /Project/Python Progs/Dijkastra_ineedtochangemyusername.py: -------------------------------------------------------------------------------- 1 | def dijkstra_algorithm(graph, source_ver): 2 | dist = {} 3 | for ver in graph: 4 | dist[ver] = float("inf") 5 | dist[source_ver] = 0 6 | visited = set() 7 | while visited != set(graph): 8 | current_ver = min(dist, key=dist.get) 9 | visited.add(current_ver) 10 | for neighbor in graph[current_ver]: 11 | if neighbor not in visited: 12 | new_dist = dist[current_ver] + graph[current_ver][neighbor] 13 | if new_dist < dist[neighbor]: 14 | dist[neighbor] = new_dist 15 | 16 | return dist 17 | -------------------------------------------------------------------------------- /Project/Cpp Progs/Sum of Subset.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() { 7 | vector inputSet = {1, 2, 3}; 8 | int n = inputSet.size(); 9 | int totalSum = 0; 10 | 11 | for (int mask = 0; mask < (1 << n); mask++) { 12 | int subsetSum = 0; 13 | for (int i = 0; i < n; i++) { 14 | if (mask & (1 << i)) { 15 | subsetSum += inputSet[i]; 16 | } 17 | } 18 | totalSum += subsetSum; 19 | } 20 | 21 | cout << "Sum of all subsets: " << totalSum << endl; 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /Project/Python Progs/FloyddWarshall.py: -------------------------------------------------------------------------------- 1 | def fw(graph): 2 | n = len(graph) 3 | distances = [[float("inf")] * n for _ in range(n)] 4 | for i in range(n): 5 | for j in graph[i]: 6 | distances[i][j] = graph[i][j] 7 | for k in range(n): 8 | for i in range(n): 9 | for j in range(n): 10 | distances[i][j] = min(distances[i][j], distances[i][k] + distances[k][j]) 11 | return distances 12 | graph = [[0, 5, 10], [5, 0, 3], [10, 3, 0]] 13 | distances = fw(graph) 14 | for i in range(len(distances)): 15 | for j in range(len(distances[i])): 16 | print(f"Shortest distance from {i} to {j}: {distances[i][j]}") -------------------------------------------------------------------------------- /Project/Python Progs/104-maximum-depth-of-binary-tree.py: -------------------------------------------------------------------------------- 1 | # Definition for a binary tree node. 2 | # class TreeNode: 3 | # def __init__(self, val=0, left=None, right=None): 4 | # self.val = val 5 | # self.left = left 6 | # self.right = right 7 | class Solution: 8 | def maxDepth(self, root: Optional[TreeNode]) -> int: 9 | self.dep = 0 10 | def dfs(head, depth): 11 | if not head: 12 | self.dep = max(self.dep, depth-1) 13 | return 14 | dfs(head.left, depth+1) 15 | dfs(head.right, depth+1) 16 | 17 | dfs(root, 1) 18 | return self.dep -------------------------------------------------------------------------------- /Project/Python Progs/Stack.py: -------------------------------------------------------------------------------- 1 | class Stack: 2 | def __init__(self): 3 | self.items = [] 4 | 5 | def push(self, item): 6 | self.items.append(item) 7 | 8 | def pop(self): 9 | if not self.is_empty(): 10 | return self.items.pop() 11 | else: 12 | return None # You can also raise an exception here if you prefer 13 | 14 | def peek(self): 15 | if not self.is_empty(): 16 | return self.items[-1] 17 | else: 18 | return None # You can also raise an exception here if you prefer 19 | 20 | def is_empty(self): 21 | return len(self.items) == 0 22 | -------------------------------------------------------------------------------- /Project/Cpp Progs/PascalTriangle.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int rows; 8 | cout << "Enter the number of rows : "; 9 | cin >> rows; 10 | cout << endl; 11 | 12 | for (int i = 0; i < rows; i++) 13 | { 14 | int val = 1; 15 | for (int j = 1; j < (rows - i); j++) 16 | { 17 | cout << " "; 18 | } 19 | for (int k = 0; k <= i; k++) 20 | { 21 | cout << " " << val; 22 | val = val * (i - k) / (k + 1); 23 | } 24 | cout << endl << endl; 25 | } 26 | cout << endl; 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /Project/Cpp Progs/Kadanes.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int maxSubArraySum(int a[], int size) 5 | { 6 | int max_so_far = INT_MIN, max_ending_here = 0; 7 | 8 | for (int i = 0; i < size; i++) { 9 | max_ending_here = max_ending_here + a[i]; 10 | if (max_so_far < max_ending_here) 11 | max_so_far = max_ending_here; 12 | 13 | if (max_ending_here < 0) 14 | max_ending_here = 0; 15 | } 16 | return max_so_far; 17 | } 18 | 19 | int main() 20 | { 21 | 22 | int n ; 23 | cin>>n; 24 | int a[n]; 25 | for(int i=0;i>a[i]; 27 | } 28 | int max_sum = maxSubArraySum(a, n); 29 | cout << "Maximum contiguous sum is " << max_sum; 30 | return 0; 31 | } 32 | -------------------------------------------------------------------------------- /Project/Cpp Progs/Linked_List_Cycle.cpp: -------------------------------------------------------------------------------- 1 | /** 2 | * Definition for singly-linked list. 3 | * struct ListNode { 4 | * int val; 5 | * ListNode *next; 6 | * ListNode(int x) : val(x), next(NULL) {} 7 | * }; 8 | */ 9 | 10 | //Detect Cycle in a Linked List using Slow Fast approach 11 | class Solution { 12 | public: 13 | bool hasCycle(ListNode *head) { 14 | ListNode * slow = head; 15 | ListNode * fast = head; 16 | 17 | while(fast and fast->next){ 18 | slow = slow->next; 19 | fast = fast->next->next; 20 | 21 | if(slow==fast) 22 | return true; 23 | } 24 | 25 | return false; 26 | } 27 | }; 28 | -------------------------------------------------------------------------------- /Project/Python Progs/d10.py: -------------------------------------------------------------------------------- 1 | #Checking whether a word is an anagram 2 | 3 | def anagram(a, b): 4 | 5 | d = {} 6 | 7 | for alphabet in a: 8 | 9 | if alphabet not in d: 10 | d[alphabet] = 1 11 | 12 | else: 13 | d[alphabet] += 1 14 | 15 | for alphabet in b: 16 | 17 | if alphabet in d: 18 | d[alphabet] -= 1 19 | 20 | else: 21 | break 22 | 23 | check = 0 24 | 25 | for i in d.values(): 26 | 27 | if i != 0: 28 | check = 1 29 | 30 | if check == 1: 31 | return False 32 | 33 | else: 34 | return True 35 | 36 | 37 | print(anagram('angle', 'angel')) -------------------------------------------------------------------------------- /Project/Python Progs/72-edit-distance.py: -------------------------------------------------------------------------------- 1 | class Solution: 2 | def minDistance(self, word1: str, word2: str) -> int: 3 | dp = [[-1 for i in range(len(word2)+1)] for j in range(len(word1)+1)] 4 | 5 | for i in range(len(word2)+1): 6 | dp[len(word1)][i] = len(word2) - i 7 | 8 | for i in range(len(word1)+1): 9 | dp[i][len(word2)] = len(word1) - i 10 | 11 | for i in range(len(word1)-1, -1, -1): 12 | for j in range(len(word2)-1, -1, -1): 13 | if word1[i] == word2[j]: 14 | dp[i][j] = dp[i+1][j+1] 15 | else: 16 | dp[i][j] = 1 + min(dp[i][j+1], dp[i+1][j], dp[i+1][j+1]) 17 | 18 | return dp[0][0] -------------------------------------------------------------------------------- /Project/Cpp Progs/sortzeroone.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(int argc, char const *argv[]) 4 | { 5 | int n=6; 6 | int arr[n]={1,0,1,2,1,1}; 7 | int low=0,mid=0,high=n-1; 8 | while (mid<=high) 9 | { 10 | /* code */ 11 | if(arr[mid]==0){ 12 | swap(arr[low],arr[mid]); 13 | low++; 14 | mid++; 15 | } 16 | else if(arr[mid]==1){ 17 | mid++; 18 | } 19 | else{ 20 | swap(arr[mid],arr[high]); 21 | high--; 22 | } 23 | } 24 | for (int i = 0; i List[str]: 3 | if not digits: 4 | return 5 | refer = { 6 | '2' : 'abc', 7 | '3' : 'def', 8 | '4' : 'ghi', 9 | '5' : 'jkl', 10 | '6' : 'mno', 11 | '7' : 'pqrs', 12 | '8' : 'tuv', 13 | '9' : 'wxyz' 14 | } 15 | res = [] 16 | def find_combo(temp_res, digits): 17 | if not digits: 18 | res.append(temp_res) 19 | return 20 | 21 | for i in refer[digits[0]]: 22 | find_combo(temp_res+i, digits[1:]) 23 | 24 | find_combo('', digits) 25 | return res 26 | -------------------------------------------------------------------------------- /Project/Python Progs/199-binary-tree-right-side-view.py: -------------------------------------------------------------------------------- 1 | # Definition for a binary tree node. 2 | # class TreeNode: 3 | # def __init__(self, val=0, left=None, right=None): 4 | # self.val = val 5 | # self.left = left 6 | # self.right = right 7 | class Solution: 8 | def rightSideView(self, root: Optional[TreeNode]) -> List[int]: 9 | if not root: 10 | return [] 11 | self.res = [] 12 | queue = [root] 13 | while queue: 14 | self.res.append(queue[-1].val) 15 | temp = queue.copy() 16 | queue.clear() 17 | for node in temp: 18 | if node.left: 19 | queue.append(node.left) 20 | if node.right: 21 | queue.append(node.right) 22 | 23 | return self.res -------------------------------------------------------------------------------- /Project/Python Progs/graph.py: -------------------------------------------------------------------------------- 1 | class Graph: 2 | def __init__(self): 3 | self.graph = {} 4 | 5 | def add_vertex(self, vertex): 6 | if vertex not in self.graph: 7 | self.graph[vertex] = [] 8 | 9 | def add_edge(self, vertex1, vertex2): 10 | if vertex1 in self.graph and vertex2 in self.graph: 11 | self.graph[vertex1].append(vertex2) 12 | self.graph[vertex2].append(vertex1) 13 | 14 | def display(self): 15 | for vertex, neighbors in self.graph.items(): 16 | print(f"{vertex}: {neighbors}") 17 | 18 | # Example usage: 19 | if __name__ == "__main__": 20 | graph = Graph() 21 | graph.add_vertex("A") 22 | graph.add_vertex("B") 23 | graph.add_vertex("C") 24 | graph.add_edge("A", "B") 25 | graph.add_edge("B", "C") 26 | graph.display() 27 | -------------------------------------------------------------------------------- /Project/Python Progs/mergeSort.py: -------------------------------------------------------------------------------- 1 | def mergeSort(arr): 2 | if len(arr) > 1: 3 | mid = len(arr)//2 4 | 5 | L = arr[:mid] 6 | 7 | R = arr[mid:] 8 | 9 | mergeSort(L) 10 | 11 | mergeSort(R) 12 | 13 | i = j = k = 0 14 | 15 | while i < len(L) and j < len(R): 16 | if L[i] <= R[j]: 17 | arr[k] = L[i] 18 | i += 1 19 | else: 20 | arr[k] = R[j] 21 | j += 1 22 | k += 1 23 | 24 | while i < len(L): 25 | arr[k] = L[i] 26 | i += 1 27 | k += 1 28 | 29 | while j < len(R): 30 | arr[k] = R[j] 31 | j += 1 32 | k += 1 33 | 34 | 35 | def printList(arr): 36 | for i in range(len(arr)): 37 | print(arr[i], end=" ") 38 | print() 39 | 40 | 41 | if __name__ == '__main__': 42 | arr = [12, 11, 13, 5, 6, 7] 43 | print("Given array is") 44 | printList(arr) 45 | mergeSort(arr) 46 | print("\nSorted array is ") 47 | printList(arr) 48 | -------------------------------------------------------------------------------- /Project/Python Progs/simple-linear-regressioni.py: -------------------------------------------------------------------------------- 1 | import numpy as np 2 | import pandas as pd 3 | 4 | class MeraLR: 5 | 6 | def __init__(self): 7 | self.m = None 8 | self.b = None 9 | 10 | def fit(self,X_train,y_train): 11 | 12 | num = 0 13 | den = 0 14 | 15 | for i in range(X_train.shape[0]): 16 | 17 | num = num + ((X_train[i] - X_train.mean())*(y_train[i] - y_train.mean())) 18 | den = den + ((X_train[i] - X_train.mean())*(X_train[i] - X_train.mean())) 19 | 20 | self.m = num/den 21 | self.b = y_train.mean() - (self.m * X_train.mean()) 22 | print(self.m) 23 | print(self.b) 24 | 25 | def predict(self,X_test): 26 | 27 | print(X_test) 28 | 29 | return self.m * X_test + self.b 30 | -------------------------------------------------------------------------------- /Project/Cpp Progs/3 Sum Closest.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | int threeSumClosest(vector& nums, int t) { 4 | sort(nums.begin(),nums.end()); 5 | int n=nums.size(),l=0,h=n-1,ans=INT_MAX,lmin=INT_MAX; 6 | for(int i=0;ik) { 15 | h--; 16 | } else if(bc==k) { 17 | return bc+a; 18 | } 19 | if(lmin>abs(t-bc-a)) { 20 | lmin=abs(t-bc-a); 21 | ans=bc+a; 22 | } 23 | } 24 | 25 | } 26 | return ans; 27 | } 28 | }; -------------------------------------------------------------------------------- /Project/Python Progs/linked list.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.next = None 5 | 6 | class LinkedList: 7 | def __init__(self): 8 | self.head = None 9 | 10 | def append(self, data): 11 | new_node = Node(data) 12 | if not self.head: 13 | self.head = new_node 14 | return 15 | current = self.head 16 | while current.next: 17 | current = current.next 18 | current.next = new_node 19 | 20 | def display(self): 21 | current = self.head 22 | while current: 23 | print(current.data, end=' -> ') 24 | current = current.next 25 | print("None") 26 | 27 | # Example usage: 28 | if __name__ == "__main__": 29 | linked_list = LinkedList() 30 | linked_list.append(1) 31 | linked_list.append(2) 32 | linked_list.append(3) 33 | linked_list.display() 34 | -------------------------------------------------------------------------------- /Project/Cpp Progs/Letter Combinations of a phone number.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | unordered_mapmp{{'2',"abc"},{'3',"def"},{'4',"ghi"},{'5',"jkl"},{'6',"mno"},{'7',"pqrs"},{'8',"tuv"},{'9',"wxyz"}}; 4 | 5 | void recurse(string &d,int n,vector &ans,string &s) { 6 | if(n<0) 7 | return; 8 | for(int i=0;i letterCombinations(string digits) { 18 | ios_base::sync_with_stdio(false); 19 | cin.tie(NULL); 20 | int n=digits.size(); 21 | if(n==0) 22 | return {}; 23 | vectorans; 24 | string s=""; 25 | recurse(digits,n-1,ans,s); 26 | return ans; 27 | } 28 | }; 29 | -------------------------------------------------------------------------------- /Project/Cpp Progs/3 Sum.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | vector> threeSum(vector& nums) { 4 | ios_base::sync_with_stdio(false); 5 | cin.tie(NULL); 6 | int n=nums.size(); 7 | sort(nums.begin(),nums.end()); 8 | vector>ans; 9 | int n1,j,k; 10 | for(int i=0;i0 && nums[i]!=nums[i-1])) { 12 | n1=-nums[i]; 13 | j=i+1;k=n-1; 14 | while(jj && nums[k]==nums[k-1]) k--; 20 | j++;k--; 21 | } 22 | else if(s None: 12 | cur = self.root 13 | 14 | for ch in word: 15 | if ch not in cur.children: 16 | cur.children[ch] = Node() 17 | cur = cur.children[ch] 18 | cur.end = True 19 | 20 | def search(self, word: str) -> bool: 21 | cur = self.root 22 | 23 | for ch in word: 24 | if ch not in cur.children: 25 | return False 26 | cur = cur.children[ch] 27 | return cur.end 28 | 29 | def startsWith(self, prefix: str) -> bool: 30 | cur = self.root 31 | 32 | for ch in prefix: 33 | if ch not in cur.children: 34 | return False 35 | cur = cur.children[ch] 36 | return True 37 | 38 | 39 | # Your Trie object will be instantiated and called as such: 40 | # obj = Trie() 41 | # obj.insert(word) 42 | # param_2 = obj.search(word) 43 | # param_3 = obj.startsWith(prefix) -------------------------------------------------------------------------------- /Project/Cpp Progs/sorting/quickSort.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | void swap(int *a, int *b) { 5 | int t = *a; 6 | *a = *b; 7 | *b = t; 8 | } 9 | 10 | void printArray(int array[], int size) { 11 | int i; 12 | for (i = 0; i < size; i++) 13 | cout << array[i] << " "; 14 | cout << endl; 15 | } 16 | 17 | int partition(int array[], int low, int high) { 18 | 19 | int pivot = array[high]; 20 | int i = (low - 1); 21 | for (int j = low; j < high; j++) { 22 | if (array[j] <= pivot) { 23 | i++; 24 | 25 | swap(&array[i], &array[j]); 26 | } 27 | } 28 | 29 | swap(&array[i + 1], &array[high]); 30 | 31 | return (i + 1); 32 | } 33 | 34 | void quickSort(int array[], int low, int high) { 35 | if (low < high) { 36 | int pi = partition(array, low, high); 37 | 38 | quickSort(array, low, pi - 1); 39 | 40 | quickSort(array, pi + 1, high); 41 | } 42 | } 43 | 44 | int main() { 45 | int data[] = {8, 7, 6, 1, 0, 9, 2}; 46 | int n = sizeof(data) / sizeof(data[0]); 47 | 48 | cout << "Unsorted Array: \n"; 49 | printArray(data, n); 50 | 51 | quickSort(data, 0, n - 1); 52 | 53 | cout << "Sorted array in ascending order: \n"; 54 | printArray(data, n); 55 | } 56 | -------------------------------------------------------------------------------- /Project/Cpp Progs/4 Sum.cpp: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public: 3 | // 0 1 2 3 4 5 4 | //-2,-1,0,0,1,2 - n=6 5 | vector> fourSum(vector& nums, int t) { 6 | ios_base::sync_with_stdio(false); 7 | cin.tie(NULL); 8 | int n=nums.size(); 9 | sort(nums.begin(),nums.end()); 10 | vector>ans; 11 | int n0,n1,j,k; 12 | for(int i=0;i0 && nums[i]!=nums[i-1])) { 14 | n0=nums[i]; 15 | for(int l=i+1;li+1 && nums[l]!=nums[l-1]) ) { 17 | n1=nums[l]; 18 | long long sum=(long long)t-n0-n1; 19 | j=l+1;k=n-1; 20 | while(jj && nums[k]==nums[k-1]) k--; 26 | j++;k--; 27 | } 28 | else if(s 3 | using namespace std; 4 | 5 | // Function to implement the KMP algorithm 6 | void KMP(string text, string pattern) 7 | { 8 | int m = text.length(); 9 | int n = pattern.length(); 10 | 11 | // if pattern is an empty string 12 | if (n == 0) 13 | { 14 | cout << "The pattern occurs with shift 0"; 15 | return; 16 | } 17 | 18 | // if text's length is less than that of pattern's 19 | if (m < n) 20 | { 21 | cout << "Pattern not found"; 22 | return; 23 | } 24 | 25 | // next[i] stores the index of the next best partial match 26 | int next[n + 1]; 27 | 28 | for (int i = 0; i < n + 1; i++) { 29 | next[i] = 0; 30 | } 31 | 32 | for (int i = 1; i < n; i++) 33 | { 34 | int j = next[i]; 35 | 36 | while (j > 0 && pattern[j] != pattern[i]) { 37 | j = next[j]; 38 | } 39 | 40 | if (j > 0 || pattern[j] == pattern[i]) { 41 | next[i + 1] = j + 1; 42 | } 43 | } 44 | 45 | for (int i = 0, j = 0; i < m; i++) 46 | { 47 | if (text[i] == pattern[j]) 48 | { 49 | if (++j == n) { 50 | cout << "The pattern occurs with shift " << i - j + 1 << endl; 51 | } 52 | } 53 | else if (j > 0) 54 | { 55 | j = next[j]; 56 | i--; // since `i` will be incremented in the next iteration 57 | } 58 | } 59 | } 60 | 61 | // Program to implement the KMP algorithm in C++ 62 | int main() 63 | { 64 | string text = "ABCABAABCABAC"; 65 | string pattern = "CAB"; 66 | 67 | KMP(text, pattern); 68 | 69 | return 0; 70 | } 71 | -------------------------------------------------------------------------------- /Project/Cpp Progs/Boundary-traversal-of-matrix: -------------------------------------------------------------------------------- 1 | //{ Driver Code Starts 2 | #include 3 | using namespace std; 4 | 5 | // } Driver Code Ends 6 | 7 | class Solution 8 | { 9 | public: 10 | //Function to return list of integers that form the boundary 11 | //traversal of the matrix in a clockwise manner. 12 | vector boundaryTraversal(vector > matrix, int n, int m) 13 | { 14 | vector ans; 15 | 16 | if(n==1) 17 | { 18 | for(int i=0;i0;i--) ans.push_back(matrix[n-1][i]); 29 | for(int i=n-1;i>0;i--) ans.push_back(matrix[i][0]); 30 | } 31 | 32 | return ans; 33 | } 34 | }; 35 | 36 | 37 | //{ Driver Code Starts. 38 | int main() { 39 | int t; 40 | cin>>t; 41 | 42 | while(t--) 43 | { 44 | int n,m; 45 | cin>>n>>m; 46 | vector > matrix(n); 47 | 48 | for(int i=0; i>matrix[i][j]; 54 | } 55 | } 56 | 57 | Solution ob; 58 | vector result = ob.boundaryTraversal(matrix, n, m); 59 | for (int i = 0; i < result.size(); ++i) 60 | cout< 80: 23 | print(f"{self.name} is ecstatic!") 24 | elif self.happiness > 50: 25 | print(f"{self.name} is content.") 26 | elif self.happiness > 20: 27 | print(f"{self.name} is a bit grumpy.") 28 | else: 29 | print(f"{self.name} is really unhappy. You should do something!") 30 | 31 | def main(): 32 | name = input("Give a name to your virtual pet rock: ") 33 | pet_rock = PetRock(name) 34 | 35 | print(f"Welcome, {pet_rock.name} the virtual pet rock!") 36 | 37 | while True: 38 | print("\nWhat do you want to do?") 39 | print("1. Pet") 40 | print("2. Feed") 41 | print("3. Scold") 42 | print("4. Quit") 43 | 44 | choice = input("Enter your choice: ") 45 | 46 | if choice == '1': 47 | pet_rock.pet() 48 | elif choice == '2': 49 | pet_rock.feed() 50 | elif choice == '3': 51 | pet_rock.scold() 52 | elif choice == '4': 53 | print(f"{pet_rock.name} says goodbye!") 54 | break 55 | else: 56 | print("Invalid choice. Please choose a valid option.") 57 | 58 | pet_rock.check_happiness() 59 | time.sleep(1) # Pause for dramatic effect 60 | 61 | if __name__ == "__main__": 62 | main() 63 | -------------------------------------------------------------------------------- /Project/Cpp Progs/Prims.cpp: -------------------------------------------------------------------------------- 1 | // Prim's Algorithm in C++ 2 | 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | #define INF 9999999 8 | 9 | #define V 5 10 | 11 | int G[V][V] = { 12 | {0, 9, 75, 0, 0}, 13 | {9, 0, 95, 19, 42}, 14 | {75, 95, 0, 51, 66}, 15 | {0, 19, 51, 0, 31}, 16 | {0, 42, 66, 31, 0}}; 17 | 18 | int main() { 19 | int no_edge; // number of edge 20 | 21 | // create a array to track selected vertex 22 | // selected will become true otherwise false 23 | int selected[V]; 24 | 25 | // set selected false initially 26 | memset(selected, false, sizeof(selected)); 27 | 28 | // set number of edge to 0 29 | no_edge = 0; 30 | 31 | // the number of egde in minimum spanning tree will be 32 | // always less than (V -1), where V is number of vertices in 33 | //graph 34 | 35 | // choose 0th vertex and make it true 36 | selected[0] = true; 37 | 38 | int x; // row number 39 | int y; // col number 40 | 41 | // print for edge and weight 42 | cout << "Edge" 43 | << " : " 44 | << "Weight"; 45 | cout << endl; 46 | while (no_edge < V - 1) { 47 | //For every vertex in the set S, find the all adjacent vertices 48 | // , calculate the distance from the vertex selected at step 1. 49 | // if the vertex is already in the set S, discard it otherwise 50 | //choose another vertex nearest to selected vertex at step 1. 51 | 52 | int min = INF; 53 | x = 0; 54 | y = 0; 55 | 56 | for (int i = 0; i < V; i++) { 57 | if (selected[i]) { 58 | for (int j = 0; j < V; j++) { 59 | if (!selected[j] && G[i][j]) { // not in selected and there is an edge 60 | if (min > G[i][j]) { 61 | min = G[i][j]; 62 | x = i; 63 | y = j; 64 | } 65 | } 66 | } 67 | } 68 | } 69 | cout << x << " - " << y << " : " << G[x][y]; 70 | cout << endl; 71 | selected[y] = true; 72 | no_edge++; 73 | } 74 | 75 | return 0; 76 | } 77 | -------------------------------------------------------------------------------- /Project/Cpp Progs/mergesort.cpp: -------------------------------------------------------------------------------- 1 | #include//Preprocessig Directives 2 | using namespace std;//calling objects from predefined namespace 3 | void merge(int [],int,int,int);//declaratin of function 4 | void mergesort(int [],int,int);//declaration of recursive mergesort function 5 | void display(int [],int); //declaration of display function 6 | 7 | int main() 8 | { 9 | int n; 10 | cout<<"Enter the size of the array"<>n; 12 | int A[n]; //declaring array of size n 13 | cout<<"Enter the no of elements"<>A[i]; //taking elements as input 16 | mergesort(A,0,n-1); 17 | display(A,n); 18 | 19 | } 20 | // merge function 21 | void merge(int A[],int low,int mid,int high) 22 | { 23 | int n1=mid-low+1,n2=high-mid; 24 | int* left = new int[n1]; //left half array pointer 25 | int* right = new int[n2]; //right half array pointer 26 | 27 | for(int i=0;il) 52 | { 53 | int m=(l+h)/2; //calculating the middle index 54 | mergesort(arr,l,m); 55 | mergesort(arr,m+1,h); 56 | merge(arr,l,m,h); 57 | } 58 | } 59 | //display function 60 | void display(int arr[],int n) 61 | { 62 | for(int i=0;i 28 | using std::cout; 29 | 30 | size_t solve_tower(int n, char first, char second, char third) 31 | { 32 | 33 | // recursive base case 34 | if (n == 1) 35 | { 36 | cout << "Move disk 1 from " << first << " to " << third << "\n"; 37 | return 1; 38 | } 39 | 40 | // move n-1 disks from first to other using second as a placeholder 41 | size_t num_moves = solve_tower(n - 1, first, third, second); 42 | 43 | // move the nth disk from first to second 44 | cout << "Move disk " << n << " from " << first << " to " << third << "\n"; 45 | 46 | // move the n-1 disks from third to second using first as an placeholder 47 | num_moves += solve_tower(n - 1, second, first, third); 48 | 49 | // return the total moves plus 1 50 | return num_moves + 1; 51 | } 52 | 53 | int main() 54 | { 55 | 56 | // names of rods 57 | char a = 'A'; 58 | char b = 'B'; 59 | char c = 'C'; 60 | 61 | // number of disks to move in puzzle 62 | size_t num_disk = 3; 63 | 64 | // find the total number of moves needed to solve 65 | size_t num_moves = solve_tower(num_disk, a, b, c); 66 | 67 | // output result 68 | cout << "Total moves needed to solve: " << num_moves; 69 | return 0; 70 | } -------------------------------------------------------------------------------- /Project/Python Progs/Calculator.py: -------------------------------------------------------------------------------- 1 | past_calculations =[]; 2 | def add(a,b): 3 | return a+b; 4 | 5 | def subtract(a,b): 6 | return a-b; 7 | 8 | def multiply (a,b): 9 | return a*b; 10 | def divide(a,b): 11 | try: 12 | return a/b 13 | except Exception as e: 14 | print(e) 15 | def power(a,b): 16 | return a**b 17 | 18 | def remainder(a,b): 19 | return a%b 20 | 21 | def history(): 22 | if past_calculations: 23 | for index,calc in enumerate(past_calculations): 24 | print(calc); 25 | else: 26 | print("No past calculations to show"); 27 | return 0; 28 | 29 | def select_op(choice): 30 | if (choice == '?'): 31 | return history() 32 | if (choice == '#'): 33 | return -1 34 | elif (choice == '$'): 35 | return 0 36 | elif (choice in ('+','-','*','/','^','%')): 37 | while (True): 38 | num1s = str(input("Enter first number: ")) 39 | print(num1s) 40 | if num1s.endswith('$'): 41 | return 0; 42 | if num1s.endswith('#'): 43 | return -1; 44 | 45 | try: 46 | num1 = float(num1s) 47 | break; 48 | except: 49 | print("Not a valid number,please enter again") 50 | continue 51 | 52 | while (True): 53 | num2s = str(input("Enter second number: ")) 54 | print(num2s) 55 | if num2s.endswith('$'): 56 | return 0; 57 | if num2s.endswith('#'): 58 | return -1; 59 | try: 60 | num2 = float(num2s) 61 | break 62 | except: 63 | print("Not a valid number,please enter again") 64 | continue 65 | 66 | result = 0.0 67 | last_calculation = "" 68 | if choice == '+': 69 | result = add(num1, num2); 70 | elif choice == '-': 71 | result = subtract(num1, num2); 72 | elif choice == '*': 73 | result = multiply(num1, num2); 74 | elif choice == '/': 75 | result = divide(num1, num2); 76 | elif choice == '^': 77 | result = power(num1, num2); 78 | elif choice == '%': 79 | result = remainder(num1, num2); 80 | else: 81 | print("Something Went Wrong"); 82 | 83 | last_calculation = "{0} {1} {2} = {3}".format(num1, choice, num2, result) 84 | print(last_calculation ) 85 | past_calculations.append(last_calculation); 86 | else: 87 | print("Unrecognized operation") 88 | 89 | while True: 90 | print("Select operation.") 91 | print("1.Add : + ") 92 | print("2.Subtract : - ") 93 | print("3.Multiply : * ") 94 | print("4.Divide : / ") 95 | print("5.Power : ^ ") 96 | print("6.Remainder: % ") 97 | print("7.Terminate: # ") 98 | print("8.Reset : $ ") 99 | print("8.History : ? ") 100 | 101 | # take input from the user 102 | choice = input("Enter choice(+,-,*,/,^,%,#,$,?): ") 103 | print(choice) 104 | if(select_op(choice) == -1): 105 | print("Done. Terminating") 106 | exit() 107 | -------------------------------------------------------------------------------- /Project/Python Progs/Passwordmanager.py: -------------------------------------------------------------------------------- 1 | from tkinter import * 2 | from tkinter import messagebox 3 | import pyperclip 4 | # ---------------------------- PASSWORD GENERATOR ------------------------------- # 5 | #Password Generator Project 6 | from random import choice,randint,shuffle 7 | def generate(): 8 | letters = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'] 9 | numbers = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9'] 10 | symbols = ['!', '#', '$', '%', '&', '(', ')', '*', '+'] 11 | 12 | password_letters=[choice(letters) for _ in range(randint(8, 10))] 13 | password_symbols=[choice(symbols) for _ in range(randint(2, 4))] 14 | password_numbers=[choice(numbers) for _ in range(randint(2, 4))] 15 | password_list=password_numbers+password_symbols+password_letters 16 | shuffle(password_list) 17 | password = "".join(password_list) 18 | pasword_entries.insert(0,password) 19 | pyperclip.copy(password) 20 | 21 | # ---------------------------- SAVE PASSWORD ------------------------------- # 22 | def save(): 23 | website=websit_entries.get() 24 | email=email_entries.get() 25 | password=pasword_entries.get() 26 | 27 | if len(website)==0 or len(password)==0: 28 | messagebox.showinfo(title="OOPS", message="please make sure you haven't left any fields empty .") 29 | else: 30 | is_ok=messagebox.askyesno(title=website,message=f"These are the details entered: \nEmail:{email} \n{password} \n is it ok to save?") 31 | if is_ok: 32 | with open("data.txt", "a") as data_file: 33 | data_file.write(f"{website} / {email} /{password} \n") 34 | websit_entries.delete(0, END) 35 | pasword_entries.delete(0, END) 36 | 37 | 38 | 39 | # ---------------------------- UI SETUP ------------------------------- # 40 | 41 | window=Tk() 42 | window.title("Password Manager") 43 | window.config(pady=50,padx=50) 44 | canvas=Canvas(height=200,width=200) 45 | logo_img=PhotoImage(file="logo.png") 46 | canvas.create_image(100,100,image=logo_img) 47 | canvas.grid(row=0,column=1) 48 | 49 | website_label=Label(text="Website") 50 | website_label.grid(row=1,column=0) 51 | website_label.focus() 52 | email_label=Label(text="email/username") 53 | email_label.grid(row=2,column=0) 54 | pasword_label=Label(text="Password") 55 | pasword_label.grid(row=3,column=0) 56 | 57 | websit_entries=Entry(width=35) 58 | websit_entries.grid(row=1,column=1,columnspan=2) 59 | email_entries=Entry(width=35) 60 | email_entries.grid(row=2,column=1,columnspan=2) 61 | email_entries.insert(0,"sparshrawat34@gmail.com") 62 | pasword_entries=Entry(width=17) 63 | pasword_entries.grid(row=3,column=1) 64 | 65 | 66 | generate_password=Button(text="Generate Password",command=generate) 67 | generate_password.grid(row=3,column=2) 68 | add_button=Button(text="Add",width=30,command=save) 69 | add_button.grid(row=5,column=1,columnspan=2) 70 | 71 | 72 | 73 | window.mainloop() 74 | -------------------------------------------------------------------------------- /Project/Python Progs/calender.py: -------------------------------------------------------------------------------- 1 | import calendar 2 | 3 | 4 | # Create a plain calender 5 | c = calendar.TextCalendar(calendar.SUNDAY) 6 | st = c.formatmonth(2023, 10, 0, 0) 7 | print(st) 8 | 9 | # Create a HTML formatted calender 10 | 11 | hc = calendar.HTMLCalendar(calendar.SUNDAY) 12 | st = hc.formatmonth(2023, 10) 13 | print(st) 14 | 15 | # loop over the days over a month 16 | # zeros indicates that the day of the week is in an overlapping month 17 | for i in c.itermonthdays(2023, 10): 18 | print(i) 19 | 20 | for day in calendar.month_name: 21 | print(day) 22 | 23 | print("team meeting will be on: ") 24 | for m in range(1, 13): 25 | cal = calendar.monthcalendar(2023, m) 26 | weekone = cal[0] 27 | weektwo = cal[1] 28 | if weekone[calendar.FRIDAY] != 0: 29 | meetday = weekone[calendar.FRIDAY] 30 | else: 31 | meetday = weektwo[calendar.FRIDAY] 32 | 33 | print("%10s %2d" % (calendar.month_name[m], meetday)) 34 | 35 | 36 | 37 | ''' 38 | # The Output Part 39 | 40 | 41 | October 2023 42 | Su Mo Tu We Th Fr Sa 43 | 1 2 3 4 5 6 7 44 | 8 9 10 11 12 13 14 45 | 15 16 17 18 19 20 21 46 | 22 23 24 25 26 27 28 47 | 29 30 31 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | 56 | 57 |
October 2023
SunMonTueWedThuFriSat
1234567
891011121314
15161718192021
22232425262728
293031    
58 | 59 | 1 60 | 2 61 | 3 62 | 4 63 | 5 64 | 6 65 | 7 66 | 8 67 | 9 68 | 10 69 | 11 70 | 12 71 | 13 72 | 14 73 | 15 74 | 16 75 | 17 76 | 18 77 | 19 78 | 20 79 | 21 80 | 22 81 | 23 82 | 24 83 | 25 84 | 26 85 | 27 86 | 28 87 | 29 88 | 30 89 | 31 90 | 0 91 | 0 92 | 0 93 | 0 94 | 95 | January 96 | February 97 | March 98 | April 99 | May 100 | June 101 | July 102 | August 103 | September 104 | October 105 | November 106 | December 107 | team meeting will be on: 108 | January 6 109 | February 3 110 | March 3 111 | April 7 112 | May 5 113 | June 2 114 | July 7 115 | August 4 116 | September 1 117 | October 6 118 | November 3 119 | December 1 120 | 121 | ''' -------------------------------------------------------------------------------- /Project/Cpp Progs/Check-if-Tree-is-Isomorphic.cpp: -------------------------------------------------------------------------------- 1 | //{ Driver Code Starts 2 | #include 3 | using namespace std; 4 | struct Node { 5 | int data; 6 | Node *left; 7 | Node *right; 8 | 9 | Node(int val) { 10 | data = val; 11 | left = right = NULL; 12 | } 13 | }; 14 | Node* buildTree(string str) 15 | { 16 | // Corner Case 17 | if(str.length() == 0 || str[0] == 'N') 18 | return NULL; 19 | 20 | // Creating vector of strings from input 21 | // string after spliting by space 22 | vector ip; 23 | 24 | istringstream iss(str); 25 | for(string str; iss >> str; ) 26 | ip.push_back(str); 27 | 28 | // Create the root of the tree 29 | Node* root = new Node(stoi(ip[0])); 30 | 31 | // Push the root to the queue 32 | queue queue; 33 | queue.push(root); 34 | 35 | // Starting from the second element 36 | int i = 1; 37 | while(!queue.empty() && i < ip.size()) { 38 | 39 | // Get and remove the front of the queue 40 | Node* currNode = queue.front(); 41 | queue.pop(); 42 | 43 | // Get the current node's value from the string 44 | string currVal = ip[i]; 45 | 46 | // If the left child is not null 47 | if(currVal != "N") { 48 | 49 | // Create the left child for the current node 50 | currNode->left = new Node(stoi(currVal)); 51 | 52 | // Push it to the queue 53 | queue.push(currNode->left); 54 | } 55 | 56 | // For the right child 57 | i++; 58 | if(i >= ip.size()) 59 | break; 60 | currVal = ip[i]; 61 | 62 | // If the right child is not null 63 | if(currVal != "N") { 64 | 65 | // Create the right child for the current node 66 | currNode->right = new Node(stoi(currVal)); 67 | 68 | // Push it to the queue 69 | queue.push(currNode->right); 70 | } 71 | i++; 72 | } 73 | 74 | return root; 75 | } 76 | 77 | 78 | // } Driver Code Ends 79 | /*Complete the function below 80 | Node is as follows: 81 | struct Node { 82 | int data; 83 | Node *left; 84 | Node *right; 85 | 86 | Node(int val) { 87 | data = val; 88 | left = right = NULL; 89 | } 90 | }; 91 | */ 92 | 93 | class Solution{ 94 | public: 95 | bool isIsomorphic(Node *root1,Node *root2){ 96 | if(root1==nullptr && root2==nullptr) 97 | return true; 98 | if(root1==nullptr || root2==nullptr) 99 | return false; 100 | if(root1->data!=root2->data) 101 | return false; 102 | return(isIsomorphic(root1->right, root2->right) && isIsomorphic(root1->left,root2->left)) || (isIsomorphic(root1->right, root2->left) && isIsomorphic(root1->left,root2->right)); 103 | } 104 | }; 105 | 106 | //{ Driver Code Starts. 107 | 108 | int main() 109 | { 110 | int t; 111 | scanf("%d ",&t); 112 | while(t--) 113 | { 114 | string s1,s2; 115 | getline(cin,s1); 116 | getline(cin,s2); 117 | Node* root1 = buildTree(s1); 118 | Node* root2 = buildTree(s2); 119 | Solution obj; 120 | if(obj.isIsomorphic(root1,root2)) 121 | cout<<"Yes"< 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | # The Open Source Adventure Awaits! 🗺️ 23 | 24 | 🌐 HacktoberFest is your gateway to the vibrant world of open source. This year marks the 10th anniversary of Hacktoberfest, and we’re calling on your support! Join us on this epic journey and earn yourself an exclusive digital reward kit from DigitalOcean and our sponsors and partners.. 25 | 26 | 📢 Sign up for Hacktoberfest 2023, and contribute four pull requests (PRs) between October 1st-31st to claim your stash of cool SWAGS 🔥. 27 | 28 | ## [Click to Participate](https://hacktoberfest.com/participation/) 29 | 30 | # Task 1.0 31 | 32 | Welcome to our Hacktoberfest 2023 contributing website! We're excited to have you on board. Follow the steps below to contribute and add your name, picture, LinkedIn profile, and GitHub profile to our contributors' list. 33 | 34 | ## INSTRUCTIONS - Get Ready for the Adventure 🧭 35 | 36 | - Fork this Repository using the button at the top on right corner. 37 | 38 | ![img_fork_1](https://github.com/Ananyasingh2002/Hacktoberfest2023/assets/90714878/bcb92dfb-0c7f-4f6f-976c-05acbfdcd3f2) 39 | 40 | - Clone your forked repository to your pc `git clone https://github.com/Ananyasingh2002/Hacktoberfest2023.git` 41 | 42 | ![clone_2](https://github.com/Ananyasingh2002/Hacktoberfest2023/assets/90714878/a61a60a1-7c42-484d-a38c-03db0e372aa0) 43 | 44 | - Carve your own path with a new branch for your modifications (ie. `git branch new-user` and check it out `git checkout new-user` or simply do `git checkout -b new-user`) 45 | 46 | - Leave your mark by adding your profile image to `images/` (drag and drop or upload with commands or by your name). 47 | 48 | - Chronicle your legend by crafting your profile data in `participant/` (add your information here) 49 | 50 | - Blaze your trail with these commands: `git add -A` or `git add .`, `git commit -m "added myself"`, and `git push origin new-explorer` 51 | 52 | - Create a pull request 53 | 54 | - Star this repository 55 | 56 | # How To Make Your First Pull Request 57 | 58 | ## 1. Add your profile picture to the folder 59 | 60 | Add a profile picture of your choice in `images/`. Accepted files are **png** and **jpg**, Ex. 61 | 62 | ``` 63 | images/.png 64 | ``` 65 | 66 | ## 2. Add your profile information 67 | 68 | Create a markdown file in your folder following the convention `participant/.md`. Ex. 69 | 70 | ``` 71 | participant/.md 72 | ``` 73 | 74 | Copy the next template into your file, delete the boilerplate data and fill the information with yours. 75 | 76 | ``` 77 | --- 78 | name: YOURNAME 79 | institution/company: INSTITUTION_NAME 80 | github:USERNAME 81 | --- 82 | ``` 83 | 84 | ## 3. Wait for Pull Request to merge 85 | 86 | ## 4. Here is a quick reference guide for GitHub: [GitHub Guide](https://github.com/git-guides) 87 | 88 | ## 5. Celebrate - you've done your first pull request!! 89 | 90 | - Aim to make more than 4 pull requests. 91 | - Imagine you've only made 4 pull requests to different projects, but one of those projects isn't part of the Hacktoberfest event. 92 | - In that case, your pull request won't be counted, leaving you with just 3 valid ones if those projects aren't excluded either. 93 | - To ensure your success, I recommend making a pull request to your own repo, as long as it has the Hacktoberfest topic. 94 | 95 | # Task 2.0 96 | 97 | ## Hacktoberfest 2023 Contribution Guide 98 | 99 | Welcome to our Hacktoberfest 2023 contributing website! We're excited to have you on board. Follow the steps below to contribute and add your name, picture, LinkedIn profile, and GitHub profile to our contributors' list. 100 | 101 | ## Here is the link to the website: https://ananyasingh2002.github.io/Hacktoberfest2023/ 102 | 103 | ## INSTRUCTIONS - Get Ready for the Adventure 🧭 104 | 105 | - Fork this repository to your GitHub account by clicking the "Fork" button at the top right of this page. 106 | ![img_fork_1](https://github.com/Ananyasingh2002/Hacktoberfest2023/assets/90714878/bcb92dfb-0c7f-4f6f-976c-05acbfdcd3f2) 107 | 108 | - Clone your forked repository to your local machine. Replace `` with your GitHub username: 109 | 110 | ```bash 111 | git clone https://github.com/Ananyasingh2002/Hacktoberfest2023.git 112 | ``` 113 | 114 | - Navigate to the project directory: `cd Hacktoberfest2023` 115 | 116 | - Create a new branch for your changes. Replace with a descriptive branch name: `git checkout -b ` 117 | 118 | - Leave your mark by adding your profile image to `assets/images` (drag and drop or upload with commands or by your name). 119 | 120 | - Chronicle your legend by crafting your profile data in `index.html and CSS(add your image address)` (add your information here) 121 | 122 | - Blaze your trail with these commands: `git add -A` or `git add .`, `git commit -m "added myself"`, and `git push origin new-explorer` 123 | 124 | - Create a pull request 125 | 126 | - Star this repository 127 | 128 | # How To Make Your First Pull Request 129 | 130 | ## 1. Add your profile picture to the folder 131 | 132 | Add a picture picture of your choice in `assets/images/.png`. Accepted files are **png** and **jpg**, Ex. 133 | 134 | ``` 135 | assets/images/.png 136 | ``` 137 | 138 | ## 2. Now, please navigate to the `index.html` file, open it, read the instructions in the code, copy down the line and add your information. 139 | 140 | ![2](https://github.com/Ananyasingh2002/Hacktoberfest2023/assets/90714878/7177298f-d0d8-468a-bd1e-44b0f89fddb1) 141 | 142 | Enter your details here: 143 | 144 | ![3](https://github.com/Ananyasingh2002/Hacktoberfest2023/assets/90714878/6825937d-e0fb-461d-857c-95febd458a16) 145 | 146 | ## 3. Change the class name below 147 | 148 | ``` 149 |
150 |
151 |
152 | ``` 153 | 154 | ![2](https://github.com/Ananyasingh2002/Hacktoberfest2023/assets/90714878/3c8cbf00-ae16-47fe-80f2-d8644d9cf88c) 155 | 156 | So, essentially, you are instructing the reader to change the class name of the first
element to include a number that corresponds to their specific use case. For instance, if their number is 2, the modified code would look like this: 157 | 158 | ``` 159 |
160 |
161 |
162 | ``` 163 | 164 | ![3](https://github.com/Ananyasingh2002/Hacktoberfest2023/assets/90714878/b971fdd7-574c-4661-888c-3ddb0f22d2e3) 165 | 166 | ## 4. Now, please navigate to the `style.css` file, read the instructions, and add the class `.card(as your number is)` along with the image path. 167 | 168 | `url('assets/images/.png')` 169 | 170 | ![1](https://github.com/Ananyasingh2002/Hacktoberfest2023/assets/90714878/b4d96181-a871-420e-a3e4-e645c3d92db7) 171 | 172 | ## 5. Wait for Pull Request to merge 173 | 174 | ## 6. Celebrate - you've done your first pull request!! 175 | 176 | # + Follow Me: Swift Approval of Your Quest 🚀 177 | 178 | To expedite approval of your pull request, (`Follow Me`)🚀 179 | 180 |
Ananya singh
181 | 182 | 183 | -------------------------------------------------------------------------------- /Project/Cpp Progs/FibonacciHeap.cpp: -------------------------------------------------------------------------------- 1 | // Operations on a Fibonacci heap in C++ 2 | 3 | #include 4 | #include 5 | #include 6 | 7 | using namespace std; 8 | 9 | // Node creation 10 | struct node { 11 | int n; 12 | int degree; 13 | node *parent; 14 | node *child; 15 | node *left; 16 | node *right; 17 | char mark; 18 | 19 | char C; 20 | }; 21 | 22 | // Implementation of Fibonacci heap 23 | class FibonacciHeap { 24 | private: 25 | int nH; 26 | 27 | node *H; 28 | 29 | public: 30 | node *InitializeHeap(); 31 | int Fibonnaci_link(node *, node *, node *); 32 | node *Create_node(int); 33 | node *Insert(node *, node *); 34 | node *Union(node *, node *); 35 | node *Extract_Min(node *); 36 | int Consolidate(node *); 37 | int Display(node *); 38 | node *Find(node *, int); 39 | int Decrease_key(node *, int, int); 40 | int Delete_key(node *, int); 41 | int Cut(node *, node *, node *); 42 | int Cascase_cut(node *, node *); 43 | FibonacciHeap() { H = InitializeHeap(); } 44 | }; 45 | 46 | // Initialize heap 47 | node *FibonacciHeap::InitializeHeap() { 48 | node *np; 49 | np = NULL; 50 | return np; 51 | } 52 | 53 | // Create node 54 | node *FibonacciHeap::Create_node(int value) { 55 | node *x = new node; 56 | x->n = value; 57 | return x; 58 | } 59 | 60 | // Insert node 61 | node *FibonacciHeap::Insert(node *H, node *x) { 62 | x->degree = 0; 63 | x->parent = NULL; 64 | x->child = NULL; 65 | x->left = x; 66 | x->right = x; 67 | x->mark = 'F'; 68 | x->C = 'N'; 69 | if (H != NULL) { 70 | (H->left)->right = x; 71 | x->right = H; 72 | x->left = H->left; 73 | H->left = x; 74 | if (x->n < H->n) 75 | H = x; 76 | } else { 77 | H = x; 78 | } 79 | nH = nH + 1; 80 | return H; 81 | } 82 | 83 | // Create linking 84 | int FibonacciHeap::Fibonnaci_link(node *H1, node *y, node *z) { 85 | (y->left)->right = y->right; 86 | (y->right)->left = y->left; 87 | if (z->right == z) 88 | H1 = z; 89 | y->left = y; 90 | y->right = y; 91 | y->parent = z; 92 | 93 | if (z->child == NULL) 94 | z->child = y; 95 | 96 | y->right = z->child; 97 | y->left = (z->child)->left; 98 | ((z->child)->left)->right = y; 99 | (z->child)->left = y; 100 | 101 | if (y->n < (z->child)->n) 102 | z->child = y; 103 | z->degree++; 104 | } 105 | 106 | // Union Operation 107 | node *FibonacciHeap::Union(node *H1, node *H2) { 108 | node *np; 109 | node *H = InitializeHeap(); 110 | H = H1; 111 | (H->left)->right = H2; 112 | (H2->left)->right = H; 113 | np = H->left; 114 | H->left = H2->left; 115 | H2->left = np; 116 | return H; 117 | } 118 | 119 | // Display the heap 120 | int FibonacciHeap::Display(node *H) { 121 | node *p = H; 122 | if (p == NULL) { 123 | cout << "Empty Heap" << endl; 124 | return 0; 125 | } 126 | cout << "Root Nodes: " << endl; 127 | 128 | do { 129 | cout << p->n; 130 | p = p->right; 131 | if (p != H) { 132 | cout << "-->"; 133 | } 134 | } while (p != H && p->right != NULL); 135 | cout << endl; 136 | } 137 | 138 | // Extract min 139 | node *FibonacciHeap::Extract_Min(node *H1) { 140 | node *p; 141 | node *ptr; 142 | node *z = H1; 143 | p = z; 144 | ptr = z; 145 | if (z == NULL) 146 | return z; 147 | 148 | node *x; 149 | node *np; 150 | 151 | x = NULL; 152 | 153 | if (z->child != NULL) 154 | x = z->child; 155 | 156 | if (x != NULL) { 157 | ptr = x; 158 | do { 159 | np = x->right; 160 | (H1->left)->right = x; 161 | x->right = H1; 162 | x->left = H1->left; 163 | H1->left = x; 164 | if (x->n < H1->n) 165 | H1 = x; 166 | 167 | x->parent = NULL; 168 | x = np; 169 | } while (np != ptr); 170 | } 171 | 172 | (z->left)->right = z->right; 173 | (z->right)->left = z->left; 174 | H1 = z->right; 175 | 176 | if (z == z->right && z->child == NULL) 177 | H = NULL; 178 | 179 | else { 180 | H1 = z->right; 181 | Consolidate(H1); 182 | } 183 | nH = nH - 1; 184 | return p; 185 | } 186 | 187 | // Consolidation Function 188 | int FibonacciHeap::Consolidate(node *H1) { 189 | int d, i; 190 | float f = (log(nH)) / (log(2)); 191 | int D = f; 192 | node *A[D]; 193 | 194 | for (i = 0; i <= D; i++) 195 | A[i] = NULL; 196 | 197 | node *x = H1; 198 | node *y; 199 | node *np; 200 | node *pt = x; 201 | 202 | do { 203 | pt = pt->right; 204 | 205 | d = x->degree; 206 | 207 | while (A[d] != NULL) 208 | 209 | { 210 | y = A[d]; 211 | 212 | if (x->n > y->n) 213 | 214 | { 215 | np = x; 216 | 217 | x = y; 218 | 219 | y = np; 220 | } 221 | 222 | if (y == H1) 223 | H1 = x; 224 | Fibonnaci_link(H1, y, x); 225 | if (x->right == x) 226 | H1 = x; 227 | A[d] = NULL; 228 | d = d + 1; 229 | } 230 | 231 | A[d] = x; 232 | x = x->right; 233 | 234 | } 235 | 236 | while (x != H1); 237 | H = NULL; 238 | for (int j = 0; j <= D; j++) { 239 | if (A[j] != NULL) { 240 | A[j]->left = A[j]; 241 | A[j]->right = A[j]; 242 | if (H != NULL) { 243 | (H->left)->right = A[j]; 244 | A[j]->right = H; 245 | A[j]->left = H->left; 246 | H->left = A[j]; 247 | if (A[j]->n < H->n) 248 | H = A[j]; 249 | } else { 250 | H = A[j]; 251 | } 252 | if (H == NULL) 253 | H = A[j]; 254 | else if (A[j]->n < H->n) 255 | H = A[j]; 256 | } 257 | } 258 | } 259 | 260 | // Decrease Key Operation 261 | int FibonacciHeap::Decrease_key(node *H1, int x, int k) { 262 | node *y; 263 | if (H1 == NULL) { 264 | cout << "The Heap is Empty" << endl; 265 | return 0; 266 | } 267 | node *ptr = Find(H1, x); 268 | if (ptr == NULL) { 269 | cout << "Node not found in the Heap" << endl; 270 | return 1; 271 | } 272 | 273 | if (ptr->n < k) { 274 | cout << "Entered key greater than current key" << endl; 275 | return 0; 276 | } 277 | ptr->n = k; 278 | y = ptr->parent; 279 | if (y != NULL && ptr->n < y->n) { 280 | Cut(H1, ptr, y); 281 | Cascase_cut(H1, y); 282 | } 283 | 284 | if (ptr->n < H->n) 285 | H = ptr; 286 | 287 | return 0; 288 | } 289 | 290 | // Cutting Function 291 | int FibonacciHeap::Cut(node *H1, node *x, node *y) 292 | 293 | { 294 | if (x == x->right) 295 | y->child = NULL; 296 | (x->left)->right = x->right; 297 | (x->right)->left = x->left; 298 | if (x == y->child) 299 | y->child = x->right; 300 | y->degree = y->degree - 1; 301 | x->right = x; 302 | x->left = x; 303 | (H1->left)->right = x; 304 | x->right = H1; 305 | x->left = H1->left; 306 | H1->left = x; 307 | x->parent = NULL; 308 | x->mark = 'F'; 309 | } 310 | 311 | // Cascade cut 312 | int FibonacciHeap::Cascase_cut(node *H1, node *y) { 313 | node *z = y->parent; 314 | if (z != NULL) { 315 | if (y->mark == 'F') { 316 | y->mark = 'T'; 317 | } else 318 | 319 | { 320 | Cut(H1, y, z); 321 | Cascase_cut(H1, z); 322 | } 323 | } 324 | } 325 | 326 | // Search function 327 | node *FibonacciHeap::Find(node *H, int k) { 328 | node *x = H; 329 | x->C = 'Y'; 330 | node *p = NULL; 331 | if (x->n == k) { 332 | p = x; 333 | x->C = 'N'; 334 | return p; 335 | } 336 | 337 | if (p == NULL) { 338 | if (x->child != NULL) 339 | p = Find(x->child, k); 340 | if ((x->right)->C != 'Y') 341 | p = Find(x->right, k); 342 | } 343 | 344 | x->C = 'N'; 345 | return p; 346 | } 347 | 348 | // Deleting key 349 | int FibonacciHeap::Delete_key(node *H1, int k) { 350 | node *np = NULL; 351 | int t; 352 | t = Decrease_key(H1, k, -5000); 353 | if (!t) 354 | np = Extract_Min(H); 355 | if (np != NULL) 356 | cout << "Key Deleted" << endl; 357 | else 358 | cout << "Key not Deleted" << endl; 359 | return 0; 360 | } 361 | 362 | int main() { 363 | int n, m, l; 364 | FibonacciHeap fh; 365 | node *p; 366 | node *H; 367 | H = fh.InitializeHeap(); 368 | 369 | p = fh.Create_node(7); 370 | H = fh.Insert(H, p); 371 | p = fh.Create_node(3); 372 | H = fh.Insert(H, p); 373 | p = fh.Create_node(17); 374 | H = fh.Insert(H, p); 375 | p = fh.Create_node(24); 376 | H = fh.Insert(H, p); 377 | 378 | fh.Display(H); 379 | 380 | p = fh.Extract_Min(H); 381 | if (p != NULL) 382 | cout << "The node with minimum key: " << p->n << endl; 383 | else 384 | cout << "Heap is empty" << endl; 385 | 386 | m = 26; 387 | l = 16; 388 | fh.Decrease_key(H, m, l); 389 | 390 | m = 16; 391 | fh.Delete_key(H, m); 392 | } 393 | -------------------------------------------------------------------------------- /style.css: -------------------------------------------------------------------------------- 1 | @import url('https://fonts.googleapis.com/css?family=Lato'); 2 | @import url("https://fonts.googleapis.com/css2?family=JetBrains+Mono:ital,wght@0,400;0,600;0,700;0,800;1,800&display=swap"); 3 | 4 | /* Go to line 216 for adding the image in css */ 5 | 6 | *{ 7 | margin: 0px; 8 | padding: 0; 9 | } 10 | 11 | #logo { 12 | width: 20vw; 13 | height: 10vh; 14 | position: absolute; 15 | top: 10px; 16 | left: 10px; 17 | } 18 | 19 | @media screen and (max-width: 1200px){ 20 | #logo{ 21 | width:20vh; 22 | } 23 | } 24 | 25 | #hka{ 26 | width: 60px; 27 | } 28 | .same{ 29 | display: flex; 30 | justify-content: space-between; 31 | } 32 | 33 | .github { 34 | position: absolute; 35 | top: 20px; 36 | right: 40px; 37 | z-index: 9999; 38 | 39 | } 40 | 41 | .github a { 42 | text-decoration: none; 43 | color: #000; 44 | 45 | } 46 | 47 | .card { 48 | /* border-radius: 10px; */ 49 | /* box-shadow: 0 9px 0px 0px transparent, 0 -9px 0px 0px white, 12px 0 15px -4px rgba(18, 20, 22, 0.8), -12px 0 15px -4px rgba(8, 16, 26, 0.8); */ 50 | 51 | /* Your existing card styles */ 52 | 53 | /* Use flexbox to center-align the content vertically and horizontally */ 54 | display: flex; 55 | flex-direction: column; 56 | justify-content: center; 57 | align-items: center; 58 | } 59 | 60 | 61 | .centered-links { 62 | /* Optional: If you want to center the links within this container */ 63 | display: flex; 64 | gap: 10px; /* Adjust the spacing between the links */ 65 | align-items: center; 66 | } 67 | 68 | 69 | .viewport{ 70 | position:relative; 71 | background: linear-gradient(90deg, #20e6b3, #8e11f3, #4c20d4); 72 | background-size: 500% 500%; 73 | height: 100%; 74 | width:100%; 75 | -webkit-animation: AnimationName 10s ease infinite; 76 | -moz-animation: AnimationName 10s ease infinite; 77 | animation: AnimationName 10s ease infinite; 78 | 79 | 80 | } 81 | 82 | @-webkit-keyframes AnimationName { 83 | 0%{background-position:0% 50%} 84 | 50%{background-position:100% 50%} 85 | 100%{background-position:0% 50%} 86 | } 87 | @-moz-keyframes AnimationName { 88 | 0%{background-position:0% 50%} 89 | 50%{background-position:100% 50%} 90 | 100%{background-position:0% 50%} 91 | } 92 | @keyframes AnimationName { 93 | 0%{background-position:0% 50%} 94 | 50%{background-position:100% 50%} 95 | 100%{background-position:0% 50%} 96 | } 97 | 98 | .card p{ 99 | font-family: lato; 100 | margin:0px; 101 | color: black; 102 | font-weight: 400; 103 | font-size:15px; 104 | line-height:90%; 105 | padding-left: 8%; 106 | padding-right: 8%; 107 | padding-top:3%; 108 | padding-bottom:8%; 109 | border-radius:20px; 110 | cursor:pointer; 111 | transition: ease 1s; 112 | -webkit-transition: ease 1s; 113 | } 114 | 115 | .card h3{ 116 | font-family: lato; 117 | margin:0px; 118 | color: black; 119 | font-weight: 400; 120 | font-size:20px; 121 | line-height:90%; 122 | padding-left: 8%; 123 | padding-top:8%; 124 | padding-bottom:3%; 125 | border-radius:20px; 126 | cursor:pointer; 127 | transition: ease 1s; 128 | -webkit-transition: ease 1s; 129 | } 130 | 131 | h1{ 132 | font-family: JetBrains Mono,monospace; 133 | color:white; 134 | font-weight: 400; 135 | font-size:35px; 136 | line-height:90%; 137 | padding-bottom:140px; 138 | padding-top:150px; 139 | position:relative; 140 | text-align:center; 141 | 142 | } 143 | 144 | .title{ 145 | width: 50%; 146 | margin:auto; 147 | padding-left:0px; 148 | padding-bottom:0px; 149 | } 150 | 151 | .cards { 152 | min-width: 80%; 153 | position: relative; 154 | margin-left: auto; 155 | margin-right: auto; 156 | padding-bottom: 500px; 157 | display: grid; 158 | grid-template-columns: repeat(4, 1fr); /* Create 4 columns with equal width */ 159 | justify-items: center; /* Center horizontally within the column */ 160 | align-items: center; /* Center vertically within the column */ 161 | overflow: hidden; 162 | grid-gap: 70px 10px; /* Optional gap between cards */ 163 | } 164 | 165 | @media screen and (max-width: 1200px){ 166 | .cards{ 167 | grid-template-columns: 1fr; 168 | } 169 | } 170 | 171 | 172 | .card{ 173 | width:70%; 174 | position:relative; 175 | background-color:white; 176 | margin:1.13%; 177 | border-radius:5px; 178 | transition: 1s; 179 | -webkit-transition:0.5s; 180 | cursor:pointer; 181 | flex: 1 1 auto; 182 | } 183 | 184 | .card:hover{ 185 | transform: scale(1.05); 186 | box-shadow: 10px 10px 15px rgba(0,0,0,0.3); 187 | } 188 | 189 | @media screen and (max-width: 1200px){ 190 | .card{ 191 | width:30%; 192 | margin:1.6%; 193 | } 194 | } 195 | 196 | @media screen and (max-width: 800px){ 197 | .card{ 198 | width:45%; 199 | margin:2.5%; 200 | } 201 | } 202 | 203 | @media screen and (max-width: 500px){ 204 | .card{ 205 | width:80%; 206 | margin:2%; 207 | } 208 | } 209 | 210 | .card_img{ 211 | width:100%; 212 | height:250px; 213 | position:reltive; 214 | border-radius: 5px 5px 0px 0px; 215 | background-size: cover; 216 | background-position:center center; 217 | background-color: #20e6b3; 218 | transition:1s; 219 | -webkit-transition:1s; 220 | } 221 | /* Here make a new class .card(as your number below) and add the same path of url(assets/images/yourimage.png)*/ 222 | .card1{ 223 | background-image: url(assets/images/Ananya.jpg); 224 | } 225 | .card2{ 226 | background-image: url(assets/images/Yash.jpg); 227 | } 228 | .card3{ 229 | background-image: url(assets/images/Divya.jpg); 230 | } 231 | .card4{ 232 | background-image: url(assets/images/Aditya.jpg) 233 | } 234 | 235 | .card5{ 236 | background-image: url(assets/images/SyedSumaimaly.jpeg) 237 | } 238 | 239 | .card6{ 240 | background-image: url(assets/images/Mansi.jpg) 241 | } 242 | 243 | .card7{ 244 | background-image: url(assets/images/Sreerag.jpg) 245 | } 246 | 247 | .card8{ 248 | background-image: url(assets/images/sami.jpg); 249 | } 250 | 251 | 252 | 253 | .card9{ 254 | background-image: url(assets/images/manisha.jpg); 255 | } 256 | 257 | .card10{ 258 | background-image: url(assets/images/AnirudhBelwadi.jpeg) 259 | } 260 | 261 | 262 | .card11{ 263 | background-image: url(assets/images/aviral.jpg) 264 | } 265 | 266 | .card12{ 267 | background-image: url(assets/images/koppisettivenkatesh.jpg) 268 | } 269 | 270 | 271 | 272 | 273 | .card13{ 274 | background-image: url(assets/images/Satyajit-2003.jpeg) 275 | } 276 | 277 | 278 | 279 | .card14{ 280 | background-image: url(assets/images/digvijaysinghh.jpeg) 281 | } 282 | 283 | 284 | 285 | 286 | .card15{ 287 | 288 | background-image: url(assets/images/porkalai.jpg) 289 | 290 | } 291 | 292 | 293 | 294 | 295 | .card-16{ 296 | background-image: url(assets/images/shourya.jpg) 297 | } 298 | 299 | .card-17{ 300 | background-image: url(assets/images/Rupayan-Dirghangi.jpg); 301 | } 302 | 303 | .card18{ 304 | background-image: url(assets/images/soubhik.jpg) 305 | } 306 | 307 | .card19{ 308 | background-image: url(assets/images/shubhankar-ranjan.jpg) 309 | } 310 | 311 | .card20{ 312 | background-image: url(assets/images/ankit.jpg) 313 | } 314 | .card21{ 315 | background-image: url(assets/images/Lsam18.png); 316 | } 317 | 318 | 319 | .card22{ 320 | background-image: url(assets/images/Atharva.jpg); 321 | } 322 | 323 | .card23{ 324 | background-image: url(assets/images/nimishhh.jpeg); 325 | } 326 | 327 | .line{ 328 | height:2px; 329 | width:84%; 330 | margin:auto; 331 | background-color: #8e11f3; 332 | } 333 | 334 | .title input{ 335 | background: transparent; 336 | border:1px solid white; 337 | padding-top:10px; 338 | padding-bottom:10px; 339 | padding-left:20px; 340 | display:inline; 341 | font-family: lato; 342 | color: white; 343 | font-size:18px; 344 | line-height:90%; 345 | border-radius:30px; 346 | width:150px; 347 | float:right; 348 | margin-top:30px; 349 | } 350 | 351 | .title textarea:focus, input:focus{ 352 | outline: none; 353 | } 354 | 355 | /* .plus{ 356 | width:20px; 357 | height:20px; 358 | background: transparent; 359 | border-radius: 50%; 360 | position: absolute; 361 | border: 2px solid white; 362 | top:10px; 363 | right:10px; 364 | transition: 1s; 365 | -webkit-transition: 1s; 366 | } */ 367 | /* 368 | .plus:hover{ 369 | transform: scale(1.1) rotate(90deg); 370 | } */ 371 | 372 | /* .plus p{ 373 | padding: 0px !important; 374 | display:inline; 375 | margin:0px; 376 | line-height:50%; 377 | left:50%; 378 | top:45.3%; 379 | transform:translate(-50%,-50%); 380 | position:absolute; 381 | color: white; 382 | } */ 383 | 384 | .zoomed{ 385 | width:100%; 386 | } 387 | -------------------------------------------------------------------------------- /index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | Document 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 |
18 | 19 |
20 | 22 | 24 | 25 |
26 |
27 |
28 |

2023 Contributors

29 |
30 |
31 | 32 | 33 | 34 | 35 | 36 | 37 |
38 |
39 |
40 |
41 |

Ananya singh

42 |
43 |

44 | 45 | 47 | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 56 | 57 | 58 | 59 | 60 | 62 | 63 | 64 | 65 | 67 | 68 | 69 | 70 | 72 | 73 | 74 | 75 | 76 | 77 | 78 | 79 | 80 | 81 | 82 | 84 | 85 | 86 | 87 | 88 |

89 |
90 | 91 | 92 | 93 | 94 | 95 | 96 | 97 | 98 |
99 |
100 |
101 |
102 |

Yash Jaiswal

103 |
104 |

105 | 106 | 108 | 109 | 110 | 111 | 112 | 113 | 114 | 115 | 117 | 118 | 119 | 120 | 121 | 123 | 124 | 125 | 126 | 128 | 129 | 130 | 131 | 133 | 134 | 135 | 136 | 137 | 138 | 139 | 140 | 141 | 142 | 143 | 145 | 146 | 147 | 148 | 149 |

150 |
151 | 152 | 153 | 154 | 155 |
156 |
157 |
158 |
159 |

Divya

160 |
161 |

162 | 163 | 165 | 166 | 167 | 168 | 169 | 170 | 171 | 172 | 174 | 175 | 176 | 177 | 178 | 180 | 181 | 182 | 183 | 185 | 186 | 187 | 188 | 190 | 191 | 192 | 193 | 194 | 195 | 196 | 197 | 198 | 199 | 200 | 202 | 203 | 204 | 205 | 206 |

207 |
208 | 209 | 210 | 211 | 212 | 213 | 214 | 215 | 216 | 217 |
218 |
219 |
220 |
221 |

Aditya Ghorpade

222 |
223 |

224 | 225 | 227 | 228 | 229 | 230 | 231 | 232 | 233 | 234 | 236 | 237 | 238 | 239 | 240 | 242 | 243 | 244 | 245 | 247 | 248 | 249 | 250 | 252 | 253 | 254 | 255 | 256 | 257 | 258 | 259 | 260 | 261 | 262 | 264 | 265 | 266 | 267 | 268 |

269 |
270 | 271 | 272 | 273 | 274 | 275 | 276 | 277 | 278 | 279 | 280 |
281 |
282 |
283 |
284 |

Syed Sumaim Ali

285 |
286 |

287 | 288 | 290 | 291 | 292 | 293 | 294 | 295 | 296 | 297 | 299 | 300 | 301 | 302 | 303 | 305 | 306 | 307 | 308 | 310 | 311 | 312 | 313 | 315 | 316 | 317 | 318 | 319 | 320 | 321 | 322 | 323 | 324 | 325 | 327 | 328 | 329 | 330 | 331 |

332 |
333 | 334 | 335 | 336 | 337 | 338 | 339 | 340 | 341 | 342 |
343 |
344 |
345 |
346 |

Mansi

347 |
348 |

349 | 350 | 352 | 353 | 354 | 355 | 356 | 357 | 358 | 359 | 361 | 362 | 363 | 364 | 365 | 367 | 368 | 369 | 370 | 372 | 373 | 374 | 375 | 377 | 378 | 379 | 380 | 381 | 382 | 383 | 384 | 385 | 386 | 387 | 389 | 390 | 391 | 392 | 393 |

394 |
395 | 396 | 397 | 398 | 399 | 400 | 401 | 402 | 403 | 404 | 405 |
406 |
407 |
408 |
409 |

Sreerag P

410 |
411 |

412 | 413 | 415 | 416 | 417 | 418 | 419 | 420 | 421 | 422 | 424 | 425 | 426 | 427 | 428 | 430 | 431 | 432 | 433 | 435 | 436 | 437 | 438 | 440 | 441 | 442 | 443 | 444 | 445 | 446 | 447 | 448 | 449 | 450 | 452 | 453 | 454 | 455 | 456 |

457 |
458 | 459 | 460 | 461 | 462 | 463 | 464 | 465 | 466 |
467 |
468 |
469 |
470 |

Muhammad Sami Bhat

471 |
472 |

473 | 474 | 476 | 477 | 478 | 479 | 480 | 481 | 482 | 483 | 485 | 486 | 487 | 488 | 489 | 491 | 492 | 493 | 494 | 496 | 497 | 498 | 499 | 501 | 502 | 503 | 504 | 505 | 506 | 507 | 508 | 509 | 510 | 511 | 513 | 514 | 515 | 516 | 517 |

518 |
519 | 520 | 521 | 522 | 523 | 524 | 525 | 526 | 527 |
528 |
529 |
530 |
531 |

Manisha Roy

532 |
533 |

534 | 535 | 537 | 538 | 539 | 540 | 541 | 542 | 543 | 544 | 546 | 547 | 548 | 549 | 550 | 552 | 553 | 554 | 555 | 557 | 558 | 559 | 560 | 562 | 563 | 564 | 565 | 566 | 567 | 568 | 569 | 570 | 571 | 572 | 574 | 575 | 576 | 577 | 578 |

579 |
580 | 581 | 582 | 583 | 584 | 585 | 586 | 587 | 588 | 589 | 590 |
591 |
592 |
593 |
594 |

Anirudh Belwadi

595 |
596 |

597 | 598 | 600 | 601 | 602 | 603 | 604 | 605 | 606 | 607 | 609 | 610 | 611 | 612 | 613 | 615 | 616 | 617 | 618 | 620 | 621 | 622 | 623 | 625 | 626 | 627 | 628 | 629 | 630 | 631 | 632 | 633 | 634 | 635 | 637 | 638 | 639 | 640 | 641 |

642 |
643 | 644 | 645 | 646 | 647 | 648 | 649 | 650 | 651 | 652 |
653 |
654 |
655 |
656 |

Aviral Singh

657 |
658 |

659 | 660 | 662 | 663 | 664 | 665 | 666 | 667 | 668 | 669 | 671 | 672 | 673 | 674 | 675 | 677 | 678 | 679 | 680 | 682 | 683 | 684 | 685 | 687 | 688 | 689 | 690 | 691 | 692 | 693 | 694 | 695 | 696 | 697 | 699 | 700 | 701 | 702 | 703 |

704 |
705 | 706 | 707 | 708 | 709 |
710 |
711 |
712 |
713 |

Koppisetti Venkatesh

714 |
715 |

716 | 717 | 719 | 720 | 721 | 722 | 723 | 724 | 725 | 726 | 728 | 729 | 730 | 731 | 732 | 734 | 735 | 736 | 737 | 739 | 740 | 741 | 742 | 744 | 745 | 746 | 747 | 748 | 749 | 750 | 751 | 752 | 753 | 754 | 756 | 757 | 758 | 759 | 760 |

761 |
762 | 763 | 764 | 765 |
766 |
767 |
768 |
769 |

Satyajit Satapathy

770 |
771 |

772 | 773 | 775 | 776 | 777 | 778 | 779 | 780 | 781 | 782 | 784 | 785 | 786 | 787 | 788 | 790 | 791 | 792 | 793 | 795 | 796 | 797 | 798 | 800 | 801 | 802 | 803 | 804 | 805 | 806 | 807 | 808 | 809 | 810 | 812 | 813 | 814 | 815 | 816 |

817 |
818 | 819 | 820 | 821 | 822 | 823 | 824 | 825 | 826 | 827 |
828 |
829 |
830 |
831 |

Digvijay singh

832 |
833 |

834 | 835 | 837 | 838 | 839 | 840 | 841 | 842 | 843 | 844 | 846 | 847 | 848 | 849 | 850 | 852 | 853 | 854 | 855 | 857 | 858 | 859 | 860 | 862 | 863 | 864 | 865 | 866 | 867 | 868 | 869 | 870 | 871 | 872 | 874 | 875 | 876 | 877 | 878 |

879 |
880 | 881 | 882 | 883 | 884 | 885 | 886 | 887 | 888 |
889 |
890 |
891 |
892 |

Porkalai Selvi S

893 |
894 |

895 | 896 | 899 | 900 | 901 | 902 | 903 | 904 | 905 | 906 | 908 | 909 | 910 | 911 | 912 | 914 | 915 | 916 | 917 | 919 | 920 | 921 | 922 | 923 | 926 | 927 | 928 | 929 | 930 | 931 | 932 | 933 | 934 | 935 | 936 | 938 | 939 | 940 | 941 | 942 |

943 |
944 | 945 | 946 | 947 | 948 | 949 | 950 | 951 |
952 |
953 |
954 |
955 |

Shourya Singh Rathore

956 |
957 |

958 | 959 | 961 | 962 | 963 | 964 | 965 | 966 | 967 | 968 | 970 | 971 | 972 | 973 | 974 | 976 | 977 | 978 | 979 | 981 | 982 | 983 | 984 | 986 | 987 | 988 | 989 | 990 | 991 | 992 | 993 | 994 | 995 | 996 | 998 | 999 | 1000 | 1001 | 1002 |

1003 |
1004 | 1005 | 1006 | 1007 | 1008 | 1009 | 1010 |
1011 |
1012 |
1013 |
1014 |

Rupayan Dirghangi

1015 |
1016 |

1017 | 1018 | 1020 | 1021 | 1022 | 1023 | 1024 | 1025 | 1026 | 1027 | 1029 | 1030 | 1031 | 1032 | 1033 | 1035 | 1036 | 1037 | 1038 | 1040 | 1041 | 1042 | 1043 | 1045 | 1046 | 1047 | 1048 | 1049 | 1050 | 1051 | 1052 | 1053 | 1054 | 1055 | 1057 | 1058 | 1059 | 1060 | 1061 |

1062 |
1063 | 1064 | 1065 | 1066 | 1067 |
1068 |
1069 |
1070 |
1071 |

Soubhik

1072 |
1073 |

1074 | 1075 | 1078 | 1079 | 1080 | 1081 | 1082 | 1083 | 1084 | 1085 | 1087 | 1088 | 1089 | 1090 | 1091 | 1093 | 1094 | 1095 | 1096 | 1098 | 1099 | 1100 | 1101 | 1102 | 1105 | 1106 | 1107 | 1108 | 1109 | 1110 | 1111 | 1112 | 1113 | 1114 | 1115 | 1117 | 1118 | 1119 | 1120 | 1121 |

1122 |
1123 | 1124 | 1125 | 1126 | 1127 | 1128 |
1129 |
1130 |
1131 |
1132 |

Shubhankar Ranjan

1133 |
1134 |

1135 | 1136 | 1138 | 1139 | 1140 | 1141 | 1142 | 1143 | 1144 | 1145 | 1147 | 1148 | 1149 | 1150 | 1151 | 1153 | 1154 | 1155 | 1156 | 1158 | 1159 | 1160 | 1161 | 1163 | 1164 | 1165 | 1166 | 1167 | 1168 | 1169 | 1170 | 1171 | 1172 | 1173 | 1175 | 1176 | 1177 | 1178 | 1179 |

1180 |
1181 | 1182 | 1183 | 1184 | 1185 |
1186 |
1187 |
1188 |
1189 |

Ankit Goyal

1190 |
1191 |

1192 | 1193 | 1195 | 1196 | 1197 | 1198 | 1199 | 1200 | 1201 | 1202 | 1204 | 1205 | 1206 | 1207 | 1208 | 1210 | 1211 | 1212 | 1213 | 1215 | 1216 | 1217 | 1218 | 1220 | 1221 | 1222 | 1223 | 1224 | 1225 | 1226 | 1227 | 1228 | 1229 | 1230 | 1232 | 1233 | 1234 | 1235 | 1236 |

1237 |
1238 | 1239 | 1240 | 1241 | 1242 | 1243 | 1244 | 1245 | 1246 | 1247 |
1248 |
1249 |
1250 |
1251 |

Lakshan Sameera

1252 |
1253 |

1254 | 1255 | 1257 | 1258 | 1259 | 1260 | 1261 | 1262 | 1263 | 1264 | 1266 | 1267 | 1268 | 1269 | 1270 | 1272 | 1273 | 1274 | 1275 | 1277 | 1278 | 1279 | 1280 | 1282 | 1283 | 1284 | 1285 | 1286 | 1287 | 1288 | 1289 | 1290 | 1291 | 1292 | 1294 | 1295 | 1296 | 1297 | 1298 |

1299 |
1300 | 1301 | 1302 | 1303 | 1304 | 1305 | 1306 | 1307 | 1308 | 1309 |
1310 |
1311 |
1312 |
1313 |

Atharva saraiya

1314 |
1315 |

1316 | 1317 | 1319 | 1320 | 1321 | 1322 | 1323 | 1324 | 1325 | 1326 | 1328 | 1329 | 1330 | 1331 | 1332 | 1334 | 1335 | 1336 | 1337 | 1339 | 1340 | 1341 | 1342 | 1344 | 1345 | 1346 | 1347 | 1348 | 1349 | 1350 | 1351 | 1352 | 1353 | 1354 | 1356 | 1357 | 1358 | 1359 | 1360 |

1361 |
1362 | 1363 |
1364 |
1365 |
1366 |
1367 |

Nimish Mittal

1368 |
1369 |

1370 | 1371 | 1373 | 1374 | 1375 | 1376 | 1377 | 1378 | 1379 | 1380 | 1382 | 1383 | 1384 | 1385 | 1386 | 1388 | 1389 | 1390 | 1391 | 1393 | 1394 | 1395 | 1396 | 1398 | 1399 | 1400 | 1401 | 1402 | 1403 | 1404 | 1405 | 1406 | 1407 | 1408 | 1410 | 1411 | 1412 | 1413 | 1414 |

1415 |
1416 | 1417 | 1418 | 1419 | 1420 |
1421 |
1422 | 1423 | 1424 | 1425 | --------------------------------------------------------------------------------