CSS is a stylesheet language used to describe the presentation of a document that enhances the look and feel of the webpage by describing how elements should be rendered on screen or in other media.
This CSS Cheat Sheet provides you with the most of all that you need to know. Go to the link and know in detail.
Read more here: https://bit.ly/3OVu11F
This CSS Cheat Sheet provides you with the most of all that you need to know. Go to the link and know in detail.
Read more here: https://bit.ly/3OVu11F
Watch this mock interview to evaluate your strengths & weaknesses alike.π€
A great way for self-examination, make sure to formulate your tactics before your next interview! In this webinar, we have Ms.Tejaswini,πββοΈ who will be interviewed by Siddhartha Hazra, our in-house mentor at GeeksforGeeks.
Join the live stream at 7:00 PM IST today: https://youtu.be/mwqKJz7K03k
A great way for self-examination, make sure to formulate your tactics before your next interview! In this webinar, we have Ms.Tejaswini,πββοΈ who will be interviewed by Siddhartha Hazra, our in-house mentor at GeeksforGeeks.
Join the live stream at 7:00 PM IST today: https://youtu.be/mwqKJz7K03k
"Problem of the Day"
Solve this question to get points
Given a number (as string) and two integers a and b, divide the string in two non-empty parts such that the first part is divisible by a and the second part is divisible by b.
Full Problem: https://bit.ly/3kJG0Bs
Solve this question to get points
Given a number (as string) and two integers a and b, divide the string in two non-empty parts such that the first part is divisible by a and the second part is divisible by b.
Full Problem: https://bit.ly/3kJG0Bs
practice.geeksforgeeks.org
Partition a number into two divisible parts | Practice | GeeksforGeeks
Given a number (as string) and two integers a and b, divide the string in two non-empty parts such that the first part is divisible by a and the second part is divisible by b. In case multiple answers exist, return the string such that the first non-
What you say!
Yes, Poll for your answers and let us know out of the below mentioned, what kind of content you guys want more of.
Yes, Poll for your answers and let us know out of the below mentioned, what kind of content you guys want more of.
Anonymous Poll
47%
Informational Articles
27%
Live Streams ( Articles)
65%
Coding Quizzes
π1
"Problem of the Day"
Solve this question to get points
Captain America is hiding from Thanos in a maze full of rooms.
The maze is designed in such a way that the room, within it, leads to another room via gate.
Full Problem: https://bit.ly/39GPw6h
Solve this question to get points
Captain America is hiding from Thanos in a maze full of rooms.
The maze is designed in such a way that the room, within it, leads to another room via gate.
Full Problem: https://bit.ly/39GPw6h
practice.geeksforgeeks.org
Kill Captain America | Practice | GeeksforGeeks
Captain America is hiding from Thanos in a maze full of N rooms connected by M gates.
The maze is designed in such a way that each room leads to another room via gates. All connecting gates are unidirectional. Captain America is hiding only in
The maze is designed in such a way that each room leads to another room via gates. All connecting gates are unidirectional. Captain America is hiding only in
π1
The challenge that every coder faces at the beginning of the journey is which website to go to for such coding challenges and competitions, which is the best website for coding competitions, what is the benefit of attending a competitive coding competition, and many more.
To test yourselves, we have curated the top websites for coding challenges and competitions.
To read more, click here: https://bit.ly/3wfdugG
To test yourselves, we have curated the top websites for coding challenges and competitions.
To read more, click here: https://bit.ly/3wfdugG
"Problem of the Day"
Solve this question to get points
Given two sorted linked lists consisting of N and M nodes respectively. The task is to merge both of the list (in-place) and return head of the merged list.
Full Problem: https://bit.ly/3kKIEai
Solve this question to get points
Given two sorted linked lists consisting of N and M nodes respectively. The task is to merge both of the list (in-place) and return head of the merged list.
Full Problem: https://bit.ly/3kKIEai
practice.geeksforgeeks.org
Merge two sorted linked lists | Practice | GeeksforGeeks
Given two sorted linked lists consisting of N and M nodes respectively. The task is to merge both of the list (in-place) and return head of the merged list.
Example 1:
Input:
N = 4, M = 3
valueN[] = {5,10,15,40}
valueM[] = {2,3,20}
Ou
Example 1:
Input:
N = 4, M = 3
valueN[] = {5,10,15,40}
valueM[] = {2,3,20}
Ou
"Problem of the Day"
Solve this question to get points
Given two sorted arrays A and B of length L1 and L2, we can get a set of sums(add one element from the first and one from second).
Full Problem: https://practice.geeksforgeeks.org/problems/nth-item-through-sum3544/1
Solve this question to get points
Given two sorted arrays A and B of length L1 and L2, we can get a set of sums(add one element from the first and one from second).
Full Problem: https://practice.geeksforgeeks.org/problems/nth-item-through-sum3544/1
practice.geeksforgeeks.org
Nth item through sum | Practice | GeeksforGeeks
Given two sorted arrays A and B of length L1 and L2, we can get a set of sums(add one element from the first and one from second). Find the Nth element in the set considered in sorted order.
Note: Set of sums should have unique elements.
Note: Set of sums should have unique elements.
"Problem of the Day"
Solve this question to get points
Given an NxN chessboard and a Knight at position (x, y). The Knight has to take exactly K steps, where at each step it chooses any of the 8 directions uniformly at random.
Full Problem: https://bit.ly/3yEfVw7
Solve this question to get points
Given an NxN chessboard and a Knight at position (x, y). The Knight has to take exactly K steps, where at each step it chooses any of the 8 directions uniformly at random.
Full Problem: https://bit.ly/3yEfVw7
practice.geeksforgeeks.org
Probability of Knight | Practice | GeeksforGeeks
Given an NxN chessboard and a Knight at position (x, y). The Knight has to take exactly K steps, where at each step it chooses any of the 8 directions uniformly at random. Find the probability that the Knight remains in the chessboard after taki
In the journey to acquire a good grasp of DSA and become efficient in it, every programmer faces a big challenge βHow to start learning DSA?β.
In this article, we will be focusing on everything about DSA and how to begin your journey of DSA from scratch.
To read more, click here: https://bit.ly/3KW7ePW
In this article, we will be focusing on everything about DSA and how to begin your journey of DSA from scratch.
To read more, click here: https://bit.ly/3KW7ePW
"Problem of the Day"
Solve this question to get points
Given a sorted array. Convert it into a Height balanced Binary Search Tree (BST). Find the preorder traversal of height balanced BST.
Full Problem: https://bit.ly/3FvI2Pe
Solve this question to get points
Given a sorted array. Convert it into a Height balanced Binary Search Tree (BST). Find the preorder traversal of height balanced BST.
Full Problem: https://bit.ly/3FvI2Pe
practice.geeksforgeeks.org
Array to BST | Practice | GeeksforGeeks
Given a sorted array. Convert it into a Height balanced Binary Search Tree (BST). Find the preorder traversal of height balanced BST. If there exist many such balanced BST consider the tree whose preorder is lexicographically smallest.
Height ba
Height ba
The User Interface of the app is composed of many simple widgets, each of which handles one particular job. That is the reason why Flutter developers tend to think of their flutter app as a tree of widgets.
With this project, let's learn to create a login and signup page in Android Using Flutter from the scratch.
To watch the full video: https://bit.ly/3yrDacp
With this project, let's learn to create a login and signup page in Android Using Flutter from the scratch.
To watch the full video: https://bit.ly/3yrDacp
"Problem of the Day"
Solve this question to get points
Geek lost the password of his super locker. He remembers the number of digits N as well as the sum S of all the digits of his password.
Full Problem: https://bit.ly/3yuqmlM
Solve this question to get points
Geek lost the password of his super locker. He remembers the number of digits N as well as the sum S of all the digits of his password.
Full Problem: https://bit.ly/3yuqmlM
practice.geeksforgeeks.org
Largest number with given sum | Practice | GeeksforGeeks
Geek lost the password of his super locker. He remembers the number of digits N as well as the sum S of all the digits of his password. He know that his password is the largest number of N digits that can be made with given sum S.
Reading code requires a lot of practice, attention, and reaching under the skin. To get a better hands-on you will be required to have a better understanding first and thatβs where the reading part comes in.
Thatβs why we came up with the Solid Reasons Why Reading Code Is More Important Than Writing.
Read more in the article: https://bit.ly/3w2lz9o
Thatβs why we came up with the Solid Reasons Why Reading Code Is More Important Than Writing.
Read more in the article: https://bit.ly/3w2lz9o
"Problem of the Day"
Solve this question to get points
Given a grid of size n*n filled with 0, 1, 2, 3. Check whether there is a path possible from the source to destination. You can traverse up, down, right and left.
Full Problem: https://bit.ly/3l1hSdJ
Solve this question to get points
Given a grid of size n*n filled with 0, 1, 2, 3. Check whether there is a path possible from the source to destination. You can traverse up, down, right and left.
Full Problem: https://bit.ly/3l1hSdJ
practice.geeksforgeeks.org
Find whether path exist | Practice | GeeksforGeeks
Given a grid of size n*n filled with 0, 1, 2, 3. Check whether there is a path possible from the source to destination. You can traverse up, down, right and left.
The description of cells is as follows:
A value of cell 1 means
The description of cells is as follows:
A value of cell 1 means
Entrepreneurship seems like a dream, and almost everyone these days is pursuing entrepreneurship in one way or another.
With this article, let's understand what entrepreneurship really means, be a successful entrepreneur, and develop an entrepreneurial mindset.
To get started, click here: https://bit.ly/39elt5r
With this article, let's understand what entrepreneurship really means, be a successful entrepreneur, and develop an entrepreneurial mindset.
To get started, click here: https://bit.ly/39elt5r
"Problem of the Day"
Solve this question to get points
Given two integer arrays Arr1 and Arr2 of size N. Use the greatest elements from the given arrays to create a new array of size N such that it consists of only unique elements and the sum of all its elements is maximum.
Full Problem: https://bit.ly/3MfTMrK
Solve this question to get points
Given two integer arrays Arr1 and Arr2 of size N. Use the greatest elements from the given arrays to create a new array of size N such that it consists of only unique elements and the sum of all its elements is maximum.
Full Problem: https://bit.ly/3MfTMrK
practice.geeksforgeeks.org
Maximize The Array | Practice | GeeksforGeeks
Given two integer arrays Arr1 and Arr2 of size N. Use the greatest elements from the given arrays to create a new array of size N such that it consists of only unique elements and the sum of all its elements is maximum.
The created elements should c
The created elements should c
This media is not supported in your browser
VIEW IN TELEGRAM
Frameworks have a defined set of codes that can be used for creating a custom application. Talking about applications, what strikes our mind first is Java.
Since we are prone to make mistakes, letβs discuss the Most Common Spring Framework Mistakes while building Java-based enterprise-level applications.
Read more in the article: https://bit.ly/3ytVVfs
Since we are prone to make mistakes, letβs discuss the Most Common Spring Framework Mistakes while building Java-based enterprise-level applications.
Read more in the article: https://bit.ly/3ytVVfs
You want it, You get it! π€
A Full Stack Coding Quiz for you to test out your full-stack knowledge and win assured rewards.
Let's make your Friday, a FRIYAY. β¨
You can submit your entry by 14th May, 11:59 PM. Let's get started! π
To Participate now: https://bit.ly/37MGsfC
A Full Stack Coding Quiz for you to test out your full-stack knowledge and win assured rewards.
Let's make your Friday, a FRIYAY. β¨
You can submit your entry by 14th May, 11:59 PM. Let's get started! π
To Participate now: https://bit.ly/37MGsfC
"Problem of the Day"
Solve this question to get points
In the game of Broken Blocks, the player is allowed to move on m x n blocks i.e. m levels and n stone blocks on each level such that one level is vertically above the previous level (as in a staircase), with some of its stone blocks replaced by wooden blocks.
Full Problem: https://bit.ly/39fBh8d
Solve this question to get points
In the game of Broken Blocks, the player is allowed to move on m x n blocks i.e. m levels and n stone blocks on each level such that one level is vertically above the previous level (as in a staircase), with some of its stone blocks replaced by wooden blocks.
Full Problem: https://bit.ly/39fBh8d
practice.geeksforgeeks.org
Broken blocks | Practice | GeeksforGeeks
In the game of Broken Blocks, the player is allowed to move on m x n blocks i.e. m levels and n stone blocks on each level such that one level is vertically above the previous level (as in a staircase), with some of its stone blocks re