Data Analysis is one of the most common processes to analyze the data and find out the answers to how and why things happened in the past.
With this video, let's create a machine learning model to predict diabetes while covering Dataset importing, Data cleaning, Data visualization and EDA on Diabetes Dataset, and Preparing a Medicine Learning model.
To watch the video, go to the link: https://bit.ly/3wGfH4E
With this video, let's create a machine learning model to predict diabetes while covering Dataset importing, Data cleaning, Data visualization and EDA on Diabetes Dataset, and Preparing a Medicine Learning model.
To watch the video, go to the link: https://bit.ly/3wGfH4E
"Problem of the Day"
Solve this question to get points
Consider the set of irreducible fractions A = {n/d | nā¤d and d ā¤ 10000 and gcd(n,d) = 1}.
Full Problem: https://practice.geeksforgeeks.org/problems/fraction-trouble1410/1
Solve this question to get points
Consider the set of irreducible fractions A = {n/d | nā¤d and d ā¤ 10000 and gcd(n,d) = 1}.
Full Problem: https://practice.geeksforgeeks.org/problems/fraction-trouble1410/1
practice.geeksforgeeks.org
Fraction Trouble | Practice | GeeksforGeeks
Consider the set of irreducible fractions A = {n/d | nā¤d and d ā¤ 10000 and gcd(n,d) = 1}.You are given a member of this set and your task is to find the largest fraction in this set less than the given fraction.
Note : this is a set
Note : this is a set
Learning from experiences is probably one of the only shortcuts in life and there's no better source than TED Talks to gain extensive and valuable knowledge on an array of topics.
To make a small contribution to your knowledge base, we've compiled a list of 5 TED Talks you should watch as a college student.
The link to the article: https://bit.ly/3PNEYTc
To make a small contribution to your knowledge base, we've compiled a list of 5 TED Talks you should watch as a college student.
The link to the article: https://bit.ly/3PNEYTc
"Problem of the Day"
Solve this question to get points
Geek lives in a special city where houses are arranged in a hierarchial manner.
Full Problem: https://practice.geeksforgeeks.org/problems/shortest-path-between-cities/1
Solve this question to get points
Geek lives in a special city where houses are arranged in a hierarchial manner.
Full Problem: https://practice.geeksforgeeks.org/problems/shortest-path-between-cities/1
practice.geeksforgeeks.org
Shortest Path between Cities | Practice | GeeksforGeeks
Geek lives in a special city where houses are arranged in a hierarchial manner. Starting from house number 1, each house leads to two more houses.
1 leads to 2 and 3.
2 leads to 4 and 5.
3 leads to 6 and 7. and so on.
Giv
1 leads to 2 and 3.
2 leads to 4 and 5.
3 leads to 6 and 7. and so on.
Giv
Problem of the Day"
Solve this question to get points
Given a positive integer n that represents dimensions of a 4n x 4n matrix with values from 1 to 4*n*4*n filled from left to right and top to bottom.
Full Problem: https://practice.geeksforgeeks.org/problems/form-coils-in-a-matrix4726/1
Solve this question to get points
Given a positive integer n that represents dimensions of a 4n x 4n matrix with values from 1 to 4*n*4*n filled from left to right and top to bottom.
Full Problem: https://practice.geeksforgeeks.org/problems/form-coils-in-a-matrix4726/1
practice.geeksforgeeks.org
Form coils in a matrix | Practice | GeeksforGeeks
Given a positive integer n that represents dimensions of a 4n x 4n matrix with values from 1 to 4*n*4*n filled from left to right and top to bottom. Your task is to form two coils from matrix and print the coils.
Follow the given examples for bett
Follow the given examples for bett
Your Weekly Coding Quiz is here!š¤©
Test your Python knowledge with "LIFE OF PY" a python coding quiz having 20 MCQs and get assured rewards. Learning and winning altogether.
You can submit your entry by 11:59 PM IST today.
To participate: https://forms.gle/nuggARNSN2jFAiGNA
Test your Python knowledge with "LIFE OF PY" a python coding quiz having 20 MCQs and get assured rewards. Learning and winning altogether.
You can submit your entry by 11:59 PM IST today.
To participate: https://forms.gle/nuggARNSN2jFAiGNA
Problem of the Day"
Solve this question to get points
Given a n*m matrix, find the maximum length path (starting from any cell) such that all cells along the path are in strictly increasing order.
Full Problem: https://bit.ly/3Gv51KG
Solve this question to get points
Given a n*m matrix, find the maximum length path (starting from any cell) such that all cells along the path are in strictly increasing order.
Full Problem: https://bit.ly/3Gv51KG
practice.geeksforgeeks.org
Longest Path in a matrix | Practice | GeeksforGeeks
Given a n*m matrix, find the maximum length path (starting from any cell) such that all cells along the path are in strictly increasing order.
We can move in 4 directions from a given cell (i, j), i.e., we can move to (i+1, j) or (i, j+1) or
We can move in 4 directions from a given cell (i, j), i.e., we can move to (i+1, j) or (i, j+1) or
Who doesn't want their work done on time? Here's where the Scheduling of processes/work is done. CPU Scheduling allows one process to use the CPU while another process is delayed.
The purpose of CPU Scheduling is to make the system more efficient, faster, and fairer. Let's get into the CPU Scheduling and read more in this article.
The link to the article: https://bit.ly/3PKE5uZ
The purpose of CPU Scheduling is to make the system more efficient, faster, and fairer. Let's get into the CPU Scheduling and read more in this article.
The link to the article: https://bit.ly/3PKE5uZ
Problem of the Day"
Solve this question to get points
Given 3 integers n, r and m. You task is to calculate nCr%m.
Note: m is a square free number and largest prime factor of m <= 50.
Full Problem: https://bit.ly/3GxJYXX
Solve this question to get points
Given 3 integers n, r and m. You task is to calculate nCr%m.
Note: m is a square free number and largest prime factor of m <= 50.
Full Problem: https://bit.ly/3GxJYXX
practice.geeksforgeeks.org
nCr mod M | Part 2 | Practice | GeeksforGeeks
Given 3 integers n, r and m. You task is to calculate nCr%m.
Note: m is a square free number and largest prime factor of m <= 50.
Example 1:
Input: n = 5, r = 2, m = 98697
Output: 10
Explanation: 5C2 = 5!/(2!*3!) = 1
Note: m is a square free number and largest prime factor of m <= 50.
Example 1:
Input: n = 5, r = 2, m = 98697
Output: 10
Explanation: 5C2 = 5!/(2!*3!) = 1
JavaScript is a lightweight, open and cross-platform programming language. With this cheat sheet, we aim to help our readers learn JavaScript in the easiest way possible.
This covers concepts of JavaScript, quick, correct, and ready-to-use code snippets for common circumstances in JavaScript on one page. It is helpful to both beginner and professional coders of JavaScript.
Read more here: https://bit.ly/3PQAv2l
This covers concepts of JavaScript, quick, correct, and ready-to-use code snippets for common circumstances in JavaScript on one page. It is helpful to both beginner and professional coders of JavaScript.
Read more here: https://bit.ly/3PQAv2l
Do you know what's coming your way? š¤©
Our Amazon Test Series to make you interview-ready. Toh "Utha Le Re Baba, Utha le"! Is Offer ko Utha le. Flat INR 100 off on this course.
Your desired job will be in your hands, kyunki GFG Kar Lo, Ho Jaega ā¤ļø
To get this course now: https://practice.geeksforgeeks.org/courses/Amazon-Test-Series?utm_source=SM&utm_medium=TELEGRAM&utm_campaign=ATS10
Our Amazon Test Series to make you interview-ready. Toh "Utha Le Re Baba, Utha le"! Is Offer ko Utha le. Flat INR 100 off on this course.
Your desired job will be in your hands, kyunki GFG Kar Lo, Ho Jaega ā¤ļø
To get this course now: https://practice.geeksforgeeks.org/courses/Amazon-Test-Series?utm_source=SM&utm_medium=TELEGRAM&utm_campaign=ATS10
"Problem of the Day"
Solve this question to get points
A poor old man works in a palace for a living. One day the old man's wife met with an accident. She needed an immediate operation but the old man's savings were not enough for the operation.
Full Problem: https://bit.ly/3m5wo4R
Solve this question to get points
A poor old man works in a palace for a living. One day the old man's wife met with an accident. She needed an immediate operation but the old man's savings were not enough for the operation.
Full Problem: https://bit.ly/3m5wo4R
practice.geeksforgeeks.org
Help the Old Man!!! | Practice | GeeksforGeeks
A poor old man works in a palace for a living. One day the old man's wife met with an accident. She needed an immediate operation but the old man's savings were not enough for the operation. He went running to the king to beg for money. The k
If you are looking to develop your programmatic skills, then you should check out the reasons, we have listed below for you to know why you can go ahead with Java.
Watch the full video, and start learning today.
To watch the full video, click here: https://bit.ly/3zg31Vn
Watch the full video, and start learning today.
To watch the full video, click here: https://bit.ly/3zg31Vn
"Problem of the Day"
Solve this question to get points
A Maze is given as n*n matrix of blocks where source block is the upper left most block i.e., matrix[0][0] and destination block is lower rightmost block i.e., matrix[n-1][n-1].
Full Problem: https://practice.geeksforgeeks.org/problems/rat-maze-with-multiple-jumps3852/1
Solve this question to get points
A Maze is given as n*n matrix of blocks where source block is the upper left most block i.e., matrix[0][0] and destination block is lower rightmost block i.e., matrix[n-1][n-1].
Full Problem: https://practice.geeksforgeeks.org/problems/rat-maze-with-multiple-jumps3852/1
practice.geeksforgeeks.org
Rat Maze With Multiple Jumps | Practice | GeeksforGeeks
A Maze is given as n*n matrix of blocks where source block is the upper left most block i.e., matrix[0][0] and destination block is lower rightmost block i.e., matrix[n-1][n-1]. A rat starts from source and has to reach the destination. The rat
Life of Py - A Python Coding Quiz.pdf
63.3 KB
"LIFE OF PY" coding quiz results are out. š
Congratulations to all the participants.
Here's the answer key to check how much you scored. šāāļø
Keep Participating and Keep Learning.š
Congratulations to all the participants.
Here's the answer key to check how much you scored. šāāļø
Keep Participating and Keep Learning.š
Beat š the Heat with GFG Discord š
All you have to do is solve 4 Questions in 30 minutes and stand a chance to win our DSA Self Paced course, Amazon Vouchers, and much more.
Happening on the 4th & 5th of June in our Discord community.
To participate, check this: https://discord.gg/UYV8E5PDnV
All you have to do is solve 4 Questions in 30 minutes and stand a chance to win our DSA Self Paced course, Amazon Vouchers, and much more.
Happening on the 4th & 5th of June in our Discord community.
To participate, check this: https://discord.gg/UYV8E5PDnV
"Problem of the Day"
Solve this question to get points
N children are made to stand in a queue. Each of them is given a number A[i]. The teacher writes a number S on a page and passes it to the first child.
Full Problem: https://practice.geeksforgeeks.org/problems/tricky-subset-problem1557/1
Solve this question to get points
N children are made to stand in a queue. Each of them is given a number A[i]. The teacher writes a number S on a page and passes it to the first child.
Full Problem: https://practice.geeksforgeeks.org/problems/tricky-subset-problem1557/1
practice.geeksforgeeks.org
Tricky Subset Problem | Practice | GeeksforGeeks
N children are made to stand in a queue. Each of them is given a number A[i]. The teacher writes a number S on a page and passes it to the first child. Each child must add all the numbers they see on the page along with their own number, write the su
This media is not supported in your browser
VIEW IN TELEGRAM
Hit this Googly before it wooshes away! The price of our Google Test Series is going up with an aim to provide you the high-quality course content for the interviews.
A perfect test series that can bag you your dream job at Google. No more interview jitters as this can help you ace your Google Interview Preparation.
To start your preparation: https://practice.geeksforgeeks.org/courses/google-test-series?utm_source=SM&utm_medium=TELEGRAM&utm_campaign=GTS100
A perfect test series that can bag you your dream job at Google. No more interview jitters as this can help you ace your Google Interview Preparation.
To start your preparation: https://practice.geeksforgeeks.org/courses/google-test-series?utm_source=SM&utm_medium=TELEGRAM&utm_campaign=GTS100
"Problem of the Day"
Solve this question to get points
The minions are very elitist in nature. If minion x admires minion y, then y thinks too highly of himself and does not admire x back.
Full Problem: https://practice.geeksforgeeks.org/problems/villain-con0511/1
Solve this question to get points
The minions are very elitist in nature. If minion x admires minion y, then y thinks too highly of himself and does not admire x back.
Full Problem: https://practice.geeksforgeeks.org/problems/villain-con0511/1
www.geeksforgeeks.org
Villain Con | Practice | GeeksforGeeks
The minions are very elitist in nature. If minion x admires minion y, then y thinks too highly of himself and does not admire x back. Also, if x admires y, x also admires everyone that y admires.
All the minions are going to be present at the V
All the minions are going to be present at the V
Give your preparation the final touch that you've wanting!
This weekend get yourself enrolled in CIP Preparation Assessment Test from 4th June 12:00 PM to 5th June 06:00 PM IST to get the scholarship.
To participate: https://practice.geeksforgeeks.org/contest/scholarship-test-complete-interview-preparation?utm_source=SM&utm_medium=TELEGRAM&utm_campaign=CIP_PPT
This weekend get yourself enrolled in CIP Preparation Assessment Test from 4th June 12:00 PM to 5th June 06:00 PM IST to get the scholarship.
To participate: https://practice.geeksforgeeks.org/contest/scholarship-test-complete-interview-preparation?utm_source=SM&utm_medium=TELEGRAM&utm_campaign=CIP_PPT