├── Contributions ├── Athira.md ├── AthiraMNair.md ├── AthiraNair.md ├── Athiraa.md ├── Kiran.md ├── Yatharth.md ├── smaple1.md ├── Deepanshu.md ├── sample2.md ├── sid.md ├── Ankan002.md ├── chaitangarg.md ├── Subha.md ├── Sanju2.md ├── chandra.md ├── Muskan.md ├── Shivam ├── change.md ├── divigarg.md ├── Coder.md ├── MompatiPaso.md ├── Priyanka.md ├── Tamodip.md ├── Hash.md ├── Rohat.md ├── Ritik.md ├── kanishk.md ├── riti.md ├── Adesh.md ├── yash.md ├── Anubhav.md ├── Shuvam.md ├── Ayush.md ├── ayush.md ├── sahilsync07.md ├── Shrayansh.md ├── Tsemester.md ├── And-Rahul.md ├── Anubhavcp.md ├── Blankita21.md ├── Priyanshu.md ├── Saumil.md ├── tanya.md ├── kp-COD.md ├── sauravkumar.md ├── BlackMentor.md ├── manuja.md ├── tshirtsmine.md ├── ShubhamBhatt.md ├── abhilashkpy.md ├── Pranjit.md ├── giack-dev.md ├── iLorah.md ├── Max.md ├── PoorvaGupta.md ├── Priyanuj.md ├── OarabileMwiya.md ├── Akhil.md ├── Adi.md ├── Aditya.md ├── Kritidipta.md ├── Akhil_sv.md ├── Chandra_Prakash.md ├── Debarchan.md ├── roadmap.md ├── Aman.md ├── saurav.md ├── Ramanpreet.md ├── Alan.md ├── HarshUdai.md ├── Gaurav.md ├── Shubham.md ├── shubham.md ├── aryannigam.md ├── deelaka1019.md ├── buddhini.md ├── Maitri.md └── Vansh.md ├── mohitmishra.md ├── Anamika.md ├── Ashish.md ├── Harsha.md ├── Max_freq_char.py ├── Seive.py ├── Python program to transpose a matrix ├── binarySearch.c ├── nCr.cpp ├── First and Last Digit.c ├── SearchDemo.cpp ├── 2darray.cpp ├── FibonaciSeries.cpp ├── harsh.md ├── searchingamatrix.cpp ├── linkedlist.cpp ├── README.md ├── Prime String.py ├── matrixtranspose.cpp ├── Binary_search_algorithm.cpp ├── QueueCode.c ├── ReverseLinkedList.c ├── Search.h ├── matrixmultiplication.cpp ├── spiralordertraversal.cpp ├── matrixsearch.cpp ├── trie.cpp ├── merge_sort.py ├── sudoko.cpp └── Loading screen.html /Contributions/Athira.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Contributions/AthiraMNair.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Contributions/AthiraNair.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Contributions/Athiraa.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Contributions/Kiran.md: -------------------------------------------------------------------------------- 1 | Hello 2 | -------------------------------------------------------------------------------- /Contributions/Yatharth.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Contributions/smaple1.md: -------------------------------------------------------------------------------- 1 | sample PR 1 2 | -------------------------------------------------------------------------------- /Contributions/Deepanshu.md: -------------------------------------------------------------------------------- 1 | Code - TC and KP 2 | -------------------------------------------------------------------------------- /Contributions/sample2.md: -------------------------------------------------------------------------------- 1 | This PR is 2 pr. 2 | -------------------------------------------------------------------------------- /Contributions/sid.md: -------------------------------------------------------------------------------- 1 | what a wonderful world. 2 | -------------------------------------------------------------------------------- /Contributions/Ankan002.md: -------------------------------------------------------------------------------- 1 | My first hacktober fest..... -------------------------------------------------------------------------------- /Contributions/chaitangarg.md: -------------------------------------------------------------------------------- 1 | added a cpp file 2 | -------------------------------------------------------------------------------- /Contributions/Subha.md: -------------------------------------------------------------------------------- 1 | Thank you I'm learning a lot. 2 | -------------------------------------------------------------------------------- /Contributions/Sanju2.md: -------------------------------------------------------------------------------- 1 | Hey! 2 | I'm Lasantha, 3 | DevOps Trainee -------------------------------------------------------------------------------- /Contributions/chandra.md: -------------------------------------------------------------------------------- 1 | Initial commit 2 | Welcome to HacktoberFest -------------------------------------------------------------------------------- /Contributions/Muskan.md: -------------------------------------------------------------------------------- 1 | Cout<<"Hello.. everyone this is muskan..."; 2 | -------------------------------------------------------------------------------- /Contributions/Shivam: -------------------------------------------------------------------------------- 1 | Hello This is Shivam, 4rd year CSE From kanpur. 2 | -------------------------------------------------------------------------------- /Contributions/change.md: -------------------------------------------------------------------------------- 1 | Hacktobefest Is Op. 2 | Code - TC and Kp 3 | -------------------------------------------------------------------------------- /Contributions/divigarg.md: -------------------------------------------------------------------------------- 1 | Hacktoberfest is the best fest I ever did. 2 | -------------------------------------------------------------------------------- /Contributions/Coder.md: -------------------------------------------------------------------------------- 1 | Hello I am Your subscriber. 2 | Code - TC and KP 3 | -------------------------------------------------------------------------------- /Contributions/MompatiPaso.md: -------------------------------------------------------------------------------- 1 | Hello This Is Mompati Paso From Botswana 2 | -------------------------------------------------------------------------------- /Contributions/Priyanka.md: -------------------------------------------------------------------------------- 1 | Hello! I am Priyanka, I am new to open source. 2 | -------------------------------------------------------------------------------- /Contributions/Tamodip.md: -------------------------------------------------------------------------------- 1 | Hey! 2 | Tamodip here. 3 | Long live open source! 4 | -------------------------------------------------------------------------------- /Contributions/Hash.md: -------------------------------------------------------------------------------- 1 | Welcome to Hacktoberfest 2021 2 | Thats Amazing journey. 3 | -------------------------------------------------------------------------------- /mohitmishra.md: -------------------------------------------------------------------------------- 1 | Hello, Myself Mohit Mishra, I am currenlty a third year student. 2 | -------------------------------------------------------------------------------- /Contributions/Rohat.md: -------------------------------------------------------------------------------- 1 | Hello! Glad to be participating in this year's Hacktoberfest :) -------------------------------------------------------------------------------- /Contributions/Ritik.md: -------------------------------------------------------------------------------- 1 | Hello 2 | This is Ritik Singh, 3 | 2nd year CSE student at GCOEA 4 | -------------------------------------------------------------------------------- /Contributions/kanishk.md: -------------------------------------------------------------------------------- 1 | Hello My name is Kanishk and I am a new open Source Developer 2 | -------------------------------------------------------------------------------- /Contributions/riti.md: -------------------------------------------------------------------------------- 1 | Hey this is Riti . I would like to contribute to Hacktoberfest21 2 | -------------------------------------------------------------------------------- /Anamika.md: -------------------------------------------------------------------------------- 1 | # Hey I am Anamika Tiwari 2 |

