Ohh look π Offer of the day is here. π€©
Get industry-ready with our Test Series for Product-Based Companies at 25% discount, the lowest price ever.
OFFER VALID FOR TODAY ONLY.
Grab it now: https://practice.geeksforgeeks.org/courses/test-series-bundle?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=pbts
Get industry-ready with our Test Series for Product-Based Companies at 25% discount, the lowest price ever.
OFFER VALID FOR TODAY ONLY.
Grab it now: https://practice.geeksforgeeks.org/courses/test-series-bundle?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=pbts
"Problem of the Day"
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
You are playing a game. At each level of the game, you have to choose one of the roads to go to the next level. Initially, you have h amount of health and m amount of money.
Full Problem: https://bit.ly/3OvGac2
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
You are playing a game. At each level of the game, you have to choose one of the roads to go to the next level. Initially, you have h amount of health and m amount of money.
Full Problem: https://bit.ly/3OvGac2
Test your web development skills with this weekly quiz. π€
Solve these MCQs based on Complete Bootstrap and win assured rewards.
You can submit your entry by 24th July, 11:59 PM IST.
To participate now: https://forms.gle/2q1uGcsxJ1twsmoDA
Solve these MCQs based on Complete Bootstrap and win assured rewards.
You can submit your entry by 24th July, 11:59 PM IST.
To participate now: https://forms.gle/2q1uGcsxJ1twsmoDA
"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, find the maximum sum path from a leaf to root.
Full Problem: https://bit.ly/3zv8iru
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given a Binary Tree, find the maximum sum path from a leaf to root.
Full Problem: https://bit.ly/3zv8iru
practice.geeksforgeeks.org
Maximum sum leaf to root path | Practice | GeeksforGeeks
Given a Binary Tree, find the maximum sum path from a leaf to root.
Example 1:
Input:
1
/ \
2 3
Output:
4
Explanation:
Following the path 3 -> 1, results in a
sum of 4, which is the maximum path sum
from
Example 1:
Input:
1
/ \
2 3
Output:
4
Explanation:
Following the path 3 -> 1, results in a
sum of 4, which is the maximum path sum
from
Kickstart your interview preparation with the offer of the day. ππ
Grab our Low Level Design, self paced course at 25% discount, the lowest price ever.
OFFER VALID FOR TODAY ONLY.
To get this course now: https://practice.geeksforgeeks.org/courses/object-oriented-design?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=lld
Grab our Low Level Design, self paced course at 25% discount, the lowest price ever.
OFFER VALID FOR TODAY ONLY.
To get this course now: https://practice.geeksforgeeks.org/courses/object-oriented-design?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=lld
Your Roadmap to Become an SDE is here. π
What is an SDE Sheet?
An SDE Sheet is a list of the most important topics or the most popular questions, especially curated to ace the Software Development Engineer Interviews.
Why you should go for this SDE Sheet?
It not only contains coding questions but also covers all segments, helpful for both the freshers and the experienced.
Hereβs the complete roadmap, which you should definitely check out:
1) Resume building,
2) Important Data structures and algorithms topics,
- Arrays
- Searching and Sorting
- Hashing
- Matrix
- Strings
- Recursion & Backtracking
- Bit Manipulation
- Linked List
- Stacks and Queues
- Binary Tree
- Binary Search Tree
- Greedy
- Dynamic Programming
- Heap
- Graph
- Trie
3) Major CS subjects:
- Operating Systems
- DBMS
- SQL
- Computer Networks
4) Puzzles,
5) Projects,
6) System Design.
Here's the full article, letβs delve into it: https://bit.ly/3z3UfrD
What is an SDE Sheet?
An SDE Sheet is a list of the most important topics or the most popular questions, especially curated to ace the Software Development Engineer Interviews.
Why you should go for this SDE Sheet?
It not only contains coding questions but also covers all segments, helpful for both the freshers and the experienced.
Hereβs the complete roadmap, which you should definitely check out:
1) Resume building,
2) Important Data structures and algorithms topics,
- Arrays
- Searching and Sorting
- Hashing
- Matrix
- Strings
- Recursion & Backtracking
- Bit Manipulation
- Linked List
- Stacks and Queues
- Binary Tree
- Binary Search Tree
- Greedy
- Dynamic Programming
- Heap
- Graph
- Trie
3) Major CS subjects:
- Operating Systems
- DBMS
- SQL
- Computer Networks
4) Puzzles,
5) Projects,
6) System Design.
Here's the full article, letβs delve into it: https://bit.ly/3z3UfrD
π4
"Problem of the Day"
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given a weighted, directed and connected graph of V vertices and E edges, Find the shortest distance of all the vertex's from the source vertex S.
Full Problem: https://bit.ly/3PTnnbO
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given a weighted, directed and connected graph of V vertices and E edges, Find the shortest distance of all the vertex's from the source vertex S.
Full Problem: https://bit.ly/3PTnnbO
practice.geeksforgeeks.org
Distance from the Source (Bellman-Ford Algorithm) | Practice | GeeksforGeeks
Given a weighted, directed and connected graph of V vertices and E edges, Find the shortest distance of all the vertex's from the source vertex S.
Note: The Graph doesn't contain any negative weight cycle.
Example 1:
Input:
Note: The Graph doesn't contain any negative weight cycle.
Example 1:
Input:
Make your day, a happy day! π€©
Offer Of The Day is Here. Grab our Data Structures Using Python Programming, self-paced course at a 25% discount, the lowest price ever.
OFFER VALID FOR TODAY ONLY.
Grab this course now: https://practice.geeksforgeeks.org/courses/Data-Structures-With-Python?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=dsp
Offer Of The Day is Here. Grab our Data Structures Using Python Programming, self-paced course at a 25% discount, the lowest price ever.
OFFER VALID FOR TODAY ONLY.
Grab this course now: https://practice.geeksforgeeks.org/courses/Data-Structures-With-Python?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=dsp
π2
This summer, step-up with our exclusive Summer Interview Preparation. π
Summer Interview Preparation is a 7 days event, where you will cover all aspects of your interview preparation, especially curated by the industry experts.
Register Now: https://practice.geeksforgeeks.org/courses/summer-Interview-preparation?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=sip
Summer Interview Preparation is a 7 days event, where you will cover all aspects of your interview preparation, especially curated by the industry experts.
Register Now: https://practice.geeksforgeeks.org/courses/summer-Interview-preparation?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=sip
"Problem of the Day"
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given a linked list, the task is to complete the function maxPalindrome() which returns an integer denoting the length of the longest palindrome list that exists in the given linked list.
Full Problem: https://bit.ly/3Bc1KQ2
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given a linked list, the task is to complete the function maxPalindrome() which returns an integer denoting the length of the longest palindrome list that exists in the given linked list.
Full Problem: https://bit.ly/3Bc1KQ2
practice.geeksforgeeks.org
Length of longest palindrome in linked list | Practice | GeeksforGeeks
Given a linked list, the task is to complete the function maxPalindrome() which returns an integer denoting the length of the longest palindrome list that exist in the given linked list.
Input:
The first line of input contains an integer T
Input:
The first line of input contains an integer T
Dig that skill out with the offer of the day. π€©
Get 25% discount on our React JS, self-paced course. Use the coupon code "GOLRJS25".
HURRY! OFFER VALID FOR TODAY ONLY.
Grab this now: https://practice.geeksforgeeks.org/courses/react-course?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=rjs
Get 25% discount on our React JS, self-paced course. Use the coupon code "GOLRJS25".
HURRY! OFFER VALID FOR TODAY ONLY.
Grab this now: https://practice.geeksforgeeks.org/courses/react-course?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=rjs
Create A Powerful Resume π
Resume and the importance it holds:
A resume introduces your qualifications, skills, achievements, and a lot more about you and your expertise. If your resume is inferior, you wonβt even get a chance to compete in the first place.
The sole purpose of a resume is to make you land your dream job. When you have a powerful resume, nothing can be a hindrance to the best job.
Letβs know how to build a perfect resume and create one: https://bit.ly/3vfB25l
Hereβs the link to the full article for your SDE preparation: https://bit.ly/3z3UfrD
Resume and the importance it holds:
A resume introduces your qualifications, skills, achievements, and a lot more about you and your expertise. If your resume is inferior, you wonβt even get a chance to compete in the first place.
The sole purpose of a resume is to make you land your dream job. When you have a powerful resume, nothing can be a hindrance to the best job.
Letβs know how to build a perfect resume and create one: https://bit.ly/3vfB25l
Hereβs the link to the full article for your SDE preparation: https://bit.ly/3z3UfrD
π4
"Problem of the Day"
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given an array Arr[] of size N and an integer K, you have to add the first two minimum elements of the array until all the elements are greater than or equal to K and find the number of such operations required.
Full Problem: https://bit.ly/3OCjl6E
Solve this question to get points.
Maintain the 24days streak and earn Geekbits, Rewards, and much more.
Given an array Arr[] of size N and an integer K, you have to add the first two minimum elements of the array until all the elements are greater than or equal to K and find the number of such operations required.
Full Problem: https://bit.ly/3OCjl6E
practice.geeksforgeeks.org
Adding Array Elements | Practice | GeeksforGeeks
Given an array Arr[] of size N and an integer K, you have to choose the first two minimum elements of the array and erase them, then insert the sum of these two elements in the array until all the elements are greater than or
This media is not supported in your browser
VIEW IN TELEGRAM
Results of ODD ONE OF THE SQUAD are out. π
β¨Congratulations to all the crazy minds. You deserved it all. β¨
Keep enjoying, keep participating! β€
β¨Congratulations to all the crazy minds. You deserved it all. β¨
Keep enjoying, keep participating! β€
π3π2
It's time to celebrate with the offer of the day π
Learn JAVA Framework concepts & become industry ready!
Grab our Fundamentals of Java Collection Framework - Self Paced course at 25% discount, the lowest price ever.
Use the coupon code "GOLJVC25"
OFFER VALID FOR TODAY ONLY.
To avail of this offer: https://practice.geeksforgeeks.org/courses/Java-Collections?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=jvc
Learn JAVA Framework concepts & become industry ready!
Grab our Fundamentals of Java Collection Framework - Self Paced course at 25% discount, the lowest price ever.
Use the coupon code "GOLJVC25"
OFFER VALID FOR TODAY ONLY.
To avail of this offer: https://practice.geeksforgeeks.org/courses/Java-Collections?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=jvc
π©3β€2
Hey Telegram Fam β€
To make our bond stronger than before, we have now made this channel more transparent.
You can now react, comment, discuss, and learn more.
Show more love and help us in giving you more value-added content.
To add more love, just simply react to our posts.
To join the discussion, ask a query, just simply click here: https://t.me/+AFPwoENLUgFiNDNl
To make our bond stronger than before, we have now made this channel more transparent.
You can now react, comment, discuss, and learn more.
Show more love and help us in giving you more value-added content.
To add more love, just simply react to our posts.
To join the discussion, ask a query, just simply click here: https://t.me/+AFPwoENLUgFiNDNl
β€21π4π₯1π₯°1
"Problem of the Day"
Solve this question to get points.
M hooks are present in a straight line on wall A and N hooks are present in a straight line on wall B. Each hook on wall A is connected to each hooks on wall B by ropes.
Full Problem: https://bit.ly/3oyJNU3
Solve this question to get points.
M hooks are present in a straight line on wall A and N hooks are present in a straight line on wall B. Each hook on wall A is connected to each hooks on wall B by ropes.
Full Problem: https://bit.ly/3oyJNU3
practice.geeksforgeeks.org
Geek and knots | Practice | GeeksforGeeks
M hooks are present in a straight line on wall A and N hooks are present in a straight line on wall B. Each hook on wall A is connected to each hook on wall B by ropes. K ropes must be used to make the desired giant knot. How many such knots can Geek
π2
Build a solid understanding of Data Structures using C Language.
Grab this self-paced course at 25% discount, the lowest price ever. All you need to do is just simply use the coupon code "GOLDSC25" and become a strong and efficient problem solver.
OFFER VALID FOR TODAY ONLY.
To grab this course: https://practice.geeksforgeeks.org/courses/ds-in-c?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=dsc
Grab this self-paced course at 25% discount, the lowest price ever. All you need to do is just simply use the coupon code "GOLDSC25" and become a strong and efficient problem solver.
OFFER VALID FOR TODAY ONLY.
To grab this course: https://practice.geeksforgeeks.org/courses/ds-in-c?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=ootd&utm_term=dsc
π1
For every beginner, there's always a constant thought that if you want to start learning something new, how to start with it exactly, what things need to be taken care of, and what are resources.
With this article, we aim to cater to those who want to learn Javascript.
JavaScript is the king that rules the world and is indeed an amazing language. It supports multiple frameworks like React, Angular, and jQuery.
The most popular MNCs that hire JavaScript developers are Google, Netflix, Walmart, Microsoft, etc.
Now, when thereβs a much-talk about JavaScript, letβs know what it is.
Start it from here: https://bit.ly/3PETnRq
With this article, we aim to cater to those who want to learn Javascript.
JavaScript is the king that rules the world and is indeed an amazing language. It supports multiple frameworks like React, Angular, and jQuery.
The most popular MNCs that hire JavaScript developers are Google, Netflix, Walmart, Microsoft, etc.
Now, when thereβs a much-talk about JavaScript, letβs know what it is.
Start it from here: https://bit.ly/3PETnRq
π₯6
"Problem of the Day"
Solve this question to get points.
Geek is the founder of Geek Constructions. He always maintains a black-list of potential employees which can be fired at any moment.
Full Problem: https://bit.ly/3zG7gcx
Solve this question to get points.
Geek is the founder of Geek Constructions. He always maintains a black-list of potential employees which can be fired at any moment.
Full Problem: https://bit.ly/3zG7gcx
practice.geeksforgeeks.org
Firing employees | Practice | GeeksforGeeks
Geek is the founder of Geek Constructions. He always maintains a black-list of potential employees which can be fired at any moment.
The company has N employees (including Geek), and each employee is assigned a distinct rank (1 <= rank <
The company has N employees (including Geek), and each employee is assigned a distinct rank (1 <= rank <
π6β€2