POTD- 02/11/2023 | Minimum distance between two numbers | Problem of the Day GeeksforGeeks

Welcome to the daily solving of our PROBLEM OF THE DAY with Karan Mashru. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Data Structures and Algorithms but will also help you build up problem-solving skills.
So come along and solve the GFG POTD of 02nd November 2023 with us!
💻 Try it Yourself: www.geeksforge...
Find daily solutions for POTD here on our channel! Make sure you are subscribed and stay updated.
-----------------------------------------------------------------------------------------
🏆 Take part in our Weekly Coding Contests: practice.geeks...
📖 Master Competitive Programming - Complete Beginner to Advanced: practice.geeks...
-----------------------------------------------------------------------------------------
Follow us and stay updated on everything happening in the world of geeks:
📱 Twitter- / geeksforgeeks
📝 LinkedIn- / geeksforgeeks
🌐 Facebook- / geeksforgeeks.org
📷 Instagram- www.instagram....
#GFGPractice #GeeksforGeeks #ProblemofTheDay #CodingQuestions #POTD

[@prateekbhaisora]

A cleaner code: int minDist(int arr[], int n, int x, int y) { int indx = -1, indy = -1; int ans = n+1; for (int i=0; i

[@abhishekupadhyay9962]

int minDist(int a[], int n, int x, int y) { // code here int prev = -1; int minDist = INT_MAX; for(int i=0;i

[@saimani6410]

Can't we do using two pointers

[@Sayan_Shankhari]

Sliding window?