My first contribution to Hacktoberfest 2021

3 | -------------------------------------------------------------------------------- /Ashish.md: -------------------------------------------------------------------------------- 1 | Welcome to the hacktoberfest 2021. 2 | let's get started 3 | I love Hacktoberfest. 4 | -------------------------------------------------------------------------------- /Contributions/Adesh.md: -------------------------------------------------------------------------------- 1 | Hello 2 | This is Adesh Pratap Singh, 3 | 2nd year CSE student at KIIT 4 | -------------------------------------------------------------------------------- /Contributions/yash.md: -------------------------------------------------------------------------------- 1 | Hello 2 | This is YASH RAJ MANI, 3 | 2nd year CSE student 4 | From INDIA 5 | -------------------------------------------------------------------------------- /Contributions/Anubhav.md: -------------------------------------------------------------------------------- 1 | Hello, 2 | This is Anubhav Singh, 3 | 3rd year undergraduate student of NIT Surat -------------------------------------------------------------------------------- /Contributions/Shuvam.md: -------------------------------------------------------------------------------- 1 |

Hello its me Shuvam

2 |

I am enjoying Hacktoberfest a lot.

3 | -------------------------------------------------------------------------------- /Contributions/Ayush.md: -------------------------------------------------------------------------------- 1 | Hi there, I am Ayush. 2 | Thanks Hacktoberfest for ogranising a such amezing event. 3 | -------------------------------------------------------------------------------- /Contributions/ayush.md: -------------------------------------------------------------------------------- 1 | Hi there, I am Ayush. 2 | Thanks Hacktoberfest for ogranising a such amezing event. 3 | -------------------------------------------------------------------------------- /Contributions/sahilsync07.md: -------------------------------------------------------------------------------- 1 | Hello, I am Sahil Kumar. 2 | Glad to be participating in this year's Hacktoberfest2021 :) -------------------------------------------------------------------------------- /Contributions/Shrayansh.md: -------------------------------------------------------------------------------- 1 | Hello this is Shrayansh Baunthiyal, 3rd year CSE student from MCKV Institute Of Engineering 2 | -------------------------------------------------------------------------------- /Contributions/Tsemester.md: -------------------------------------------------------------------------------- 1 | Hi This Is Tseme From University Of Botswana 2 | Welcome To Hactoberfest-2021 3 | Enjoy 4 | -------------------------------------------------------------------------------- /Contributions/And-Rahul.md: -------------------------------------------------------------------------------- 1 | Hello, I'm Rahul. 2 | I have added Sudoko.cpp file which is a sudoko solver code in c++ language. 3 | -------------------------------------------------------------------------------- /Contributions/Anubhavcp.md: -------------------------------------------------------------------------------- 1 | I am Anubhav, a begineer Backend developer. I am an Undergrad and in my first year of B.Tech CSE. 2 | -------------------------------------------------------------------------------- /Contributions/Blankita21.md: -------------------------------------------------------------------------------- 1 | This my first time participating in Hacktoberfest and this is so much fun. Also I'm learning a lot. 2 | -------------------------------------------------------------------------------- /Harsha.md: -------------------------------------------------------------------------------- 1 | hi my name is harshavardhan G 2 | this is my 1st hacktoberfest contribution 3 | hope to learn a lot in this event 4 | -------------------------------------------------------------------------------- /Contributions/Priyanshu.md: -------------------------------------------------------------------------------- 1 | Hello,hope you are doing well I am a beginner and attending hacktoberfest for increasing knowledge about it. 2 | -------------------------------------------------------------------------------- /Contributions/Saumil.md: -------------------------------------------------------------------------------- 1 | Hacktoberfest is an interesting event where learners can learn and create awesome projects with collaborations. 2 | -------------------------------------------------------------------------------- /Contributions/tanya.md: -------------------------------------------------------------------------------- 1 | Hello there! Lets support open source throughout october. 2 | This is my first time participating in Hacktoberfest. 3 | -------------------------------------------------------------------------------- /Contributions/kp-COD.md: -------------------------------------------------------------------------------- 1 | PR 1 for hacktoberfest
2 | PR 2 for hacktoberfest
3 | PR 3 for hacktoberfest
4 | PR 4 for hacktoberfest
5 | -------------------------------------------------------------------------------- /Contributions/sauravkumar.md: -------------------------------------------------------------------------------- 1 | Hello Everyone! 2 | My name is Saurav Kumar Currently in 3rd Year pursuing B> Tech CSE from Amity University Jharkhand. 3 | -------------------------------------------------------------------------------- /Contributions/BlackMentor.md: -------------------------------------------------------------------------------- 1 | 2 | WELCOME TO HACKTORBERFEST-2021 3 | 4 | This Is Blackmentor From The University Of Botswana 5 | 6 | Let the Hacking Bgein 7 | -------------------------------------------------------------------------------- /Contributions/manuja.md: -------------------------------------------------------------------------------- 1 | HacktoberFest ---> is conducted in October every year in support of Open Source Contributions by DigitalOcean. 2 | Happy Hacktoberfest. 3 | -------------------------------------------------------------------------------- /Contributions/tshirtsmine.md: -------------------------------------------------------------------------------- 1 | # Hacktoberfest 2021 2 | ## This my first time participating in Hacktoberfest and this is so much fun. Also I'm learning a lot. 3 | -------------------------------------------------------------------------------- /Contributions/ShubhamBhatt.md: -------------------------------------------------------------------------------- 1 | Hello Everyone! 2 | 3 | WELCOME TO HACKTOBERFEST 2021 4 | 5 | Contribute to open source projects and earn some swags. 6 | 7 | Enjoy! -------------------------------------------------------------------------------- /Contributions/abhilashkpy.md: -------------------------------------------------------------------------------- 1 | HacktoberFest ---> is conducted in October every year in support of Open Source Contributions by DigitalOcean. 2 | Happy Hacktoberfest. 3 | -------------------------------------------------------------------------------- /Contributions/Pranjit.md: -------------------------------------------------------------------------------- 1 | ##Hey I am Pranjit, I like to computers, so i have started learning basics of programming and hacktoberfest gives oppurtunites to learn more. 2 | -------------------------------------------------------------------------------- /Contributions/giack-dev.md: -------------------------------------------------------------------------------- 1 | ## Giack-dev here 2 | 3 | This is my first hacktoberfest ever and for now it has been a lot of fun 4 | 5 | 6 | 7 | ### HOPE YALL ENJOY IT 8 | -------------------------------------------------------------------------------- /Contributions/iLorah.md: -------------------------------------------------------------------------------- 1 | Hello 2 | I am a QA in video games learning to code in my spare time :) 3 | Have a nice day! My Twitter is @iLorahGaming if you want to say hello :) -------------------------------------------------------------------------------- /Contributions/Max.md: -------------------------------------------------------------------------------- 1 | Hi 2 | My name is Max Müller, i'm a beginner, any help is always welcome. 3 | I'm interested in learning and making friends that help me improve my knowledge. 4 | -------------------------------------------------------------------------------- /Contributions/PoorvaGupta.md: -------------------------------------------------------------------------------- 1 | Poorva Gupta 2 | created a pull request on reversing linked list in c language 3 | First time contributing in open source... hope to have a beautifull journey. -------------------------------------------------------------------------------- /Contributions/Priyanuj.md: -------------------------------------------------------------------------------- 1 | Hi, Myself priyanuj and I participated in hacktoberfest 2020 and loved the T-shirt. Its a great innovative awarness among young minds for open source and will create great programmers... 2 | -------------------------------------------------------------------------------- /Contributions/OarabileMwiya.md: -------------------------------------------------------------------------------- 1 | WELCOME TO HACKTORBERFEST 2 | 3 | Hacktoberfest is a celebration open to everyone in our global community. It is a month-long celebration of open source software run by DigitalOcean. 4 | 5 | ENJOY 6 | -------------------------------------------------------------------------------- /Contributions/Akhil.md: -------------------------------------------------------------------------------- 1 | ### Hacktoberfest 2021 2 | Hacktoberfest is fest to invite open source contributers and act as an initiative to promote open source contributions. 3 | It is a 1-month fest for all developers and programmers. 4 | -------------------------------------------------------------------------------- /Contributions/Adi.md: -------------------------------------------------------------------------------- 1 | Hello everyone, 2 | 3 | Positives of open source: 4 | 1. Great opportunity to learn development. 5 | 2. Becomes great bug finder. 6 | 3. Get solution to various problems around the world 7 | 4. Great salary if worked hard 8 | 9 | -------------------------------------------------------------------------------- /Contributions/Aditya.md: -------------------------------------------------------------------------------- 1 | Hello there! 2 | I am Aditya Pandey. 3 | I am currently in my class 10 and damn boards are coming and I am scared. 4 | This is the first time I am contributing in hacktoberfest. 5 | It's a wonderfull event to create awarness about opensource projects. 6 | -------------------------------------------------------------------------------- /Contributions/Kritidipta.md: -------------------------------------------------------------------------------- 1 | Hello, I am Kritidipta Ghosh, a participant of hactoberfest 2021. I am adding all 2 | search algorithms to your repo in a header file and also adding searchdemo.cpp to 3 | test that header file naming "Search.h". 4 | 5 | Making a pull request for that. This is my first PR. -------------------------------------------------------------------------------- /Max_freq_char.py: -------------------------------------------------------------------------------- 1 | from collections import Counter 2 | test_string = "Hacktoberfest Lets Hack" 3 | print ("The original string is : " + test_string) 4 | res = Counter(test_string) 5 | res = max(res, key = res.get) 6 | print ("The maximum of all characters inHacktoberfest Lets Hack is : " + str(res)) 7 | -------------------------------------------------------------------------------- /Seive.py: -------------------------------------------------------------------------------- 1 | from math import * 2 | 3 | 4 | n = int(input()) 5 | 6 | pr = [True](n+1) 7 | pr[0] = False 8 | pr[1] = False 9 | 10 | for i in range(2,int(sqrt(n))): 11 | if pr[i]== True : 12 | for j in range(i*i,n+1,i): 13 | pr[j]= False 14 | 15 | for i in range(0,len(pr)): 16 | if pr[i] == True: 17 | print(i) 18 | 19 | -------------------------------------------------------------------------------- /Python program to transpose a matrix: -------------------------------------------------------------------------------- 1 | # Program to transpose a matrix using a nested loop 2 | 3 | X = [[12,7], 4 | [4 ,5], 5 | [3 ,8]] 6 | 7 | result = [[0,0,0], 8 | [0,0,0]] 9 | 10 | # iterate through rows 11 | for i in range(len(X)): 12 | # iterate through columns 13 | for j in range(len(X[0])): 14 | result[j][i] = X[i][j] 15 | 16 | for r in result: 17 | print(r) 18 | -------------------------------------------------------------------------------- /binarySearch.c: -------------------------------------------------------------------------------- 1 | #include 2 | int binarySearch(int A[],int low,int high,int target) 3 | { 4 | while(low<=high) 5 | { 6 | int mid=(low+high)/2; 7 | if(A[mid]target) 12 | { 13 | high=mid-1; 14 | } 15 | else{ 16 | return mid; 17 | } 18 | } 19 | return -1; 20 | } -------------------------------------------------------------------------------- /nCr.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int binomialCoeff(int n, int k) 5 | { 6 | if (k > n) 7 | return 0; 8 | if (k == 0 || k == n) 9 | return 1; 10 | 11 | return binomialCoeff(n - 1, k - 1) 12 | + binomialCoeff(n - 1, k); 13 | } 14 | 15 | 16 | int main() 17 | { 18 | int n = 5, k = 2; 19 | cout << "Value of C(" << n << ", " << k << ") is " 20 | << binomialCoeff(n, k); 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /First and Last Digit.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main(void) 3 | { 4 | int N,T,i,LastNum,FirstNum; 5 | scanf("%d",&T); 6 | for(i=0;i=0; j--){ 21 | cout< 2 | using namespace std; 3 | void printFibonacci(int num){ 4 | static int num1=0, num2=1, num3; 5 | if(num>0){ 6 | num3 = num1 + num2; 7 | num1 = num2; 8 | num2 = num3; 9 | cout<>num; 17 | cout<<"Fibonacci Series: "; 18 | cout<<"0 "<<"1 "; 19 | printFibonacci(num-2); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Contributions/saurav.md: -------------------------------------------------------------------------------- 1 | What is Hacktoberfest ? 2 | Hacktoberfest is a month-long challenge. It happens every year in the month of October. 3 | Hacktoberfest is open to everyone and it marks the celebration of Open Source. It's the biggest Open Source event that encourages newbies to participate in Open Source and create their 1st meaningful PR. 4 | 5 | If you wish to know about it in detail, you can refer to this video, where I have covered everything. 6 | 7 | How does it work? 8 | Maintainers determine if their open-source projects participate. 9 | Quality pull requests submitted on GitHub and GitLab are rewarded. 10 | Engaged maintenance of Hacktoberfest tagged repositories are rewarded. 11 | 12 | -------------------------------------------------------------------------------- /harsh.md: -------------------------------------------------------------------------------- 1 | //A code example for tmeplate. 2 | #include 3 | using namespace std; 4 | 5 | template 6 | class student{ 7 | public: 8 | t1 name; 9 | t2 marks; 10 | t3 attendance; 11 | student(t1 a,t2 b, t3 c){ 12 | name = a; 13 | marks = b; 14 | attendance = c; 15 | } 16 | void display(){ 17 | cout<<"name of student is: "<marks<<" marks and his attendance is "<marks or only marks are same thing here. 19 | }; 20 | 21 | int main() 22 | { 23 | student obj("harsh",95,85.5); 24 | obj.display(); 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /Contributions/Ramanpreet.md: -------------------------------------------------------------------------------- 1 | 2 | ## It’s Hacktoberfest Time! 3 | 4 | It’s the third day of October, we have enough time to submit a pull request and start contributing to open source community.
In general, I think it’s actually quite cool because it allows a lot of people from different backgrounds to join and work together. In my case, I got to know about this fest from a friend of mine. So I decided to give it a try...
5 | ### Here’s what you need to do:
6 | • Register for Hacktoberfest
7 | • Find a project that interests you and jump in!
8 | • After you’ve done the work, submit a pull request.
9 | • Similarly, one has to submit 4 PR's 10 |

