We are back again with an exciting Live to make your weekend more entertaining!🤩
We have introduced our own version of Big Boss while enjoying the evening snacks. 🍜
Join our Shonty B@dmass at 6:00 PM IST: https://discord.gg/pjHTwrtQ
We have introduced our own version of Big Boss while enjoying the evening snacks. 🍜
Join our Shonty B@dmass at 6:00 PM IST: https://discord.gg/pjHTwrtQ
"Problem of the Day"
Solve this question to get points
Given a directed acyclic graph(DAG) with n nodes labeled from 0 to n-1. Given edges, s and d ,count the number of ways to reach from s to d.
Full Problem: https://practice.geeksforgeeks.org/problems/count-the-paths4332/1
Solve this question to get points
Given a directed acyclic graph(DAG) with n nodes labeled from 0 to n-1. Given edges, s and d ,count the number of ways to reach from s to d.
Full Problem: https://practice.geeksforgeeks.org/problems/count-the-paths4332/1
practice.geeksforgeeks.org
Count the paths | Practice | GeeksforGeeks
Given a directed acyclic graph(DAG) with n nodes labeled from 0 to n-1. Given edges, s and d ,count the number of ways to reach from s to d.There is a directed Edge from vertex edges[i][0] to the vertex edges[i][1].
Example:
Example:
"Problem of the Day"
Solve this question to get points
Given a string s and a dictionary of words dict of length n, add spaces in s to construct a sentence where each word is a valid dictionary word.
Full Problem: https://bit.ly/3R8Qeuk
Solve this question to get points
Given a string s and a dictionary of words dict of length n, add spaces in s to construct a sentence where each word is a valid dictionary word.
Full Problem: https://bit.ly/3R8Qeuk
practice.geeksforgeeks.org
Word Break - Part 2 | Practice | GeeksforGeeks
Given a string s and a dictionary of words dict of length n, add spaces in s to construct a sentence where each word is a valid dictionary word. Each dictionary word can be used more than once. Return all such possible sentences.
Follow examples for
Follow examples for
👍1
Compete and rule the multiverse of memers. 🙌
Participate in this meme challenge and stand a chance to win big. 🤩
To start right away, click here: https://www.geeksforgeeks.org/geek-o-lympics/?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=geekolympics
P.S. You need to submit your entry daily till 11th July.
Participate in this meme challenge and stand a chance to win big. 🤩
To start right away, click here: https://www.geeksforgeeks.org/geek-o-lympics/?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=geekolympics
P.S. You need to submit your entry daily till 11th July.
👍1
A Streak Worth Maintaining!
Geek-O-Lympics brings to your screen Geek Streak.
Practice coding every day and get rewarded for maintaining a streak for 24 days straight starting from 3rd July 2022.
Go to the link and know everything about Geek Streak: https://www.geeksforgeeks.org/geek-streak-24-days-potd-challenge/?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=geekstreak
Geek-O-Lympics brings to your screen Geek Streak.
Practice coding every day and get rewarded for maintaining a streak for 24 days straight starting from 3rd July 2022.
Go to the link and know everything about Geek Streak: https://www.geeksforgeeks.org/geek-streak-24-days-potd-challenge/?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=geekstreak
This Geek-O-Lympics participate in Interview Series Tryout every Sunday at 7 PM to prepare for coding interview rounds of top tech giants.
Appear on the monthly leaderboard, earn GeekBits, redeem rewards, and much more.
To participate and know more in detail, click here: https://practice.geeksforgeeks.org/events/rec/interview-series?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=interviewseries
Appear on the monthly leaderboard, earn GeekBits, redeem rewards, and much more.
To participate and know more in detail, click here: https://practice.geeksforgeeks.org/events/rec/interview-series?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=interviewseries
❤1
Here's the Offer of the Day! 🙌🙌
Grab our DSA Self Paced at the lowest price ever.😍
To get into the Algo-Rhythm, click here: https://practice.geeksforgeeks.org/courses/dsa-self-paced?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=dsa_sp
Grab our DSA Self Paced at the lowest price ever.😍
To get into the Algo-Rhythm, click here: https://practice.geeksforgeeks.org/courses/dsa-self-paced?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=dsa_sp
"Problem of the Day"
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards and much more.
Given two integers A and B, the task is to find an integer X such that (X XOR A) is minimum possible and the count of set bit in X is equal to the count of set bits in B.
Full Problem: https://bit.ly/3P2gVyY
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards and much more.
Given two integers A and B, the task is to find an integer X such that (X XOR A) is minimum possible and the count of set bit in X is equal to the count of set bits in B.
Full Problem: https://bit.ly/3P2gVyY
practice.geeksforgeeks.org
Minimum X (xor) A | Practice | GeeksforGeeks
Given two integers A and B, the task is to find an integer X such that (X XOR A) is minimum possible and the count of set bit in X is equal to the count of set bits in B.
Example 1:
Input:
A
Example 1:
Input:
A
Amazon is HIRING 🤩🤩🤩🤩
Your dream to get into a FAANG company is right at your doorstep.
Participate in this JOB-A-THON: Amazon and stand a chance to work in your dream company.
P.S. Candidates having 1+ Years of experience can apply.
Register Here: https://practice.geeksforgeeks.org/contest/job-a-thon-exclusive-hiring-challenge-for-amazon-alexa?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=amazon_jobathon
Your dream to get into a FAANG company is right at your doorstep.
Participate in this JOB-A-THON: Amazon and stand a chance to work in your dream company.
P.S. Candidates having 1+ Years of experience can apply.
Register Here: https://practice.geeksforgeeks.org/contest/job-a-thon-exclusive-hiring-challenge-for-amazon-alexa?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=amazon_jobathon
Your OFFER OF THE DAY is Here!
Get our GIT & GITHUB Self-Paced course at the lowest price ever.
To grab this offer, click here: https://practice.geeksforgeeks.org/courses/git?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=git
Get our GIT & GITHUB Self-Paced course at the lowest price ever.
To grab this offer, click here: https://practice.geeksforgeeks.org/courses/git?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=git
"Problem of the Day"
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given a Binary Search Tree (BST) and a range l-h(inclusive), count the number of nodes in the BST that lie in the given range.
Full Problem: https://bit.ly/3AkZZzA
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given a Binary Search Tree (BST) and a range l-h(inclusive), count the number of nodes in the BST that lie in the given range.
Full Problem: https://bit.ly/3AkZZzA
www.geeksforgeeks.org
Count BST nodes that lie in a given range | Practice | GeeksforGeeks
Given a Binary Search Tree (BST) and a range l-h(inclusive), count the number of nodes in the BST that lie in the given range.
The values smaller than root go to the left side
The values greater and equal to the root go to the right side
The values smaller than root go to the left side
The values greater and equal to the root go to the right side
Say Hi🙋♀️ to AI with Machine Learning!
No more trouble understanding Machine Learning now. Get our course at the lowest price ever.
Note: Offer valid till 11:59 PM IST today.
Grab this offer now: https://practice.geeksforgeeks.org/courses/machine-learning?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=machinelearning
No more trouble understanding Machine Learning now. Get our course at the lowest price ever.
Note: Offer valid till 11:59 PM IST today.
Grab this offer now: https://practice.geeksforgeeks.org/courses/machine-learning?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=machinelearning
"Problem of the Day"
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given a Binary Tree, print the diagonal traversal of the binary tree.
Consider lines of slope -1 passing between nodes.
Full Problem: https://bit.ly/3nFS7kq
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given a Binary Tree, print the diagonal traversal of the binary tree.
Consider lines of slope -1 passing between nodes.
Full Problem: https://bit.ly/3nFS7kq
practice.geeksforgeeks.org
Good or Bad string | Practice | GeeksforGeeks
In this problem, a String S is composed of lowercase alphabets and wildcard characters i.e. '?'. Here, '?' can be replaced by any of the lowercase alphabets. Now you have to classify the given String on the basis of following rules:
Become A++ with the OFFER OF THE DAY.
Grab our C++ STL self-paced course at the lowest price ever.
OFFER VALID TILL 11:59 PM today only.
To avail of this offer now: https://practice.geeksforgeeks.org/courses/cpp-stl?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=CSTL
Grab our C++ STL self-paced course at the lowest price ever.
OFFER VALID TILL 11:59 PM today only.
To avail of this offer now: https://practice.geeksforgeeks.org/courses/cpp-stl?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=CSTL
"Problem of the Day"
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
2 players A and B take turns alternatively to play a game in which they have N numbers on a paper. In one turn, a player can replace one of the numbers by any of its factor (except for 1 & the number itself).
Full Problem: https://bit.ly/3yk8Te1
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
2 players A and B take turns alternatively to play a game in which they have N numbers on a paper. In one turn, a player can replace one of the numbers by any of its factor (except for 1 & the number itself).
Full Problem: https://bit.ly/3yk8Te1
practice.geeksforgeeks.org
Brain Game | Practice | GeeksforGeeks
2 players A and B take turns alternatively to play a game in which they have N numbers on a paper. In one turn, a player can replace one of the numbers by any of its factor (except for 1 & the number itself). The player who is unab
Get our Doubt Assistance for Free.
For the first time ever, a 24-hour live session, where you can get answers to all of your doubts.
All you need to do is:
- Submit Your Doubts by 08th July,
- Tune into your preferred slots on 09th & 10th July.
To Submit Your Doubt, Click Here: https://practice.geeksforgeeks.org/courses-preview/doubt-support-24-1?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=doubt_marathon
For the first time ever, a 24-hour live session, where you can get answers to all of your doubts.
All you need to do is:
- Submit Your Doubts by 08th July,
- Tune into your preferred slots on 09th & 10th July.
To Submit Your Doubt, Click Here: https://practice.geeksforgeeks.org/courses-preview/doubt-support-24-1?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=doubt_marathon
Compete for high with Competitive Programming.🤩
Grab this live course at the lowest price ever. Offer valid till 11:59 PM today.
To avail of this offer: https://practice.geeksforgeeks.org/courses/competitive-programming-live?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=CPL
Grab this live course at the lowest price ever. Offer valid till 11:59 PM today.
To avail of this offer: https://practice.geeksforgeeks.org/courses/competitive-programming-live?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=CPL
"Problem of the Day"
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given an array p[] of length n used to denote the dimensions of a series of matrices such that dimension of i'th matrix is p[i] * p[i+1]. There are a total of n-1 matrices.
Full Problem: https://bit.ly/3ypzOVL
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given an array p[] of length n used to denote the dimensions of a series of matrices such that dimension of i'th matrix is p[i] * p[i+1]. There are a total of n-1 matrices.
Full Problem: https://bit.ly/3ypzOVL
practice.geeksforgeeks.org
Brackets in Matrix Chain Multiplication | Practice | GeeksforGeeks
Given an array p[] of length n used to denote the dimensions of a series of matrices such that dimension of i'th matrix is p[i] * p[i+1]. There are a total of n-1 matrices. Find the most efficient way to multiply these ma
When in doubt, Ask it out!
Your final chance to submit your doubt is here. You can submit your doubt by 11:59 PM on 08th July.
To submit your doubt, click here: https://practice.geeksforgeeks.org/courses-preview/doubt-support-24-1?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=doubt_marathon
Your final chance to submit your doubt is here. You can submit your doubt by 11:59 PM on 08th July.
To submit your doubt, click here: https://practice.geeksforgeeks.org/courses-preview/doubt-support-24-1?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=doubt_marathon