Skill-Dependence Days are back!!🇮🇳
Join our DSA Self Paced & get ready to become skill-dependent! 💻
Use Coupon “SDDOOTD3“ to get an instant 20% discount valid till 15th August 2022, 11:59 PM IST.
Also, get Cashback Voucher worth INR 1000 applicable on all GFG Courses 💫
📍Course Link: https://bit.ly/3C0m1Zn
Join our DSA Self Paced & get ready to become skill-dependent! 💻
Use Coupon “SDDOOTD3“ to get an instant 20% discount valid till 15th August 2022, 11:59 PM IST.
Also, get Cashback Voucher worth INR 1000 applicable on all GFG Courses 💫
📍Course Link: https://bit.ly/3C0m1Zn
"Problem of the Day"
Solve this question to get points.
A(X) for positive integer X is the sum of factorials of its digits. For example, A(154) = 1! + 5! + 4!= 145.
Full Problem: https://practice.geeksforgeeks.org/problems/fact-digit-sum4125/1
Solve this question to get points.
A(X) for positive integer X is the sum of factorials of its digits. For example, A(154) = 1! + 5! + 4!= 145.
Full Problem: https://practice.geeksforgeeks.org/problems/fact-digit-sum4125/1
practice.geeksforgeeks.org
Fact Digit Sum | Practice | GeeksforGeeks
A(X) for positive integer X is the sum of factorials of its digits. For example, A(154) = 1! + 5! + 4!= 145.
Given a number N, find the minimum number X such that A(X) = N. You have to return a list of digits (without leading zer
Given a number N, find the minimum number X such that A(X) = N. You have to return a list of digits (without leading zer
👍1
We are well aware of the fact that data structures do build a strong foundation for tech interview preparation & competitive programming.
With this complete guide, we'll be deep diving into the linked list, a linear data structure that looks like a chain of nodes. So, let's get started.
Link to the tutorial: https://bit.ly/3AnXxaV
With this complete guide, we'll be deep diving into the linked list, a linear data structure that looks like a chain of nodes. So, let's get started.
Link to the tutorial: https://bit.ly/3AnXxaV
👍4
"Problem of the Day"
Solve this question to get points.
Given a square chessboard, the initial position of Knight and position of a target. Find out the minimum steps a Knight will take to reach the target position
Full Problem: https://bit.ly/3w8Ij7g
Solve this question to get points.
Given a square chessboard, the initial position of Knight and position of a target. Find out the minimum steps a Knight will take to reach the target position
Full Problem: https://bit.ly/3w8Ij7g
practice.geeksforgeeks.org
Knight Walk | Practice | GeeksforGeeks
Given a square chessboard, the initial position of Knight and position of a target. Find out the minimum steps a Knight will take to reach the target position.If it cannot reach the target position return -1.
Note:
The initial and the target posi
Note:
The initial and the target posi
👍1
The next topic, we are going to cover in SDE interview preparation is Matrix.
So, a matrix simply represents a collection of numbers arranged in an order of rows and columns. It is necessary to enclose the elements of a matrix in parentheses or brackets.
In Matrix also, there are numerous concepts for you to understand. Look at them one by one.
Let's start with Rotate Matrix Elements: https://bit.ly/3QLeqCx
Practice Rotate a Matrix with the below problem: Given two integers M, N, and a 2D matrix Mat of dimensions MxN, clockwise rotate the elements in it.
Full Problem: https://bit.ly/3K0adrO
You can find more topics in the main article.
The link to the main article: https://bit.ly/3z3UfrD
So, a matrix simply represents a collection of numbers arranged in an order of rows and columns. It is necessary to enclose the elements of a matrix in parentheses or brackets.
In Matrix also, there are numerous concepts for you to understand. Look at them one by one.
Let's start with Rotate Matrix Elements: https://bit.ly/3QLeqCx
Practice Rotate a Matrix with the below problem: Given two integers M, N, and a 2D matrix Mat of dimensions MxN, clockwise rotate the elements in it.
Full Problem: https://bit.ly/3K0adrO
You can find more topics in the main article.
The link to the main article: https://bit.ly/3z3UfrD
👍7
"Problem of the Day"
Solve this question to get points.
Given an array containing N integers and an integer K., Your task is to find the length of the longest Sub-Array with the sum of the elements equal to the given value K.
Full Problem: https://practice.geeksforgeeks.org/problems/longest-sub-array-with-sum-k0809/1
Solve this question to get points.
Given an array containing N integers and an integer K., Your task is to find the length of the longest Sub-Array with the sum of the elements equal to the given value K.
Full Problem: https://practice.geeksforgeeks.org/problems/longest-sub-array-with-sum-k0809/1
www.geeksforgeeks.org
Longest Subarray with Sum K | Practice | GeeksforGeeks
Given an array arr[] containing integers and an integer k, your task is to find the length of the longest subarray where the sum of its elements is equal to the given value k. If there is no subarray with sum equal to k, return 0.
Examples:
Examples:
"Problem of the Day"
Solve this question to get points.
Given a grid of dimension nxm containing 0s and 1s. Find the unit area of the largest region of 1s.
Full Problem: https://practice.geeksforgeeks.org/problems/length-of-largest-region-of-1s-1587115620/1
Solve this question to get points.
Given a grid of dimension nxm containing 0s and 1s. Find the unit area of the largest region of 1s.
Full Problem: https://practice.geeksforgeeks.org/problems/length-of-largest-region-of-1s-1587115620/1
practice.geeksforgeeks.org
Unit Area of largest region of 1's | Practice | GeeksforGeeks
Given a grid of dimension nxm containing 0s and 1s. Find the unit area of the largest region of 1s.
Region of 1's is a group of 1's connected 8-directionally (horizontally, vertically, diagonally).
Example 1:
Input: grid
Region of 1's is a group of 1's connected 8-directionally (horizontally, vertically, diagonally).
Example 1:
Input: grid
👍1👎1
Students these days are more focused on gaining hands-on experience in their desired field, and making connections in the industry is a must.
An internship can be a great opportunity to learn and grow, but there definitely are a few things you need to take care of.
To make your first impression a good one, read more here: https://bit.ly/3QERnt0
An internship can be a great opportunity to learn and grow, but there definitely are a few things you need to take care of.
To make your first impression a good one, read more here: https://bit.ly/3QERnt0
"Problem of the Day"
Solve this question to get points.
Given two strings denoting non-negative numbers X and Y. Calculate the sum of X and Y.
Full Problem: https://practice.geeksforgeeks.org/problems/sum-of-numbers-or-number1219/1
Solve this question to get points.
Given two strings denoting non-negative numbers X and Y. Calculate the sum of X and Y.
Full Problem: https://practice.geeksforgeeks.org/problems/sum-of-numbers-or-number1219/1
practice.geeksforgeeks.org
Sum of two large numbers | Practice | GeeksforGeeks
Given two strings denoting non-negative numbers X and Y. Calculate the sum of X and Y.
Example 1:
Input:
X = "25", Y = "23"
Output:
48
Explanation:
The sum of 25 and 23 is 48.
Example 2:
Input:
X = "2
Example 1:
Input:
X = "25", Y = "23"
Output:
48
Explanation:
The sum of 25 and 23 is 48.
Example 2:
Input:
X = "2
🥰2
Problem of the Day"
Solve this question to get points.
You are given an array arr[], you have to re-construct an array arr[].
Full Problem: https://practice.geeksforgeeks.org/problems/game-with-nos3123/1
Solve this question to get points.
You are given an array arr[], you have to re-construct an array arr[].
Full Problem: https://practice.geeksforgeeks.org/problems/game-with-nos3123/1
www.geeksforgeeks.org
Game with nos | Practice | GeeksforGeeks
You are given an array arr[], and you have to re-construct an array arr[].
The values in arr[] are obtained by doing Xor of consecutive elements in the array.
Example 1:
Input : n=5, arr[ ] = {10, 11, 1, 2, 3}
Output : 1 10 3 1 3
Expl
The values in arr[] are obtained by doing Xor of consecutive elements in the array.
Example 1:
Input : n=5, arr[ ] = {10, 11, 1, 2, 3}
Output : 1 10 3 1 3
Expl
👍1
This media is not supported in your browser
VIEW IN TELEGRAM
Be the super geeks and make your way to your dream job with the superpower of JOB-A-Thon.
Happening every 21st of the month.
To participate in this month's JOB-A-Thon 12 and to know more in detail: https://practice.geeksforgeeks.org/contest/job-a-thon-12-hiring-challenge?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=jobathon12
Happening every 21st of the month.
To participate in this month's JOB-A-Thon 12 and to know more in detail: https://practice.geeksforgeeks.org/contest/job-a-thon-12-hiring-challenge?utm_source=telegram&utm_medium=marketingteam_telegram&utm_campaign=jobathon12
🔥3
"Problem of the Day"
Solve this question to get points.
Given an integer array Arr of size N. For each element in the array, check whether the right adjacent element (on the next immediate position) of the array is smaller.
Full Problem: https://bit.ly/3Kdi7hv
Solve this question to get points.
Given an integer array Arr of size N. For each element in the array, check whether the right adjacent element (on the next immediate position) of the array is smaller.
Full Problem: https://bit.ly/3Kdi7hv
practice.geeksforgeeks.org
Immediate Smaller Element | Practice | GeeksforGeeks
Given an integer array Arr of size N. For each element in the array, check whether the right adjacent element (on the next immediate position) of the array is smaller. If next element is smaller, update the current index to that element.&nb
👍1🔥1
Understanding concepts and building a strong foundation is a must for any interview preparation.
Therefore, we have come up with this complete guide on strings, where you will deep dive into the arrays of characters.
To get started: https://bit.ly/3Ahkvzz
Therefore, we have come up with this complete guide on strings, where you will deep dive into the arrays of characters.
To get started: https://bit.ly/3Ahkvzz
👍4❤2🔥1👏1
"Problem of the Day"
Solve this question to get points.
Given a binary tree, check if the tree can be folded or not. A tree can be folded if left and right subtrees of the tree are structure wise same.
Full Problem: https://bit.ly/3KdpGot
Solve this question to get points.
Given a binary tree, check if the tree can be folded or not. A tree can be folded if left and right subtrees of the tree are structure wise same.
Full Problem: https://bit.ly/3KdpGot
practice.geeksforgeeks.org
Foldable Binary Tree | Practice | GeeksforGeeks
Given a binary tree, check if the tree can be folded or not. A tree can be folded if left and right subtrees of the tree are structure wise same. An empty tree is considered as foldable.
Consider the below trees:
(a) and (b) can be folded.
(c) and
Consider the below trees:
(a) and (b) can be folded.
(c) and
Opportunities keep knocking at your doorstep, all you need to do is to give it your best shot.
Wipro, a leading technology, service, and consulting company has come up with National Talent Hunt (NTH) program for young engineering graduates. So, if you're a fresher and aiming for Wipro, then this coding sheet is just right for you.
This coding sheet is specially curated for young engineering graduates that will provide you with a complete roadmap.
Check out the coding sheet for interview preparation: https://bit.ly/3TbFaO4
Wipro, a leading technology, service, and consulting company has come up with National Talent Hunt (NTH) program for young engineering graduates. So, if you're a fresher and aiming for Wipro, then this coding sheet is just right for you.
This coding sheet is specially curated for young engineering graduates that will provide you with a complete roadmap.
Check out the coding sheet for interview preparation: https://bit.ly/3TbFaO4
Build the strong basics of C++ and brush up on all the industry-required topics with this offer.
Get 20% Off on C++ STL. Use the coupon code "CPPSTL20" till 24th August,11:59 PM IST.
To grab this offer: https://bit.ly/3wqXKI9
Get 20% Off on C++ STL. Use the coupon code "CPPSTL20" till 24th August,11:59 PM IST.
To grab this offer: https://bit.ly/3wqXKI9
"Problem of the Day"
Solve this question to get points.
Given a string S containing only digits, Your task is to complete the function genIp() which returns a vector containing all possible combinations of valid IPv4 IP addresses and takes only a string S as its only argument.
Full Problem: https://bit.ly/3KgxvK5
Solve this question to get points.
Given a string S containing only digits, Your task is to complete the function genIp() which returns a vector containing all possible combinations of valid IPv4 IP addresses and takes only a string S as its only argument.
Full Problem: https://bit.ly/3KgxvK5
practice.geeksforgeeks.org
Generate IP Addresses | Practice | GeeksforGeeks
Given a string S containing only digits, Your task is to complete the function genIp() which returns a vector containing all possible combinations of valid IPv4 IP addresses and takes only a string S as its only argument.
Note: O
Note: O
👍1
Learning and implementing what you've learned are two different but important things.
Today, we're going to create a robust Android App that implements a RecyclerView with a SearchView and also a filter to organize the results.
To watch the video: https://bit.ly/3chHVfW
Today, we're going to create a robust Android App that implements a RecyclerView with a SearchView and also a filter to organize the results.
To watch the video: https://bit.ly/3chHVfW
"Problem of the Day"
Solve this question to get points.
Given two unsorted arrays arr1[] and arr2[]. They may contain duplicates. For each element in arr1[] count elements less than or equal to it in array arr2[].
Full Problem: https://bit.ly/3AiXEU9
Solve this question to get points.
Given two unsorted arrays arr1[] and arr2[]. They may contain duplicates. For each element in arr1[] count elements less than or equal to it in array arr2[].
Full Problem: https://bit.ly/3AiXEU9
practice.geeksforgeeks.org
Minimum number of jumps | Practice | GeeksforGeeks
Given an array of N integers arr[] where each element represents the max length of the jump that can be made forward from that element. Find the minimum number of jumps to reach the end of the array (starting from the first element). If an