"Problem of the Day"
Solve this question to get points
Given a grid with dimensions r x c, the two players (say JON and ARYA ) can move the coin over the grid satisfying the following rules:
Full Problem: https://practice.geeksforgeeks.org/problems/moving-on-grid1135/1
Solve this question to get points
Given a grid with dimensions r x c, the two players (say JON and ARYA ) can move the coin over the grid satisfying the following rules:
Full Problem: https://practice.geeksforgeeks.org/problems/moving-on-grid1135/1
practice.geeksforgeeks.org
Moving on grid | Practice | GeeksforGeeks
Given a grid with dimensions r x c, the two players (say JON and ARYA ) can move the coin over the grid satisfying the following rules:
There is a coin on (1,1) cell initially.
JON will move first.
Both will play on
There is a coin on (1,1) cell initially.
JON will move first.
Both will play on
Here's a perfect way to boost your SDE interview preparation.
On Sunday, 17th April, self-evaluate yourself on the basis of recent interviews. Start preparing and start boosting your preparation.
Register now: https://bit.ly/InterviewSeries46
On Sunday, 17th April, self-evaluate yourself on the basis of recent interviews. Start preparing and start boosting your preparation.
Register now: https://bit.ly/InterviewSeries46
"Problem of the Day"
Solve this question to get points
Given a 2D matrix M of dimensions RxC. Find the maximum sum submatrix in it.
Full Problem: https://practice.geeksforgeeks.org/problems/maximum-sum-rectangle2948/1
Solve this question to get points
Given a 2D matrix M of dimensions RxC. Find the maximum sum submatrix in it.
Full Problem: https://practice.geeksforgeeks.org/problems/maximum-sum-rectangle2948/1
practice.geeksforgeeks.org
Maximum sum Rectangle | Practice | GeeksforGeeks
Given a 2D matrix M of dimensions RxC. Find the maximum sum submatrix in it.
Example 1:
Input:
R=4
C=5
M=[[1,2,-1,-4,-20],
[-8,-3,4,2,1],
[3,8,10,1,3],
[-4,-1,1,7,-6]]
Output:
29
Explanation:
The matrix is as follows and the
blue r
Example 1:
Input:
R=4
C=5
M=[[1,2,-1,-4,-20],
[-8,-3,4,2,1],
[3,8,10,1,3],
[-4,-1,1,7,-6]]
Output:
29
Explanation:
The matrix is as follows and the
blue r
Please Anarkali, this is not a joke anymore. 😞
Don't know if Anarkali can make it up to the Job-A-Thon 8.0, but you surely can. Go to the link and register yourself now. Happening on 21st April 2022, 8:00 to 10:30 PM IST.
To register now: https://bit.ly/job-a-thon8
Don't know if Anarkali can make it up to the Job-A-Thon 8.0, but you surely can. Go to the link and register yourself now. Happening on 21st April 2022, 8:00 to 10:30 PM IST.
To register now: https://bit.ly/job-a-thon8
"Problem of the Day"
Solve this question to get points
Given an array nums[] of size n, where nums[i] denotes the number of characters in one word.
Full Problem: https://practice.geeksforgeeks.org/problems/word-wrap1646/1
Solve this question to get points
Given an array nums[] of size n, where nums[i] denotes the number of characters in one word.
Full Problem: https://practice.geeksforgeeks.org/problems/word-wrap1646/1
practice.geeksforgeeks.org
Word Wrap | Practice | GeeksforGeeks
Given an array nums[] of size n, where nums[i] denotes the number of characters in one word. Let K be the limit on the number of characters that can be put in one line (line width). Put line breaks in the given sequence
Tired of trying and trying again? 🤦♂️😥
Here comes the Job Opportunities of the month. Get yourself enrolled in this month's Job-A-Thon and grab what you've waited for!!
For more details and register: https://bit.ly/job-a-thon8
Here comes the Job Opportunities of the month. Get yourself enrolled in this month's Job-A-Thon and grab what you've waited for!!
For more details and register: https://bit.ly/job-a-thon8
"Problem of the Day"
Solve this question to get points
Given a number num, our task is to find the closest Palindrome number whose absolute difference with given number is minimum.
Full Problem: https://practice.geeksforgeeks.org/problems/closest-palindrome4519/1
Solve this question to get points
Given a number num, our task is to find the closest Palindrome number whose absolute difference with given number is minimum.
Full Problem: https://practice.geeksforgeeks.org/problems/closest-palindrome4519/1
practice.geeksforgeeks.org
Closest Palindrome | Practice | GeeksforGeeks
Given a number num, our task is to find the closest Palindrome number whose absolute difference with given number is minimum. If 2 Palindome numbers have same absolute difference from the given number, then find the smaller one.
"Problem of the Day"
Solve this question to get points
Find the number of leaf nodes in a full k-ary tree of height m.
Note: You have to return the answer module 109+7.
Full Problem: https://practice.geeksforgeeks.org/problems/k-ary-tree1235/1
Solve this question to get points
Find the number of leaf nodes in a full k-ary tree of height m.
Note: You have to return the answer module 109+7.
Full Problem: https://practice.geeksforgeeks.org/problems/k-ary-tree1235/1
practice.geeksforgeeks.org
K-Ary Tree | Practice | GeeksforGeeks
Find the number of leaf nodes in a full k-ary tree of height m.
Note: You have to return the answer module 109+7.
Example 1:
Input:
k = 2, m = 2
Output:
4
Explanation:
A full Binary tree of height 2 has 4 leaf nodes.
Example 2:
Input:
Note: You have to return the answer module 109+7.
Example 1:
Input:
k = 2, m = 2
Output:
4
Explanation:
A full Binary tree of height 2 has 4 leaf nodes.
Example 2:
Input:
With this project, we are going to develop real-time human face detection in Python using OpenCV.
Face Recognition is a part of computer vision where we locate and visualize the faces using ML models in any digital image and OpenCV contains many pre-trained classifiers for face, eyes, smiles, etc. So, let's get started.
To watch the video: https://bit.ly/3uQE7Ja
Face Recognition is a part of computer vision where we locate and visualize the faces using ML models in any digital image and OpenCV contains many pre-trained classifiers for face, eyes, smiles, etc. So, let's get started.
To watch the video: https://bit.ly/3uQE7Ja
"Problem of the Day"
Solve this question to get points
Given a linked list and a value x, partition it such that all nodes less than x come first, then all nodes with value equal to x and finally nodes with value greater than or equal to x.
Full Problem: https://practice.geeksforgeeks.org/problems/partition-a-linked-list-around-a-given-value/1
Solve this question to get points
Given a linked list and a value x, partition it such that all nodes less than x come first, then all nodes with value equal to x and finally nodes with value greater than or equal to x.
Full Problem: https://practice.geeksforgeeks.org/problems/partition-a-linked-list-around-a-given-value/1
practice.geeksforgeeks.org
Partition a Linked List around a given value | Practice | GeeksforGeeks
Given a linked list and a value x, partition it such that all nodes less than x come first, then all nodes with value equal to x and finally nodes with value greater than x. The original relative order of the nodes in each of the three partitions sho
👍1
Looking for a job opportunity? Here comes the Job-A-Thon 8.0. Tell us, among the following companies, how many of these will you be applying in?
Anonymous Poll
52%
NEC Corporation
49%
Walkover
53%
SuperK
49%
HeadStrait
46%
Moengage
52%
Digit Insurance
"Problem of the Day"
Solve this question to get points
The worlds most successful thief Albert Spaggiari was planning for his next heist on the world bank.
Full Problem: https://practice.geeksforgeeks.org/problems/theft-at-the-world-bank2156/1
Solve this question to get points
The worlds most successful thief Albert Spaggiari was planning for his next heist on the world bank.
Full Problem: https://practice.geeksforgeeks.org/problems/theft-at-the-world-bank2156/1
practice.geeksforgeeks.org
Theft at World Bank | Practice | GeeksforGeeks
The worlds most successful thief Albert Spaggiari was planning for his next heist on the world bank. He decides to carry a sack with him, which can carry a maximum weight of C kgs. Inside the world bank there were N large blocks of gold. Al
Get a chance to work at these amazing companies.😍 All you need to do is get enrolled in any of these and start preparing to grab this opportunity to start your career right. ✔
Happening on 21st April, 8:00 to 10:30 PM IST. Hurry!
Go to the link and enroll now: https://bit.ly/job-a-thon8
Happening on 21st April, 8:00 to 10:30 PM IST. Hurry!
Go to the link and enroll now: https://bit.ly/job-a-thon8
"Problem of the Day"
Solve this question to get points
Given a string s, remove all its adjacent duplicate characters recursively.
Full Problem: https://bit.ly/3jUny90
Solve this question to get points
Given a string s, remove all its adjacent duplicate characters recursively.
Full Problem: https://bit.ly/3jUny90
practice.geeksforgeeks.org
Recursively remove all adjacent duplicates | Practice | GeeksforGeeks
Given a string s, remove all its adjacent duplicate characters recursively.
Example 1:
Input:
S = "geeksforgeek"
Output: "gksforgk"
Explanation:
g(ee)ksforg(ee)k -> gksforgk
Example 2:
Input:
S =
Example 1:
Input:
S = "geeksforgeek"
Output: "gksforgk"
Explanation:
g(ee)ksforg(ee)k -> gksforgk
Example 2:
Input:
S =
As we’re moving towards the era of DATA, Python is becoming the most dominant in the world of computer programming and with the number of users growing around the world, the IDEs started taking up many different tasks.
So, with this article, let's delve into the best IDEs for python in 2022 that you can use to enhance the software capabilities.
Read more here: https://bit.ly/3v1rLhj
So, with this article, let's delve into the best IDEs for python in 2022 that you can use to enhance the software capabilities.
Read more here: https://bit.ly/3v1rLhj
"Problem of the Day"
Solve this question to get points
Given two integers a and b. Find the sum of two numbers without using arithmetic operators.
Full Problem: https://bit.ly/3v400oi
Solve this question to get points
Given two integers a and b. Find the sum of two numbers without using arithmetic operators.
Full Problem: https://bit.ly/3v400oi
practice.geeksforgeeks.org
Sum of two numbers without using arithmetic operators | Practice | GeeksforGeeks
Given two integers a and b. Find the sum of two numbers without using arithmetic operators.
Example 1:
Input:
a = 5, b = 3
Output: 8
Explanation :
5 + 3 = 8
Example 2:
Input:
a = 10, b = 30
Output: 40
Explanation:
10 + 30
Example 1:
Input:
a = 5, b = 3
Output: 8
Explanation :
5 + 3 = 8
Example 2:
Input:
a = 10, b = 30
Output: 40
Explanation:
10 + 30
Watch this video, where we are going to cover KNN implementation using Python with examples to predict the stocks.
We will cover stock data prediction using classification and regression problems and one of the most significant classification methods in Machine Learning i.e. KNN or K-Nearest Neighbors.
Go to the link and let's get started: https://bit.ly/36BHVEX
We will cover stock data prediction using classification and regression problems and one of the most significant classification methods in Machine Learning i.e. KNN or K-Nearest Neighbors.
Go to the link and let's get started: https://bit.ly/36BHVEX
"Problem of the Day"
Solve this question to get points
Given a sorted array Arr[](0-index based) consisting of N distinct integers and an integer k, the task is to find the index of k, if it’s present in the array Arr[].
Full Problem: https://bit.ly/3va2Zfg
Solve this question to get points
Given a sorted array Arr[](0-index based) consisting of N distinct integers and an integer k, the task is to find the index of k, if it’s present in the array Arr[].
Full Problem: https://bit.ly/3va2Zfg
practice.geeksforgeeks.org
Search insert position of K in a sorted array | Practice | GeeksforGeeks
Given a sorted array Arr[](0-index based) consisting of N distinct integers and an integer k, the task is to find the index of k, if it’s present in the array Arr[]. Otherwise, find the index where k must be inserted to
"Problem of the Day"
Solve this question to get points
Given two numbers L and R (inclusive) find the product of primes within this range. Print the product modulo 109+7. If there are no primes in that range you must print 1.
Full Problem: https://bit.ly/37ym3Lf
Solve this question to get points
Given two numbers L and R (inclusive) find the product of primes within this range. Print the product modulo 109+7. If there are no primes in that range you must print 1.
Full Problem: https://bit.ly/37ym3Lf
practice.geeksforgeeks.org
Product of Primes | Practice | GeeksforGeeks
Given two numbers L and R (inclusive) find the product of primes within this range. Print the product modulo 109+7. If there are no primes in that range you must print 1.
Example 1:
Input: L = 1, R = 10
Output: 210
Explaination: The pr
Example 1:
Input: L = 1, R = 10
Output: 210
Explaination: The pr
"Problem of the Day"
Solve this question to get points
In a given cartesian plane, there are N points. We need to find the Number of Pairs of points(A, B) such that
Point A and Point B do not coincide.
Manhattan Distance and the Euclidean Distance between the points should be equal.
Full Problem: https://bit.ly/3L7AaWd
Solve this question to get points
In a given cartesian plane, there are N points. We need to find the Number of Pairs of points(A, B) such that
Point A and Point B do not coincide.
Manhattan Distance and the Euclidean Distance between the points should be equal.
Full Problem: https://bit.ly/3L7AaWd
www.geeksforgeeks.org
Pairs of Non Coinciding Points | Practice | GeeksforGeeks
In a given cartesian plane, there are N points. We need to find the Number of Pairs of points(A, B) such that
Point A and Point B do not coincide.
Manhattan Distance and the Euclidean Distance between the points should be equal.
Point A and Point B do not coincide.
Manhattan Distance and the Euclidean Distance between the points should be equal.