11 | ### All the best and Happy coding!!! 12 | -------------------------------------------------------------------------------- /searchingamatrix.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(){ 4 | int n,m; 5 | cin>>n>>m; 6 | int arr[n][m]; 7 | for(int i=0;i>arr[i][j]; 10 | } 11 | } 12 | int x; 13 | cin>>x; 14 | bool flag=false; 15 | int i,j; 16 | for( i=0;i 2 | #include 3 | using namespace std; 4 | 5 | class node 6 | { 7 | public: 8 | int data; 9 | node *next; 10 | } *head = NULL; 11 | 12 | void Insert_At_Tail(node **head_ref, int value) 13 | { 14 | node *new_node; 15 | new_node = new node; 16 | new_node->data = value; 17 | new_node->next = (*head_ref); 18 | (*head_ref) = new_node; 19 | } 20 | 21 | void Display(node*t) 22 | { 23 | while(t!=NULL) 24 | { 25 | cout<data<<" "; 26 | t = t->next; 27 | } 28 | } 29 | int main() 30 | { 31 | Insert_At_Tail(&head,10); 32 | Insert_At_Tail(&head,20); 33 | Insert_At_Tail(&head,30); 34 | 35 | Display(head); 36 | return 0; 37 | } -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # [Hacktoberfest-2021] 2 | This repo will consist merge from the all participants of hacktoberfest powered by DigitalOcean. 3 | 4 | **Please Note that this project has been excluded from hacktoberfest on 5th Oct 2021. 5 | You guys can make PRs on other pinned repositories.** 6 | 7 | 8 | # Steps for entries: 9 | 10 | 1. create a .md file inside **Contributors folder** as given yourname.md and raised pull request. 11 | 2. yourname.md may contain any messages like a message or a greetings or your thoughts about Hactoberfest.

