Hey Geeks, Want to excel DSA through Live Interactive classes?
And, that too on the lowest price!!
Use code: GOLSTDGCL3 (Valid only for today)
Link: https://practice.geeksforgeeks.org/courses/geeks-classes-live
And, that too on the lowest price!!
Use code: GOLSTDGCL3 (Valid only for today)
Link: https://practice.geeksforgeeks.org/courses/geeks-classes-live
www.geeksforgeeks.org
Tech Interview 101 - From DSA to System Design for Working Professionals
Why do Professionals in Software Engineering often struggle to create efficient and scalable systems?Well, the solution lies in integrating DSA principles effectively into real-world System Design scenarios. If you want to learn this in order to crack the…
"Problem of the Day"
Solve this question to get points
Given an array arr[] of N integers arranged in a circular fashion. Your task is to find the maximum contiguous subarray sum.
Full problem: https://practice.geeksforgeeks.org/problems/max-circular-subarray-sum-1587115620/1
Solve this question to get points
Given an array arr[] of N integers arranged in a circular fashion. Your task is to find the maximum contiguous subarray sum.
Full problem: https://practice.geeksforgeeks.org/problems/max-circular-subarray-sum-1587115620/1
practice.geeksforgeeks.org
Max Circular Subarray Sum | Practice | GeeksforGeeks
Given an array arr[] of N integers arranged in a circular fashion. Your task is to find the maximum contiguous subarray sum.
Example 1:
Input:
N = 7
arr[] = {8,-8,9,-9,10,-11,12}
Output:
22
Explanation:
Starting from the last element
of the arra
Example 1:
Input:
N = 7
arr[] = {8,-8,9,-9,10,-11,12}
Output:
22
Explanation:
Starting from the last element
of the arra
Hey Geeks,
Do you want to:
>Cover the basics of Java?
>Learn the collections framework?
>Brush up on all the industry-required topics?
If your answer is big YES, wait no more.......
Use code GOLFS4JAVA to grab JAVA Collections course at lowest price.
FLASH SALE at 2:30 PM
Link: https://practice.geeksforgeeks.org/courses/Java-Collections
Do you want to:
>Cover the basics of Java?
>Learn the collections framework?
>Brush up on all the industry-required topics?
If your answer is big YES, wait no more.......
Use code GOLFS4JAVA to grab JAVA Collections course at lowest price.
FLASH SALE at 2:30 PM
Link: https://practice.geeksforgeeks.org/courses/Java-Collections
www.geeksforgeeks.org
Fundamentals of Java Collection Framework - Self Paced
Frameworks help you write clean & efficient code and can save a lot of time. That is why learning JAVA Collections Frameworks is important as it helps create durable & advanced projects. Learn JAVA Framework concepts & become industry ready!
Today is the last day of our Geek-O-Lympics Sale.
And, we have 4 Courses on our Stall of the Day!!
Yes, 4 Best courses and that too on amazing discount!! 😍😍
Check them out now: https://bit.ly/StallOfTheDay
And, we have 4 Courses on our Stall of the Day!!
Yes, 4 Best courses and that too on amazing discount!! 😍😍
Check them out now: https://bit.ly/StallOfTheDay
practice.geeksforgeeks.org
GeeksforGeeks Courses | Practice | GeeksforGeeks
Prepare with GeeksforGeeks | Online and Offline Courses By GeeksforGeeks
"Problem of the Day"
Solve this question to get points
The cost of stock on each day is given in an array A[] of size N. Find all the days on which you buy and sell the stock so that in between those days your profit is maximum.
Full problem: https://practice.geeksforgeeks.org/problems/stock-buy-and-sell-1587115621/1
Solve this question to get points
The cost of stock on each day is given in an array A[] of size N. Find all the days on which you buy and sell the stock so that in between those days your profit is maximum.
Full problem: https://practice.geeksforgeeks.org/problems/stock-buy-and-sell-1587115621/1
www.geeksforgeeks.org
Stock buy and sell | Practice | GeeksforGeeks
The cost of stock on each day is given in an array A[] of size N. Find all the segments of days on which you buy and sell the stock such that the sum of difference between sell and buy prices is maximized. Each segment consists of indexes of two elem
Want to know, how to solve Max Circular Subarray Sum question?
(04th July- Problem of the day)
Check out this video: https://youtu.be/nfc83RUrVHk
(04th July- Problem of the day)
Check out this video: https://youtu.be/nfc83RUrVHk
YouTube
Max Circular Subarray Sum | Problem of the day - 04/07/2021 | Krish Rustagi
Submit your solutions here:
https://practice.geeksforgeeks.org/problems/max-circular-subarray-sum-1587115620/1
Subscribe our YouTube channel GeeksforGeeks Practice
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Let us know if you have any questions…
https://practice.geeksforgeeks.org/problems/max-circular-subarray-sum-1587115620/1
Subscribe our YouTube channel GeeksforGeeks Practice
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Let us know if you have any questions…
"Problem of the Day"
Solve this question to get points
Dilpreet wants to paint his dog's home that has n boards with different lengths. The length of ith board is given by arr[i] where arr[] is an array of n integers.
Full problem: https://practice.geeksforgeeks.org/problems/the-painters-partition-problem1535/1
Solve this question to get points
Dilpreet wants to paint his dog's home that has n boards with different lengths. The length of ith board is given by arr[i] where arr[] is an array of n integers.
Full problem: https://practice.geeksforgeeks.org/problems/the-painters-partition-problem1535/1
www.geeksforgeeks.org
The Painter's Partition Problem-II | Practice | GeeksforGeeks
Dilpreet wants to paint his dog's home that has n boards with different lengths. The length of ith board is given by arr[i] where arr[] is an array of n integers. He hired k painters for this work and each painter takes 1 unit tim
Mr. Abhineet is a Cloud Support associate at Amazon. With his experience & training, he will introduce you to the various strategies you need to keep in mind to excel in your next tech interview.
Going Live at 7:30 PM IST.
Link: https://youtu.be/PKS3XVywnNI
Going Live at 7:30 PM IST.
Link: https://youtu.be/PKS3XVywnNI
Want to know, how to solve Stock buy and sell question?
(05th July- Problem of the day)
Check out this video: https://youtu.be/UiztGyw30bY
(05th July- Problem of the day)
Check out this video: https://youtu.be/UiztGyw30bY
YouTube
Stock buy and sell | Problem of the day - 05/07/2021 | Krish Rustagi
Submit your solutions here:
https://practice.geeksforgeeks.org/problems/stock-buy-and-sell-1587115621/1
Subscribe our YouTube channel GeeksforGeeks Practice
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Let us know if you have any questions related…
https://practice.geeksforgeeks.org/problems/stock-buy-and-sell-1587115621/1
Subscribe our YouTube channel GeeksforGeeks Practice
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Let us know if you have any questions related…
"Problem of the Day"
Solve this question to get points
Given a sorted array with possibly duplicate elements. The task is to find indexes of first and last occurrences of an element X in the given array.
Full problem: https://practice.geeksforgeeks.org/problems/find-first-and-last-occurrence-of-x0849/1
Solve this question to get points
Given a sorted array with possibly duplicate elements. The task is to find indexes of first and last occurrences of an element X in the given array.
Full problem: https://practice.geeksforgeeks.org/problems/find-first-and-last-occurrence-of-x0849/1
practice.geeksforgeeks.org
Left most and right most index | Practice | GeeksforGeeks
Given a sorted array with possibly duplicate elements. The task is to find indexes of first and last occurrences of an element X in the given array.
Note: If the element is not present in the array return {-1,-1} as pair.
Example 1:
Input
Note: If the element is not present in the array return {-1,-1} as pair.
Example 1:
Input
Mr. Yogesh, Software engineer at Accolite is here to provide you with thoughtful tips & tricks to help you excel in your next interview.
Going live at 7:30 PM IST.
Set Reminder: https://youtu.be/j7cd0vuPSQE
Going live at 7:30 PM IST.
Set Reminder: https://youtu.be/j7cd0vuPSQE
Want to know, how to solve The Painter's Partition Problem question?
(6th July- Problem of the day)
Check out this video: https://youtu.be/K1gbjz8kOWE
(6th July- Problem of the day)
Check out this video: https://youtu.be/K1gbjz8kOWE
YouTube
The Painter's Partition Problem | Problem of the day - 06/07/2021 | Krish Rustagi
Submit your solutions here:
https://practice.geeksforgeeks.org/problems/the-painters-partition-problem1535/1
Subscribe our YouTube channel GeeksforGeeks Practice
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Let us know if you have any questions…
https://practice.geeksforgeeks.org/problems/the-painters-partition-problem1535/1
Subscribe our YouTube channel GeeksforGeeks Practice
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Let us know if you have any questions…
"Problem of the Day"
Solve this question to get points
Given arrival and departure times of all trains that reach a railway station. Find the minimum number of platforms required for the railway station so that no train is kept waiting.
Full problem: https://practice.geeksforgeeks.org/problems/minimum-platforms-1587115620/1
Solve this question to get points
Given arrival and departure times of all trains that reach a railway station. Find the minimum number of platforms required for the railway station so that no train is kept waiting.
Full problem: https://practice.geeksforgeeks.org/problems/minimum-platforms-1587115620/1
www.geeksforgeeks.org
Minimum Platforms | Practice | GeeksforGeeks
You are given the arrival times arr[] and departure times dep[] of all trains that arrive at a railway station on the same day. Your task is to determine the minimum number of platforms required at the station to ensure that no train is kept waiting.
Want to know, how to solve Left most and right most index question?
(7th July- Problem of the day)
Check out this video: https://youtu.be/jOFtiCVCLPM
(7th July- Problem of the day)
Check out this video: https://youtu.be/jOFtiCVCLPM
YouTube
Left most and right most index | Problem of the day - 07/07/2021 | Krish Rustagi
Submit your solutions here:
https://practice.geeksforgeeks.org/problems/find-first-and-last-occurrence-of-x0849/1
Subscribe our YouTube channel GeeksforGeeks Practice
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Let us know if you have any questions…
https://practice.geeksforgeeks.org/problems/find-first-and-last-occurrence-of-x0849/1
Subscribe our YouTube channel GeeksforGeeks Practice
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Let us know if you have any questions…
"Problem of the Day"
Solve this question to get points
Given an NxM 2D matrix, rearrange such that
Each diagonal in the lower left triangle of the rectangular grid is sorted in ascending order.
Full problem: https://practice.geeksforgeeks.org/problems/diagonal-morning-assembly0028/1
Solve this question to get points
Given an NxM 2D matrix, rearrange such that
Each diagonal in the lower left triangle of the rectangular grid is sorted in ascending order.
Full problem: https://practice.geeksforgeeks.org/problems/diagonal-morning-assembly0028/1
practice.geeksforgeeks.org
Sort a 2D vector diagonally | Practice | GeeksforGeeks
Given an NxM 2D matrix, rearrange such that
Each diagonal in the lower left triangle of the rectangular grid is sorted in ascending order.
Each diagonal in the upper right triangle of the rectangular grid is sorted in descending order.&nb
Each diagonal in the lower left triangle of the rectangular grid is sorted in ascending order.
Each diagonal in the upper right triangle of the rectangular grid is sorted in descending order.&nb
Want to know, how to solve Minimum Platforms question?
(8th July- Problem of the day)
Check out this video: https://youtu.be/gqmW9RJr4YI
(8th July- Problem of the day)
Check out this video: https://youtu.be/gqmW9RJr4YI
YouTube
Minimum Platforms | Problem of the day - 08/07/2021 | Krish Rustagi
Submit your solutions here:
https://practice.geeksforgeeks.org/problems/minimum-platforms-1587115620/1
Subscribe our YouTube channel GeeksforGeeks Practice
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Let us know if you have any questions related…
https://practice.geeksforgeeks.org/problems/minimum-platforms-1587115620/1
Subscribe our YouTube channel GeeksforGeeks Practice
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Let us know if you have any questions related…
"Problem of the Day"
Solve this question to get points
Write a program to Validate an IPv4 Address. According to Wikipedia, IPv4 addresses are canonically represented in dot-decimal notation, which consists of four decimal numbers, each ranging from 0 to 255, separated by dots, e.g., 172.16.254.1 .
Full problem: https://practice.geeksforgeeks.org/problems/validate-an-ip-address-1587115621/1
Solve this question to get points
Write a program to Validate an IPv4 Address. According to Wikipedia, IPv4 addresses are canonically represented in dot-decimal notation, which consists of four decimal numbers, each ranging from 0 to 255, separated by dots, e.g., 172.16.254.1 .
Full problem: https://practice.geeksforgeeks.org/problems/validate-an-ip-address-1587115621/1
www.geeksforgeeks.org
Validate an IP Address | Practice | GeeksforGeeks
You are given a string s in the form of an IPv4 Address. Your task is to validate an IPv4 Address, if it is valid return true otherwise return false.
IPv4 addresses are canonically represented in dot-decimal notation, which consists of four decimal
IPv4 addresses are canonically represented in dot-decimal notation, which consists of four decimal
If you’re preparing for a tech interview, then you probably would've known that you're required to have a sound knowledge of System Design concepts.
Wanna know more about it?
Check out the full video: https://youtu.be/3JKgtOobPg8
Wanna know more about it?
Check out the full video: https://youtu.be/3JKgtOobPg8
YouTube
Why You Should Learn System Design? | Yogita Sharma | GeeksforGeeks
If you’re preparing for a Technical interviews, especially, for Senior Software Developer profiles - then you must be prepared for SYSTEM DESIGN Interview. However, what you all need to know is System Design is not meant for just cracking these tech interviews…
"Problem of the Day"
Solve this question to get points
Your task is to implement the function atoi. The function takes a string(str) as argument and converts it to an integer and returns it.
Full problem: https://practice.geeksforgeeks.org/problems/implement-atoi/1
Solve this question to get points
Your task is to implement the function atoi. The function takes a string(str) as argument and converts it to an integer and returns it.
Full problem: https://practice.geeksforgeeks.org/problems/implement-atoi/1
www.geeksforgeeks.org
Implement Atoi | Practice | GeeksforGeeks
Given a string, s, the objective is to convert it into integer format without utilizing any built-in functions. If the conversion is not feasible, the function should return -1.
Note: Conversion is feasible only if all characters in the string are n
Note: Conversion is feasible only if all characters in the string are n
Want to know, how to solve Validate an IP Address question?
(10th July- Problem of the day)
Check out this video: https://youtu.be/1Vfmo1q1br8
(10th July- Problem of the day)
Check out this video: https://youtu.be/1Vfmo1q1br8
YouTube
Validate an IP Address | Problem of the Day - 10/07/21 | Dhananjay Mishra
Submit your solutions here:
https://practice.geeksforgeeks.org/problems/validate-an-ip-address-1587115621/1
Subscribe our YouTube Channel:
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Link to our Courses Portal - https://practice.geeksforgeeks.org/jobs…
https://practice.geeksforgeeks.org/problems/validate-an-ip-address-1587115621/1
Subscribe our YouTube Channel:
https://www.youtube.com/channel/UCXQnpama_0lAzj_4MAdZ5vw
Link to our Courses Portal - https://practice.geeksforgeeks.org/jobs…