We are Hiring! 💁♂️
Come and become a part of GeeksforGeeks. Hiring Contest for Member of Technical Staff( Internship).
Go to the link for the Job Description, and more details.
Happening on 11th June 2022.
To Apply Now: https://practice.geeksforgeeks.org/contest/gfg-hiring-mts-internship?utm_source=SM&utm_medium=TELEGRAM&utm_campaign=MTS_INTERNSHIP
Come and become a part of GeeksforGeeks. Hiring Contest for Member of Technical Staff( Internship).
Go to the link for the Job Description, and more details.
Happening on 11th June 2022.
To Apply Now: https://practice.geeksforgeeks.org/contest/gfg-hiring-mts-internship?utm_source=SM&utm_medium=TELEGRAM&utm_campaign=MTS_INTERNSHIP
"Problem of the Day"
Solve this question to get points
Given N Magnets which are placed linearly, with each magnet to be considered as of point object. Each magnet suffers force from its left-sided magnets such that they repel it to the right and vice versa.
Full Problem: https://bit.ly/3MKSXXg
Solve this question to get points
Given N Magnets which are placed linearly, with each magnet to be considered as of point object. Each magnet suffers force from its left-sided magnets such that they repel it to the right and vice versa.
Full Problem: https://bit.ly/3MKSXXg
practice.geeksforgeeks.org
Magnet Array Problem | Practice | GeeksforGeeks
Given N Magnets which are placed linearly, with each magnet to be considered as of point object. Each magnet suffers force from its left sided magnets such that they repel it to the right and vice versa. All forces are repulsive. The force being equa
It's time for the Weekly Quiz!
You must have tested your Java Fundamentals with our previous quiz.
This time, take it to the advanced level with the "Java Collections Frameworks" quiz.
You can submit your entry by 12th June, 11:59 PM IST.
To participate now: https://forms.gle/JJYpmeWg3JCs2C4N9
You must have tested your Java Fundamentals with our previous quiz.
This time, take it to the advanced level with the "Java Collections Frameworks" quiz.
You can submit your entry by 12th June, 11:59 PM IST.
To participate now: https://forms.gle/JJYpmeWg3JCs2C4N9
"Problem of the Day"
Solve this question to get points
Given a string str consisting of digits, one may group these digits into sub-groups while maintaining their original order.
Full Problem: https://practice.geeksforgeeks.org/problems/count-digit-groupings-of-a-number1520/1
Solve this question to get points
Given a string str consisting of digits, one may group these digits into sub-groups while maintaining their original order.
Full Problem: https://practice.geeksforgeeks.org/problems/count-digit-groupings-of-a-number1520/1
practice.geeksforgeeks.org
Count digit groupings of a number | Practice | GeeksforGeeks
Given a string str consisting of digits, one may group these digits into sub-groups while maintaining their original order.
The task is to count number of groupings such that for every sub-group except the last one, sum of digits in a sub-
The task is to count number of groupings such that for every sub-group except the last one, sum of digits in a sub-
"Problem of the Day"
Solve this question to get points
Given a string s, the task is to check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.
Full Problem: https://bit.ly/3xswbhv
Solve this question to get points
Given a string s, the task is to check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.
Full Problem: https://bit.ly/3xswbhv
practice.geeksforgeeks.org
String formation from substring | Practice | GeeksforGeeks
Given a string s, the task is to check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.
Example 1:
Input: s = "ababab"
Output: 1
Explanation: It is contructed by
Example 1:
Input: s = "ababab"
Output: 1
Explanation: It is contructed by
Since 2008 Google has upgraded its competitive infrastructure and Google Code Jam became a fest for competitive programmers. Every competitive programmer dreams to be a part of the final rank list of Google Code Jam.
This article will give you a complete guide to help you understand every aspect of the Google Code Jam competition.
Link to the article: https://bit.ly/3MKlBIb
This article will give you a complete guide to help you understand every aspect of the Google Code Jam competition.
Link to the article: https://bit.ly/3MKlBIb
"Problem of the Day"
Solve this question to get points
Given a number n. The task is to find the smallest number whose factorial contains at least n trailing zeroes.
Full Problem: https://bit.ly/3aZVnUV
Solve this question to get points
Given a number n. The task is to find the smallest number whose factorial contains at least n trailing zeroes.
Full Problem: https://bit.ly/3aZVnUV
www.geeksforgeeks.org
Smallest factorial number | Practice | GeeksforGeeks
Given a number n. The task is to find the smallest number whose factorial contains at least n trailing zeroes.
Example 1:
Input:
n = 1
Output: 5
Explanation : 5! = 120 which has at
least 1 trailing 0.
Example 2:
Input:
n = 6
Example 1:
Input:
n = 1
Output: 5
Explanation : 5! = 120 which has at
least 1 trailing 0.
Example 2:
Input:
n = 6
"Gir Gaya"
"Iss Course Ka Bhao Gir Gaya"
You don’t have to wander different places for the perfect Data Structures course, because we have it right here!
Now, only for a limited time, grab an additional INR 300 discount on Data Structures Using Python Programming - Self-Paced Course.
Use the code- ‘DSP300’ valid till 15th June, 11:59 PM IST.
To avail of this offer: https://practice.geeksforgeeks.org/courses/Data-Structures-With-Python?utm_source=SM+&utm_medium=TELEGRAM&utm_campaign=DSP300
"Iss Course Ka Bhao Gir Gaya"
You don’t have to wander different places for the perfect Data Structures course, because we have it right here!
Now, only for a limited time, grab an additional INR 300 discount on Data Structures Using Python Programming - Self-Paced Course.
Use the code- ‘DSP300’ valid till 15th June, 11:59 PM IST.
To avail of this offer: https://practice.geeksforgeeks.org/courses/Data-Structures-With-Python?utm_source=SM+&utm_medium=TELEGRAM&utm_campaign=DSP300
"Problem of the Day"
Solve this question to get points
As we know, Ishaan has a love for chocolates. He has bought a huge chocolate bar that contains N chocolate squares. Each of the squares has a tastiness level which is denoted by an array A[].
Full Problem: https://bit.ly/3tClR57
Solve this question to get points
As we know, Ishaan has a love for chocolates. He has bought a huge chocolate bar that contains N chocolate squares. Each of the squares has a tastiness level which is denoted by an array A[].
Full Problem: https://bit.ly/3tClR57
practice.geeksforgeeks.org
Ishaan Loves Chocolates | Practice | GeeksforGeeks
As we know, Ishaan has a love for chocolates. He has bought a huge chocolate bar that contains N chocolate squares. Each of the squares has a tastiness level which is denoted by an array A[].
Ishaan can eat the first or the last square of the chocol
Ishaan can eat the first or the last square of the chocol
JAVA COLLECTIONS QUIZ ( Answer Key).pdf
48.4 KB
The results of "Java Collections Quiz" are out.
Here's the answer key, go and check your answers now.
Keep Winning, Keep Learning!
Here's the answer key, go and check your answers now.
Keep Winning, Keep Learning!
🤬1💩1🍌1
"Problem of the Day"
Solve this question to get points
Given a string 's'. The task is to find the smallest window length that contains all the characters of the given string at least one time.
Full Problem: https://bit.ly/3zGsqHG
Solve this question to get points
Given a string 's'. The task is to find the smallest window length that contains all the characters of the given string at least one time.
Full Problem: https://bit.ly/3zGsqHG
practice.geeksforgeeks.org
Smallest distinct window | Practice | GeeksforGeeks
Given a string 's'. The task is to find the smallest window length that contains all the characters of the given string at least one time.
For eg. A = aabcbcdbca, then the result would be 4 as of the smallest window will be dbca.
&nb
For eg. A = aabcbcdbca, then the result would be 4 as of the smallest window will be dbca.
&nb
jQuery is an open-source, feature-rich JavaScript library, that makes the easy interaction between the HTML & CSS document, Document Object Model (DOM), and JavaScript. The jQuery Cheat Sheet will give quick ideas related to the topics which will provide you a gist of jQuery with basic implementation.
Take a look at this cheat sheet in this article.
Read more here: https://bit.ly/3xsmPlB
Take a look at this cheat sheet in this article.
Read more here: https://bit.ly/3xsmPlB
"Problem of the Day"
Solve this question to get points
Given an adjacency list of a graph adj of V no. of vertices having 0 based index. Check whether the graph is bipartite or not.
Full Problem: https://bit.ly/3xY1cem
Solve this question to get points
Given an adjacency list of a graph adj of V no. of vertices having 0 based index. Check whether the graph is bipartite or not.
Full Problem: https://bit.ly/3xY1cem
practice.geeksforgeeks.org
Bipartite Graph | Practice | GeeksforGeeks
Given an adjacency list of a graph adj of V no. of vertices having 0 based index. Check whether the graph is bipartite or not.
Example 1:
Input:
Output: 1
Explanation: The given graph can be colored
in two colors so,
Example 1:
Input:
Output: 1
Explanation: The given graph can be colored
in two colors so,
If you are a seeker of potential career growth (who isn’t), you must be familiar with LinkedIn. To use any source to its maximum potential, you must be aware of its functionalities.
With this article, we aim to provide you with some great tips to leverage the benefits of LinkedIn. Here we have some great tips to help you greatly increase your LinkedIn engagement.
Read more in the article: https://bit.ly/3mYYnDL
With this article, we aim to provide you with some great tips to leverage the benefits of LinkedIn. Here we have some great tips to help you greatly increase your LinkedIn engagement.
Read more in the article: https://bit.ly/3mYYnDL
"Problem of the Day"
Solve this question to get points
Given an N x M matrix, with a few hurdles(denoted by 0) arbitrarily placed, calculate the length of the longest possible route possible from source(xs,ys) to a destination(xd,yd) within the matrix.
Full Problem: https://bit.ly/3N3UFmW
Solve this question to get points
Given an N x M matrix, with a few hurdles(denoted by 0) arbitrarily placed, calculate the length of the longest possible route possible from source(xs,ys) to a destination(xd,yd) within the matrix.
Full Problem: https://bit.ly/3N3UFmW
practice.geeksforgeeks.org
Longest Possible Route in a Matrix with Hurdles | Practice | GeeksforGeeks
Given an N x M matrix, with a few hurdles(denoted by 0) arbitrarily placed, calculate the length of the longest possible route possible from source(xs,ys) to a destination(xd,yd) within the matrix. We are allowed to move to only adjacent ce
Buckle up! Your Weekly Quiz is here.
Test your DSA concepts with "DSA Using Python" quiz. Solve these MCQs and win assured rewards.
You can submit your entry by 19th June, 11:59 PM.
Participate now: https://forms.gle/U5xV8zFkFy6ysujn7
Test your DSA concepts with "DSA Using Python" quiz. Solve these MCQs and win assured rewards.
You can submit your entry by 19th June, 11:59 PM.
Participate now: https://forms.gle/U5xV8zFkFy6ysujn7
"Problem of the Day"
Solve this question to get points
Given a linked list and positions m and n. Reverse the linked list from position m to n.
Full Problem: https://practice.geeksforgeeks.org/problems/reverse-a-sublist-of-a-linked-list/1
Solve this question to get points
Given a linked list and positions m and n. Reverse the linked list from position m to n.
Full Problem: https://practice.geeksforgeeks.org/problems/reverse-a-sublist-of-a-linked-list/1
practice.geeksforgeeks.org
Reverse a sublist of a linked list | Practice | GeeksforGeeks
Given a linked list and positions m and n. Reverse the linked list from position m to n.
Example 1:
Input :
N = 10
Linked List = 1->7->5->3->9->8->10
->2->2->5->NULL
m = 1, n = 8
Output
Example 1:
Input :
N = 10
Linked List = 1->7->5->3->9->8->10
->2->2->5->NULL
m = 1, n = 8
Output
"Problem of the Day"
Solve this question to get points
You are given an equation of the form x1+x2+...+xN=K. You need to find the total number of positive integral solutions of this equation.
Full Problem: https://bit.ly/3MZ4RNu
Solve this question to get points
You are given an equation of the form x1+x2+...+xN=K. You need to find the total number of positive integral solutions of this equation.
Full Problem: https://bit.ly/3MZ4RNu
www.geeksforgeeks.org
Number of positive integral solutions | Practice | GeeksforGeeks
You are given an equation of the form x1+x2+...+xN=K. You need to find the total number of positive integral solutions of this equation.
Example 1:
Input: s = a+b=5
Output: 4
Explanation: (4,1) , (1,4) , (2,3) , (3,2)
Example
Example 1:
Input: s = a+b=5
Output: 4
Explanation: (4,1) , (1,4) , (2,3) , (3,2)
Example
Job-a-thon 10 is here with some great job opportunities for you. Get a chance to work at these mentioned companies and kick-start your tech career.
Go to the link to know more in detail. Happening on 21st June.
To register now: https://practice.geeksforgeeks.org/contest/job-a-thon-10-hiring-challenge?utm_source=SM&utm_medium=TELEGRAM&utm_campaign=jobathon_10
Go to the link to know more in detail. Happening on 21st June.
To register now: https://practice.geeksforgeeks.org/contest/job-a-thon-10-hiring-challenge?utm_source=SM&utm_medium=TELEGRAM&utm_campaign=jobathon_10
"Problem of the Day"
Solve this question to get points
Given a binary tree. Find the size of its largest subtree that is a Binary Search Tree.
Note: Here Size is equal to the number of nodes in the subtree.
Full Problem: https://bit.ly/3xKM2rw
Solve this question to get points
Given a binary tree. Find the size of its largest subtree that is a Binary Search Tree.
Note: Here Size is equal to the number of nodes in the subtree.
Full Problem: https://bit.ly/3xKM2rw
practice.geeksforgeeks.org
Largest BST | Practice | GeeksforGeeks
Given a binary tree. Find the size of its largest subtree that is a Binary Search Tree.
Note: Here Size is equal to the number of nodes in the subtree.
Example 1:
Input:
1
/ \
4 4
/ \
6
Note: Here Size is equal to the number of nodes in the subtree.
Example 1:
Input:
1
/ \
4 4
/ \
6
👍1