12 | 13 | 14 | 15 | **PS: If anyone wants to contribute in my projects, you guys are welcomed 16 | You can select any repository, I will accept all appropriate changes.** 17 | 18 | 19 | Thanks, Let's hack. 20 | 21 | Feel free to contribute 🚀 22 | -------------------------------------------------------------------------------- /Contributions/Alan.md: -------------------------------------------------------------------------------- 1 | Hacktoberfest is a celebration open to everyone in our global community. It is a month-long celebration of open source software run by DigitalOcean. 2 | 3 | Seven years ago, Hacktoberfest had kick-started the celebration along with 676 excited participants contributing to open source projects and earning a limited-edition T-shirt. Now, hundreds of thousands of developers participate in Hacktoberfest from 150 countries. 4 | 5 | If you want to contribute to open-source projects, but don't know where to start, Then Hacktoberfest is the perfect opportunity for you. 6 | 7 | If you complete 4prs valid, you get a T-shirt, some stickers, a cup coaster 8 | 9 | The goal of the event is to encourage participation in the open-source community all across the globe. And the challenge is quite simple. Open four high-quality pull requests in October on any open source project to get some swags. 10 | -------------------------------------------------------------------------------- /Prime String.py: -------------------------------------------------------------------------------- 1 | ''' Read input from STDIN. Print your output to STDOUT ''' 2 | #Use input() to read input from STDIN and use print to write your output to STDOUT 3 | 4 | def main(): 5 | T = int(input()) 6 | for i in range(T): 7 | k = input() 8 | Esum = 0 9 | Osum = 0 10 | AD = 0 11 | counter = 0 12 | for j in k: 13 | print(ord(j)) 14 | if counter%2 == 0 : 15 | Esum += ord(j) 16 | else: 17 | Osum += ord(j) 18 | 19 | counter +=1 20 | 21 | if ((Esum - Osum) < 0 ): 22 | AD = Osum - Esum 23 | else: 24 | AD = Esum - Osum 25 | 26 | if ( AD%3 == 0 or AD%5 == 0 or AD%7 == 0 ): 27 | print("Prime String") 28 | 29 | else: 30 | print("Casual String") 31 | 32 | main() 33 | 34 | -------------------------------------------------------------------------------- /matrixtranspose.cpp: -------------------------------------------------------------------------------- 1 | //given a sq matrix a and its number of rows/columns return the transpose of A . the transpose matrix is the matrix flippped over its main diagonal , switching the row and column indices of matrix. 2 | // 123 147 3 | // 456 258 4 | // 789 369 5 | //swap row,coll=col,row 6 | #include 7 | using namespace std; 8 | int main(){ 9 | int n,m; 10 | cin>>n>>m; 11 | int arr[n][m]; 12 | for(int i=0;i>arr[i][j]; 15 | } 16 | } 17 | 18 | for(int i=0;i 2 | using namespace std; 3 | int main() 4 | { 5 | int search(int [],int,int); 6 | int n,i,a[100],e,res; 7 | cout<<"How Many Elements:"; 8 | cin>>n; 9 | cout<<"\nEnter Elements of Array in Ascending order\n"; 10 | 11 | for(i=0;i>a[i]; 14 | } 15 | 16 | cout<<"\nEnter element to search:"; 17 | cin>>e; 18 | 19 | res=search(a,n,e); 20 | 21 | if(res!=-1) 22 | cout<<"\nElement found at position "<a[m]) 40 | f=m+1; 41 | else 42 | l=m-1; 43 | } 44 | 45 | return -1; 46 | } -------------------------------------------------------------------------------- /QueueCode.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | struct queue{ 4 | int size; 5 | int f; 6 | int r; 7 | int *arr; 8 | }; 9 | 10 | void enqueue(struct queue *q,int value) 11 | { 12 | if(isFull(q)) 13 | { 14 | printf("this Queue is Full"); 15 | } 16 | else 17 | { 18 | q->r=q->r+1; 19 | q->arr[q->r]=value; 20 | } 21 | } 22 | 23 | int isFull(struct queue *q) 24 | { 25 | if(q->r==q->size-1) 26 | return -1; 27 | return 0; 28 | } 29 | 30 | int isEmpty(struct queue *q) 31 | { 32 | if(q->f==q->r) 33 | return 1; 34 | return 0; 35 | } 36 | int dequeue(struct queue *q) 37 | { 38 | int a=-1; 39 | if(isEmpty(q)) 40 | { 41 | printf("This Queue is Empty"); 42 | } 43 | else 44 | { 45 | q->f++; 46 | q=q->arr[q->f]; 47 | } 48 | return a; 49 | } 50 | int main() 51 | { 52 | struct queue q; 53 | q.size=100; 54 | q.f=q.r=-1; 55 | q.arr=(int *)malloc(q.size*sizeof(int)); 56 | enqueue(&q,12); 57 | enqueue(&q,5); 58 | printf("Dequeuing element %d",dequeue(&q)); 59 | } 60 | 61 | -------------------------------------------------------------------------------- /Contributions/HarshUdai.md: -------------------------------------------------------------------------------- 1 | # This is the solution of finding the cycle in linked list, O(n) time and O(1) space. 2 | # Hacktoberfest is the best way to start contributing to open source, in this one month there are various learning likes git, github, project contribution, skill set exercise. 3 | # contributor: harsh udai 4 | 5 | # Definition for singly-linked list. 6 | # class ListNode: 7 | # def __init__(self, x): 8 | # self.val = x 9 | # self.next = None 10 | 11 | class Solution: 12 | def hasCycle(self, head: ListNode) -> bool: 13 | 14 | if(head==None or head.next==None): 15 | return False 16 | 17 | elif(head==head.next): 18 | return True 19 | 20 | slow = head 21 | fast = head.next 22 | 23 | while(slow!=None and fast!=None): 24 | if(slow==fast): 25 | return True 26 | 27 | else: 28 | slow=slow.next 29 | if(slow.next==None or fast.next==None): 30 | return False 31 | fast=fast.next.next 32 | 33 | return False 34 | 35 | -------------------------------------------------------------------------------- /ReverseLinkedList.c: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | #include 4 | struct node{ 5 | int data; 6 | struct node * next; 7 | }; 8 | void Listtraversal(struct node *ptr) 9 | { 10 | while(ptr!=NULL) 11 | { 12 | printf("%d ",ptr->data); 13 | ptr=ptr->next; 14 | } 15 | 16 | } 17 | 18 | void function1(struct node* head) 19 | { 20 | if(head == NULL) 21 | return; 22 | 23 | function1(head->next); 24 | printf("%d ", head->data); 25 | } 26 | 27 | int main() 28 | { 29 | struct node *head; 30 | struct node *second; 31 | struct node *third; 32 | struct node *fourth; 33 | struct node *fifth; 34 | 35 | head= (struct node *)malloc(sizeof(struct node*)); 36 | second=(struct node*)malloc(sizeof(struct node*)); 37 | third=(struct node*)malloc(sizeof(struct node *)); 38 | fourth=(struct node *)malloc(sizeof(struct node *)); 39 | fifth=(struct node*)malloc(sizeof(struct node)); 40 | head->data=7; 41 | head->next=second; 42 | second->data=3; 43 | second->next=third; 44 | third->data=8; 45 | third->next=fourth; 46 | fourth->data=9; 47 | fourth->next=fifth; 48 | fifth->data=1; 49 | fifth->next=NULL; 50 | Listtraversal(head); 51 | 52 | printf(" \nthe reverse Linked List is - \n"); 53 | function1(head); 54 | 55 | } -------------------------------------------------------------------------------- /Search.h: -------------------------------------------------------------------------------- 1 | #ifndef _SEARCH_H_ 2 | #define _SEARCH_H_ 3 | 4 | #include 5 | 6 | template int linearSearch(T arr[], int l, int r, const T& val){ 7 | for(int i = 0; i <= r; i++){ 8 | if(val == arr[i]) return i; 9 | } 10 | return -1; 11 | } 12 | 13 | template int binarySearch(T arr[], int l, int r, const T& val, bool recursive = true){ 14 | if(val < arr[l] || val > arr[r]) return -1; 15 | if(recursive){ //recursive method 16 | int m = (r + l) / 2; 17 | if(val < arr[m]) return binarySearch(arr, l, m-1, val); 18 | if(val > arr[m]) return binarySearch(arr, m+1, r, val); 19 | return m; 20 | } 21 | else{ //iterative method 22 | while(l <= r){ 23 | int m = (r + l) / 2; 24 | if(val < arr[m]) r = m-1; 25 | else if(val > arr[m]) l = m+1; 26 | else return m; 27 | } 28 | } 29 | } 30 | 31 | template int interpolationSearch(T arr[], int l, int r, const T& val){ 32 | if(val < arr[l] || val > arr[r]) return -1; 33 | int m = l + ((val - arr[l])*(r-l) / (arr[r] - arr[l])); 34 | if(val > arr[m]) return interpolationSearch(arr, m+1, r, val); 35 | else if(val < arr[m]) return interpolationSearch(arr, l, m-1, val); 36 | return m; 37 | } 38 | #endif 39 | -------------------------------------------------------------------------------- /matrixmultiplication.cpp: -------------------------------------------------------------------------------- 1 | //given 2 arrays n1xn2 and n2xn3 and multiply matrix 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int n1, n2, n3; 7 | cin >> n1 >> n2 >> n3; 8 | int arr1[n1][n2]; 9 | for (int i = 0; i < n1; i++) 10 | { 11 | for (int j = 0; j < n2; j++) 12 | { 13 | cin >> arr1[i][j]; 14 | } 15 | } 16 | int arr2[n2][n3]; 17 | for (int i = 0; i < n2; i++) 18 | { 19 | for (int j = 0; j < n3; j++) 20 | { 21 | cin >> arr2[i][j]; 22 | } 23 | } 24 | int ans[n1][n3]; 25 | for (int i = 0; i < n1; i++) 26 | { 27 | for (int j = 0; j < n3; j++) 28 | { 29 | ans[i][j]=0; 30 | } 31 | } 32 | 33 | for (int i = 0; i < n1; i++) 34 | { 35 | for (int j = 0; j < n3; j++) 36 | { 37 | for (int k = 0; k < n2; k++) 38 | { 39 | ans[i][j]+=arr1[i][k]*arr2[k][j]; 40 | } 41 | } 42 | } 43 | 44 | for (int i = 0; i < n1; i++) 45 | { 46 | for (int j = 0; j < n3; j++) 47 | { 48 | cout< 2 | using namespace std; 3 | int main(){ 4 | int n,m; 5 | cin>>n>>m; 6 | int arr[n][m]; 7 | for(int i=0;i>arr[i][j]; 10 | } 11 | } 12 | 13 | //spiral order print 14 | int row_start=0; 15 | int row_end=n-1; 16 | int column_start=1; 17 | int column_end=m-1; 18 | 19 | while(row_start<=row_end &&column_start<=column_end){ 20 | //for row start 21 | for(int col=column_start ;col<=column_end;col++){ 22 | cout<=row_start;row--){ 37 | cout< 5 | using namespace std; 6 | int main() 7 | { 8 | int n, m; 9 | cin >> n >> m; 10 | int key; 11 | cin >> key; 12 | int arr[n][m]; 13 | for (int i = 0; i < n; i++) 14 | { 15 | for (int j = 0; j < m; j++) 16 | { 17 | cin >> arr[i][j]; 18 | } 19 | } 20 | 21 | int r=0,c=m-1; 22 | bool flag=false; 23 | while (r=0){ 24 | if (arr[r][c] == key) 25 | { 26 | flag=true; 27 | break; 28 | } 29 | 30 | else if (arr[r][c] > key) 31 | { 32 | c--; 33 | } 34 | else{ 35 | r++; 36 | } 37 | } 38 | if(flag){ 39 | cout<<"element found"< 2 | using namespace std; 3 | 4 | struct trie{ 5 | struct trie* child[26]; 6 | bool is_end; 7 | trie(){ 8 | memset(child,0,sizeof(child)); 9 | is_end=false; 10 | } 11 | }; 12 | 13 | struct trie* root; 14 | //inserts a word to the trie 15 | void insert(string s){ 16 | struct trie* temp=root; 17 | //traverses over each character 18 | //if the character already exists then it simply iterates over 19 | //otherwise creates a new node and inserts the character 20 | for(char c: s){ 21 | if(!temp->child[c-'a']) 22 | temp->child[c-'a']=new trie; 23 | temp=temp->child[c-'a']; 24 | } 25 | //sets the last letter's boolean value to true 26 | temp->is_end=true; 27 | } 28 | //returns true if the word exists, false otherwise 29 | bool check(string s){ 30 | struct trie* temp=root; 31 | //iterates over the character of the word 32 | for(char c: s){ 33 | //if at any point the char of the word being check is not found it return false 34 | if(!temp->child[c-'a']) 35 | return false; 36 | temp=temp->child[c-'a']; 37 | } 38 | //returns the last letters boolean value 39 | return temp->is_end; 40 | } 41 | 42 | int main(){ 43 | ios_base::sync_with_stdio(false); 44 | cin.tie(NULL); 45 | root=new trie; 46 | int n; 47 | cout << "Input the number of words in the List" << endl; 48 | cin >> n; 49 | string word; 50 | cout<<"Enter the words"<> word ; 54 | insert(word); 55 | } 56 | cout << "Enter the number of words you want to check exist in the List" << endl; 57 | int m; 58 | cin >> m; 59 | //the words to be checked 60 | for(int i=0; i> word ; 62 | if(check(word)) 63 | cout<< "This word exist in the list" < 13 |

