"Problem of the Day"
Solve this question to get points
Given an array arr[ ] of size N having distinct elements, the task is to find the next greater element for each element of the array in order of their appearance in the array.
Full problem:
https://practice.geeksforgeeks.org/problems/next-larger-element-1587115620/1
Solve this question to get points
Given an array arr[ ] of size N having distinct elements, the task is to find the next greater element for each element of the array in order of their appearance in the array.
Full problem:
https://practice.geeksforgeeks.org/problems/next-larger-element-1587115620/1
www.geeksforgeeks.org
Next Greater Element | Practice | GeeksforGeeks
Given an array arr[ ] of integers, the task is to find the next greater element for each element of the array in order of their appearance in the array. Next greater element of an element in the array is the nearest element on the right which is grea
Interview experiences of others can help you avoid common interview mistakes & improve upon them so when it's your turn to sit for an interview, you're able to skip those!
In this webinar, we have Shubham Kumar Agrawal, a to-be graduate from IIT-Bhubaneswar & an Associate Solution Leader at Brane.
Live at 7 PM IST.
Set Reminder: https://youtu.be/bMVxoL1Y37Q
In this webinar, we have Shubham Kumar Agrawal, a to-be graduate from IIT-Bhubaneswar & an Associate Solution Leader at Brane.
Live at 7 PM IST.
Set Reminder: https://youtu.be/bMVxoL1Y37Q
"Problem of the Day"
Solve this question to get points
There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs at a time.
Full problem:
https://practice.geeksforgeeks.org/problems/count-ways-to-reach-the-nth-stair-1587115620/1
Solve this question to get points
There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs at a time.
Full problem:
https://practice.geeksforgeeks.org/problems/count-ways-to-reach-the-nth-stair-1587115620/1
practice.geeksforgeeks.org
Count ways to reach the n'th stair | Practice | GeeksforGeeks
There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs at a time. Count the number of ways, the person can reach the top (order does matter).
Example 1:
Input:
n = 4
Outpu
Example 1:
Input:
n = 4
Outpu
"Problem of the Day"
Solve this question to get points
The tower of Hanoi is a famous puzzle where we have three rods and N disks. The objective of the puzzle is to move the entire stack to another rod.
Full problem:
https://practice.geeksforgeeks.org/problems/tower-of-hanoi-1587115621/1
Solve this question to get points
The tower of Hanoi is a famous puzzle where we have three rods and N disks. The objective of the puzzle is to move the entire stack to another rod.
Full problem:
https://practice.geeksforgeeks.org/problems/tower-of-hanoi-1587115621/1
practice.geeksforgeeks.org
Tower Of Hanoi | Practice | GeeksforGeeks
The tower of Hanoi is a famous puzzle where we have three rods and N disks. The objective of the puzzle is to move the entire stack to another rod. You are given the number of discs N. Initially, these discs are in the rod 1. You need to print all th
With the Live Mock Interview webinars, know where you need to scale up and how you can do it.
Watch Mr. Dhananjay Mishra, Mentor at GeeksforGeeks, who will be interviewing Mr. Darshan Simha, Computer Scientist at Adobe.
Going live at 5 PM IST.
Set Reminder: https://youtu.be/C1NbA8R17sw
Watch Mr. Dhananjay Mishra, Mentor at GeeksforGeeks, who will be interviewing Mr. Darshan Simha, Computer Scientist at Adobe.
Going live at 5 PM IST.
Set Reminder: https://youtu.be/C1NbA8R17sw
Interview experiences will guide you for the do's and don'ts in an interview.
In this webinar, we have with us Siddhartha Pogul who is currently working as an Software Engineer at Zeta and will be sharing his interview and working experience at the said company.
Catch us live today at 7 PM IST.
Link: https://youtu.be/J5Um6gX9_nc
In this webinar, we have with us Siddhartha Pogul who is currently working as an Software Engineer at Zeta and will be sharing his interview and working experience at the said company.
Catch us live today at 7 PM IST.
Link: https://youtu.be/J5Um6gX9_nc
"Problem of the Day"
Solve this question to get points
Given a number K and string str of digits denoting a positive integer, build the largest number possible by performing swap operations on the digits of str at most K times.
Full problem:
https://practice.geeksforgeeks.org/problems/largest-number-in-k-swaps-1587115620/1
Solve this question to get points
Given a number K and string str of digits denoting a positive integer, build the largest number possible by performing swap operations on the digits of str at most K times.
Full problem:
https://practice.geeksforgeeks.org/problems/largest-number-in-k-swaps-1587115620/1
practice.geeksforgeeks.org
Largest number in K swaps | Practice | GeeksforGeeks
Given a number K and string str of digits denoting a positive integer, build the largest number possible by performing swap operations on the digits of str at most K times.
Example 1:
Input:
K = 4
str = "1234567"
Output:
7654321
Ex
Example 1:
Input:
K = 4
str = "1234567"
Output:
7654321
Ex
In this webinar, we have someone to tell you how to get a role in back-end development, the kind of questions asked & the approach followed.
Watch Tarun Rana, currently working in Backend Development as an intern at MoveInSync, a Bengaluru-based software company.
Going Live at 5 PM Today: https://youtu.be/wUEpd-_0pfo
Watch Tarun Rana, currently working in Backend Development as an intern at MoveInSync, a Bengaluru-based software company.
Going Live at 5 PM Today: https://youtu.be/wUEpd-_0pfo
Hearing the interview experiences of geeks who are already a part of the software industry could help you land a job you've been wanting for long!
Today, we have Mr. Kunal Sindhwani, a software engineer at Zalora who's been in the IT industry since the last 5 years.
Hear him LIVE at 7 PM IST.
Set Reminder: https://youtu.be/B8GSmnxonVQ
Today, we have Mr. Kunal Sindhwani, a software engineer at Zalora who's been in the IT industry since the last 5 years.
Hear him LIVE at 7 PM IST.
Set Reminder: https://youtu.be/B8GSmnxonVQ
Want to know How to solve Problem of the Day question?
We'll post daily a video of previous day problem!!
To know how to solve Tower of Hanoi problem (28th April)
Check link: https://www.youtube.com/watch?v=ykya5EgIpqg
We'll post daily a video of previous day problem!!
To know how to solve Tower of Hanoi problem (28th April)
Check link: https://www.youtube.com/watch?v=ykya5EgIpqg
YouTube
Tower of Hanoi | Problem of the day
Solve this problem on our Practice Portal:
https://practice.geeksforgeeks.org/problems/tower-of-hanoi-1587115621/1
Let us know if you have any questions related to explanation or understanding in the comments section.
𝗖𝗵𝗲𝗰𝗸 𝗼𝘂𝘁 𝗼𝘂𝗿 𝗟𝗜𝗩𝗘 𝗮𝗻𝗱 𝗢𝗻𝗹𝗶𝗻𝗲 𝗖𝗼𝘂𝗿𝘀𝗲𝘀…
https://practice.geeksforgeeks.org/problems/tower-of-hanoi-1587115621/1
Let us know if you have any questions related to explanation or understanding in the comments section.
𝗖𝗵𝗲𝗰𝗸 𝗼𝘂𝘁 𝗼𝘂𝗿 𝗟𝗜𝗩𝗘 𝗮𝗻𝗱 𝗢𝗻𝗹𝗶𝗻𝗲 𝗖𝗼𝘂𝗿𝘀𝗲𝘀…
"Problem of the Day"
Solve this question to get points
Given a sorted array of size N and an integer K. Check if K is present in the array or not using ternary search.
Ternary Search - It is a divide and conquer algorithm that can be used to find an element in an array.
Full problem:
https://practice.geeksforgeeks.org/problems/3d27d4683c121c1f152ee8f41279255dc4430cf6/1
Solve this question to get points
Given a sorted array of size N and an integer K. Check if K is present in the array or not using ternary search.
Ternary Search - It is a divide and conquer algorithm that can be used to find an element in an array.
Full problem:
https://practice.geeksforgeeks.org/problems/3d27d4683c121c1f152ee8f41279255dc4430cf6/1
practice.geeksforgeeks.org
Searching an element in a sorted array (Ternary Search) | Practice | GeeksforGeeks
Given a sorted array arr[] of size N and an integer K. The task is to check if K is present in the array or not using ternary search.
Ternary Search- It is a divide and conquer algorithm that can be used to find an element in an array. In this
Ternary Search- It is a divide and conquer algorithm that can be used to find an element in an array. In this
More you hear about interview experiences of professionals, lesser would be the interview mistakes.
Watch Mr. Omkar Kumar, working as Security Endpoint Administrator at ZS Associates, sharing his interview and working experience of 3years in the IT and service industry.
Going live at 2 PM IST.
Link: https://youtu.be/E65pWM_NitE
Watch Mr. Omkar Kumar, working as Security Endpoint Administrator at ZS Associates, sharing his interview and working experience of 3years in the IT and service industry.
Going live at 2 PM IST.
Link: https://youtu.be/E65pWM_NitE
Want to know, how to solve Largest number in K swaps question?
(29th April - Problem of the day)
Check out this video: https://youtu.be/GstuPf5u3lg
(29th April - Problem of the day)
Check out this video: https://youtu.be/GstuPf5u3lg
YouTube
Largest number in K swaps | Problem of the day
Solve this problem on our Practice Portal:
https://practice.geeksforgeeks.org/problems/largest-number-in-k-swaps-1587115620/1#
Let us know if you have any questions related to explanation or understanding in the comments section.
𝗖𝗵𝗲𝗰𝗸 𝗼𝘂𝘁 𝗼𝘂𝗿 𝗟𝗜𝗩𝗘 𝗮𝗻𝗱…
https://practice.geeksforgeeks.org/problems/largest-number-in-k-swaps-1587115620/1#
Let us know if you have any questions related to explanation or understanding in the comments section.
𝗖𝗵𝗲𝗰𝗸 𝗼𝘂𝘁 𝗼𝘂𝗿 𝗟𝗜𝗩𝗘 𝗮𝗻𝗱…
"Problem of the Day"
Solve this question to get points
Given three coordinate points A, B and C, find the missing point D such that ABCD can be a parallelogram. If there are multiple such points, find the lexicographically smallest coordinate.
Full problem:
https://practice.geeksforgeeks.org/problems/missing-point-of-a-parallelogram0146/1
Solve this question to get points
Given three coordinate points A, B and C, find the missing point D such that ABCD can be a parallelogram. If there are multiple such points, find the lexicographically smallest coordinate.
Full problem:
https://practice.geeksforgeeks.org/problems/missing-point-of-a-parallelogram0146/1
practice.geeksforgeeks.org
Missing Point of a Parallelogram | Practice | GeeksforGeeks
Given three coordinate points A, B and C, find the missing point D such that ABCD can be a parallelogram. If there are multiple such points, find the lexicographically smallest coordinate.
Example 1:
Input:
A = (3, 2)
B = (3, 4)
c = (2, 2)
Output:
Example 1:
Input:
A = (3, 2)
B = (3, 4)
c = (2, 2)
Output:
Hearing interview experiences would help you to land an opportunity that you have been waiting for long!
In this webinar, we have Vikas Sharma, tech intern at Exotel and a to-be CS graduate from Sapthigiri College of Engineering, Bangalore.
Catch us Live at 1 PM.
Set Reminder: https://youtu.be/-GTEYAsadsQ
In this webinar, we have Vikas Sharma, tech intern at Exotel and a to-be CS graduate from Sapthigiri College of Engineering, Bangalore.
Catch us Live at 1 PM.
Set Reminder: https://youtu.be/-GTEYAsadsQ
Do you think you're prepared enough for the technical round of your next interview?
Watch one of our mentors, Mr. Dhananjay Mishra interviewing a student from LNMIT, Jaipur. Mehul Khandelwal, our candidate for the day is a JAVA developer & a competitive programmer.
Going Live at 7 PM IST.
Set Reminder: https://youtu.be/_JYB7zsNuBc
Watch one of our mentors, Mr. Dhananjay Mishra interviewing a student from LNMIT, Jaipur. Mehul Khandelwal, our candidate for the day is a JAVA developer & a competitive programmer.
Going Live at 7 PM IST.
Set Reminder: https://youtu.be/_JYB7zsNuBc
"Problem of the Day"
Solve this question to get points
Given an array arr of N integers. Find the contiguous sub-array with maximum sum.
Full problem:
https://practice.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1
Solve this question to get points
Given an array arr of N integers. Find the contiguous sub-array with maximum sum.
Full problem:
https://practice.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1
www.geeksforgeeks.org
Kadane's Algorithm | Practice | GeeksforGeeks
Given an integer array arr[]. You need to find and return the maximum sum possible from all the subarrays.
Examples:
Input: arr[] = [2, 3, -8, 7, -1, 2, 3]
Output: 11
Explanation: The subarray {7, -1, 2, 3} has the largest sum 11.
Input: arr[]
Examples:
Input: arr[] = [2, 3, -8, 7, -1, 2, 3]
Output: 11
Explanation: The subarray {7, -1, 2, 3} has the largest sum 11.
Input: arr[]
Whether you're a college student or a working professional looking out for a switch, here's a road map to learning Data Science & Machine Learning!
We have with us Mr. Nikhil Jain, a data scientist and the Senior Manager at American Express.
Catch us live at 1 PM.
Set Reminder: https://youtu.be/l20TjQ-e0ww
We have with us Mr. Nikhil Jain, a data scientist and the Senior Manager at American Express.
Catch us live at 1 PM.
Set Reminder: https://youtu.be/l20TjQ-e0ww
Want to know, how to solve Ternary Search question?
(30th April - Problem of the day)
Check out this video:https://youtu.be/jHibhOMkf0s
(30th April - Problem of the day)
Check out this video:https://youtu.be/jHibhOMkf0s
YouTube
Searching an element in a sorted array (Ternary Search) | Problem of the day
Solve this problem on our Practice Portal:
https://practice.geeksforgeeks.org/problems/3d27d4683c121c1f152ee8f41279255dc4430cf6/1
Let us know if you have any questions related to explanation or understanding in the comments section.
𝗖𝗵𝗲𝗰𝗸 𝗼𝘂𝘁 𝗼𝘂𝗿 𝗟𝗜𝗩𝗘 𝗮𝗻𝗱…
https://practice.geeksforgeeks.org/problems/3d27d4683c121c1f152ee8f41279255dc4430cf6/1
Let us know if you have any questions related to explanation or understanding in the comments section.
𝗖𝗵𝗲𝗰𝗸 𝗼𝘂𝘁 𝗼𝘂𝗿 𝗟𝗜𝗩𝗘 𝗮𝗻𝗱…