14 | shubhamsingh748 15 |

16 | 17 | 18 | 19 | 20 |

Languages and Tools:

21 |

c cplusplus docker git java kubernetes linux

22 | 23 |

 shubham-singh-748

24 |

shubham-singh-748

25 | 26 | -------------------------------------------------------------------------------- /Contributions/shubham.md: -------------------------------------------------------------------------------- 1 | # Hey 👋, Myself [Shubham Singh!](https://github.com/shubham-singh-748) 2 | 3 | 4 | ## About Me 🚀 5 | * I’m an Open-Source enthusiast & a junior pursuing my Bachelors in Computer Science & Engineering. 6 | * I am passionate about Kubernetes, Web Dev, Machine Learning, DevOps & I enjoy learning new things. 7 | 8 | 9 | ## 🔗 Links 10 | [![linkedin](https://img.shields.io/badge/linkedin-0A66C2?style=for-the-badge&logo=linkedin&logoColor=white)](https://www.linkedin.com/in/shubham-kumar-92906b20a/) 11 | [![twitter](https://img.shields.io/badge/twitter-1DA1F2?style=for-the-badge&logo=twitter&logoColor=white)](https://twitter.com/RajputShubbu108) 12 |

13 |

14 | shubhamsingh748 15 |

16 | 17 | 18 | 19 | 20 |

Languages and Tools:

21 |

c cplusplus docker git java kubernetes linux

22 | 23 |

 shubham-singh-748

24 |

shubham-singh-748

25 | 26 | -------------------------------------------------------------------------------- /Contributions/aryannigam.md: -------------------------------------------------------------------------------- 1 |

Hey there! I'm Aryan.

2 | 3 |

👨🏻‍💻  About Me

4 | 5 | - 🎓   Studying Computer Science and Engineering at Oriental Institute of Science and Technology, Bhopal. 6 | 7 | - 🤔   Exploring new technologies, travelling new places, bike riding. 8 | 9 | - 🌱   Learning more about ReactJS, React Native and MERN Stack. 10 | - ✍️   Hobby - Cricket 11 | 12 |

🛠  Tech Stack

13 | 14 | - 💻   15 | ![C](https://img.shields.io/badge/-c?style=flat&logo=c) 16 | ![Java](https://img.shields.io/badge/-Java-333333?style=flat&logo=Java&logoColor=007396) 17 | 18 | - 🌐   19 | ![HTML5](https://img.shields.io/badge/-HTML5-333333?style=flat&logo=HTML5) 20 | ![CSS](https://img.shields.io/badge/-CSS-333333?style=flat&logo=CSS3&logoColor=1572B6) 21 | ![JavaScript](https://img.shields.io/badge/-JavaScript-333333?style=flat&logo=javascript) 22 | ![Node.js](https://img.shields.io/badge/-Node.js-333333?style=flat&logo=node.js) 23 | ![React](https://img.shields.io/badge/-React-333333?style=flat&logo=react) 24 | - 🛢   25 | ![MongoDB](https://img.shields.io/badge/-MongoDB-333333?style=flat&logo=mongodb) 26 | ![MySQL](https://img.shields.io/badge/-MySql-333333?style=flat&logo=mysql) 27 | - ⚙️   28 | ![Git](https://img.shields.io/badge/-Git-333333?style=flat&logo=git) 29 | ![GitHub](https://img.shields.io/badge/-GitHub-333333?style=flat&logo=github) 30 | ![Markdown](https://img.shields.io/badge/-Markdown-333333?style=flat&logo=markdown) 31 | - 🔧   32 | ![Visual Studio Code](https://img.shields.io/badge/-Visual%20Studio%20Code-333333?style=flat&logo=visual-studio-code&logoColor=007ACC) 33 | ![Eclipse](https://img.shields.io/badge/-Eclipse-333333?style=flat&logo=eclipse-ide&logoColor=2C2255) 34 | 35 | 36 |
37 | 38 | 39 | 40 | 41 | 42 | 43 |
44 | 45 |

🤝🏻  Connect with Me

46 | 47 |

48 | LinkedIn 49 | Instagram 50 | Email 51 |

52 | 53 | ⭐️ From [nigamji](https://github.com/nigamji) 54 | -------------------------------------------------------------------------------- /sudoko.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | #define UNASSIGNED 0 4 | #define N 9 5 | bool FindUnassignedLocation(int grid[N][N], 6 | int& row, int& col); 7 | 8 | bool isSafe(int grid[N][N], int row, 9 | int col, int num); 10 | 11 | bool SolveSudoku(int grid[N][N]) 12 | { 13 | int row, col; 14 | if (!FindUnassignedLocation(grid, row, col)) 15 | // success! 16 | return true; 17 | for (int num = 1; num <= 9; num++) 18 | { 19 | 20 | // Check if looks promising 21 | if (isSafe(grid, row, col, num)) 22 | { 23 | 24 | // Make tentative assignment 25 | grid[row][col] = num; 26 | 27 | // Return, if success 28 | if (SolveSudoku(grid)) 29 | return true; 30 | 31 | // Failure, unmake & try again 32 | grid[row][col] = UNASSIGNED; 33 | } 34 | } 35 | return false; 36 | } 37 | bool FindUnassignedLocation(int grid[N][N], 38 | int& row, int& col) 39 | { 40 | for (row = 0; row < N; row++) 41 | for (col = 0; col < N; col++) 42 | if (grid[row][col] == UNASSIGNED) 43 | return true; 44 | return false; 45 | } 46 | bool UsedInRow(int grid[N][N], int row, int num) 47 | { 48 | for (int col = 0; col < N; col++) 49 | if (grid[row][col] == num) 50 | return true; 51 | return false; 52 | } 53 | 54 | bool UsedInCol(int grid[N][N], int col, int num) 55 | { 56 | for (int row = 0; row < N; row++) 57 | if (grid[row][col] == num) 58 | return true; 59 | return false; 60 | } 61 | 62 | bool UsedInBox(int grid[N][N], int boxStartRow, 63 | int boxStartCol, int num) 64 | { 65 | for (int row = 0; row < 3; row++) 66 | for (int col = 0; col < 3; col++) 67 | if (grid[row + boxStartRow] 68 | [col + boxStartCol] == 69 | num) 70 | return true; 71 | return false; 72 | } 73 | 74 | bool isSafe(int grid[N][N], int row, 75 | int col, int num) 76 | { 77 | return !UsedInRow(grid, row, num) 78 | && !UsedInCol(grid, col, num) 79 | && !UsedInBox(grid, row - row % 3, 80 | col - col % 3, num) 81 | && grid[row][col] == UNASSIGNED; 82 | } 83 | void printGrid(int grid[N][N]) 84 | { 85 | for (int row = 0; row < N; row++) 86 | { 87 | for (int col = 0; col < N; col++) 88 | cout << grid[row][col] << " "; 89 | cout << endl; 90 | } 91 | } 92 | 93 | // Driver Code 94 | int main() 95 | { 96 | // 0 means unassigned cells 97 | int grid[N][N] = { { 3, 0, 6, 5, 0, 8, 4, 0, 0 }, 98 | { 5, 2, 0, 0, 0, 0, 0, 0, 0 }, 99 | { 0, 8, 7, 0, 0, 0, 0, 3, 1 }, 100 | { 0, 0, 3, 0, 1, 0, 0, 8, 0 }, 101 | { 9, 0, 0, 8, 6, 3, 0, 0, 5 }, 102 | { 0, 5, 0, 0, 9, 0, 6, 0, 0 }, 103 | { 1, 3, 0, 0, 0, 0, 2, 5, 0 }, 104 | { 0, 0, 0, 0, 0, 0, 0, 7, 4 }, 105 | { 0, 0, 5, 2, 0, 6, 3, 0, 0 } }; 106 | if (SolveSudoku(grid) == true) 107 | printGrid(grid); 108 | else 109 | cout << "No solution exists"; 110 | 111 | return 0; 112 | } 113 | 114 | -------------------------------------------------------------------------------- /Contributions/deelaka1019.md: -------------------------------------------------------------------------------- 1 | # Cross-platform mobile application development technologies 2 | 3 | | Language or Technology | Description | 4 | | ------------- | ------------- | 5 | | [React Native](https://reactnative.dev/) | React Native is an open-source UI software framework created by Facebook, Inc. It is used to develop applications for Android, Android TV, iOS, macOS, tvOS, Web, Windows and UWP by enabling developers to use the React framework along with native platform capabilities. | 6 | | [Flutter](https://flutter.dev/) | Flutter is an open-source UI software development kit created by Google. It is used to develop cross platform applications for Android, iOS, Linux, Mac, Windows, Google Fuchsia, and the web from a single codebase. First described in 2015, Flutter was released in May 2017. | 7 | | [Ionic](https://ionicframework.com/) | An open source mobile toolkit for building high quality, cross-platform native and web app experiences. Move faster with a single code base, running everywhere with JavaScript and the Web. | 8 | | [NativeScript](https://nativescript.org/) | NativeScript is an open-source framework to develop mobile apps on the Apple iOS and Android platforms. Empower JavaScriptwith native APIs. Liberate your development by using platform APIs directly without leaving of JavaScript. | 9 | | [Cordova](https://cordova.apache.org/) | Apache Cordova is a mobile application development framework created by Nitobi. Cordova wraps your HTML/JavaScript app into a native container which can access the device functions of several platforms. These functions are exposed via a unified JavaScript API, allowing you to easily write one set of code to target nearly every phone or tablet on the market today and publish to their app stores. | 10 | 11 | # Frontend Frameworks 12 | 13 | | Website | Description | 14 | | ------------- | ------------- | 15 | |[Angular](https://angular.io/) | AngularJS is a JavaScript-based open-source front-end web framework mainly maintained by Google and by a community | 16 | |[VueJs](https://v3.vuejs.org/) | VueJs is a progressive framework for building user interfaces. It is perfectly capable of powering sophisticated Single-Page Applications | 17 | |[React](https://reactjs.org/) | ReactJS is an open-source front-end JavaScript library for building user interfaces or UI components | 18 | |[Ember](https://emberjs.com//) | Ember.js is a productive, battle-tested JavaScript framework for building modern web applications. It includes everything you need to build rich UIs that work on any device. | 19 | |[Backbone.js](https://backbonejs.org/) | Backbone is a JavaScript framework based on MVC architecture for building single page applications | 20 | |[Aurelia](https://aurelia.io/) | Aurelia's standards-based, unobtrusive style makes it the only framework that empowers you to build components using vanilla JavaScript or TypeScript. If you know modern JS and HTML, there's little more to learn to build even the most complex apps. | 21 | [Svelte](https://svelte.dev/) | Svelte is a radical new approach to designing user interfaces. Whereas conventional frameworks like React and Vue do the bulk of their work in the browser, Svelte transfers the work to a compile phase the happens when you create your app. Instead of using strategies such as virtual DOM diffing, Svelte writes code that surgically updates the DOM when the state of your app changes. | 22 | |[Preact](https://preactjs.com/) | Preact offers the finest possible abstraction of Virtual DOM at the top of the DOM. Builds on stable platform functionality, registers real event handlers, and plays nicely with other libraries. Preact can be used directly in the browser without any transpiring steps. | 23 | -------------------------------------------------------------------------------- /Contributions/buddhini.md: -------------------------------------------------------------------------------- 1 | # Natural Language Processing (NLP) 2 | 3 | ## What is natural language processing? 4 | 5 | Natural language processing (NLP) refers to the branch of computer science—and more specifically, the branch of artificial intelligence or AI—concerned with giving computers the ability to understand text and spoken words in much the same way human beings can. 6 | 7 | NLP combines computational linguistics—rule-based modeling of human language—with statistical, machine learning, and deep learning models. Together, these technologies enable computers to process human language in the form of text or voice data and to ‘understand’ its full meaning, complete with the speaker or writer’s intent and sentiment. 8 | 9 | NLP drives computer programs that translate text from one language to another, respond to spoken commands, and summarize large volumes of text rapidly—even in real time. There’s a good chance you’ve interacted with NLP in the form of voice-operated GPS systems, digital assistants, speech-to-text dictation software, customer service chatbots, and other consumer conveniences. But NLP also plays a growing role in enterprise solutions that help streamline business operations, increase employee productivity, and simplify mission-critical business processes. 10 | 11 | ## NLP tasks 12 | 13 | Human language is filled with ambiguities that make it incredibly difficult to write software that accurately determines the intended meaning of text or voice data. Homonyms, homophones, sarcasm, idioms, metaphors, grammar and usage exceptions, variations in sentence structure—these just a few of the irregularities of human language that take humans years to learn, but that programmers must teach natural language-driven applications to recognize and understand accurately from the start, if those applications are going to be useful. 14 | 15 | Several NLP tasks break down human text and voice data in ways that help the computer make sense of what it's ingesting. Some of these tasks include the following: 16 | 17 | ### Speech recognition 18 | Also called speech-to-text, is the task of reliably converting voice data into text data. Speech recognition is required for any application that follows voice commands or answers spoken questions. What makes speech recognition especially challenging is the way people talk—quickly, slurring words together, with varying emphasis and intonation, in different accents, and often using incorrect grammar. 19 | 20 | ### Part of speech tagging 21 | Also called grammatical tagging, is the process of determining the part of speech of a particular word or piece of text based on its use and context. Part of speech identifies ‘make’ as a verb in ‘I can make a paper plane,’ and as a noun in ‘What make of car do you own?’ 22 | 23 | ### Word sense disambiguation 24 | The selection of the meaning of a word with multiple meanings through a process of semantic analysis that determine the word that makes the most sense in the given context. For example, word sense disambiguation helps distinguish the meaning of the verb 'make' in ‘make the grade’ (achieve) vs. ‘make a bet’ (place). 25 | 26 | ### Named entity recognition, or NEM 27 | Identifies words or phrases as useful entities. NEM identifies ‘Kentucky’ as a location or ‘Fred’ as a man's name. 28 | 29 | ### Co-reference resolution 30 | The task of identifying if and when two words refer to the same entity. The most common example is determining the person or object to which a certain pronoun refers (e.g., ‘she’ = ‘Mary’), but it can also involve identifying a metaphor or an idiom in the text (e.g., an instance in which 'bear' isn't an animal but a large hairy person). 31 | 32 | ### Sentiment analysis 33 | It attempts to extract subjective qualities—attitudes, emotions, sarcasm, confusion, suspicion—from text. 34 | 35 | ### Natural language generation 36 | Sometimes described as the opposite of speech recognition or speech-to-text; it's the task of putting structured information into human language. 37 | -------------------------------------------------------------------------------- /Contributions/Maitri.md: -------------------------------------------------------------------------------- 1 | 153 | -------------------------------------------------------------------------------- /Contributions/Vansh.md: -------------------------------------------------------------------------------- 1 | 2 | 3 |

Hi , I'm Vansh Gupta

4 |

I'm a passionate Full Stack Developer from India.

5 | 6 | 7 | ## 🙋‍♂️ About Me 8 | 9 | - 🔭 I’m currently working on **[NADOS](https://nados.pepcoding.com/)** 10 | 11 | - 🌱 I’m currently learning **Data Structures and Algorithms.** 12 | 13 | - 📫 How to reach me **gvansh.411@gmail.com** 14 | 15 | - ⚡ Fun fact **I play games and watch cricket very often.** 16 | 17 | ## 🚀 Languages and Tools: 18 | 19 |

20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | postman 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 |

41 | 42 |
43 | 44 |

45 | 46 | Vansh Gupta's streak 47 | 48 |

49 | 50 | ## 📊 My Github Stats 51 | 52 |
53 | Vansh Gupta's Github Stats 54 | Vansh Gupta's Top Languages 55 |
56 | 58 | 59 |
60 |
61 | 62 | Vansh Gupta's Activity Graph 63 | 64 |
65 |
66 | 67 | ## Connect with me: 68 |

69 | 70 | 71 | 72 | 73 |

74 | 75 | ## ❤ Views 76 | ![](https://komarev.com/ghpvc/?username=Vansh-Gupta4) 77 | 78 | 79 | -------------------------------------------------------------------------------- /Loading screen.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | pbsa 5 | 502 | 503 | 504 |
505 |
506 |
507 | 508 |
509 | 510 | 511 | 512 | 513 |
514 | 515 |
516 |
517 | 518 |
519 | 520 | 521 | 522 | 523 |
524 | 525 |
526 |
527 | 528 |
529 | 530 | 531 | 532 | 533 |
534 | 535 |
536 |
537 | 538 |
539 | 540 | 541 | 542 | 543 |
544 | 545 |
546 |
547 | 548 |
549 | 550 | 551 | 552 | 553 |
554 | 555 |
556 |
557 | 558 |
559 | 560 | 561 | 562 | 563 |
564 | 565 |
566 |
567 | 568 |
569 | 570 | 571 | 572 | 573 |
574 | 575 |
576 |
577 | 578 |
579 | 580 | 581 | 582 | 583 |
584 | 585 |
586 |
587 | 588 |
589 | 590 | 591 | 592 | 593 |
594 | 595 |
596 |
597 | 598 |
599 | 600 | 601 | 602 | 603 |
604 | 605 |
606 |
607 | 608 |
609 | 610 | 611 | 612 | 613 |
614 | 615 |
616 |
617 |
618 | 619 | --------------------------------------------------------------------------------