NuEthix Formulations’ Post

My favorite part of #CiscoLive is the world of solution, especially the walk-in-labs where you can test your skills and improve them further

Day-7 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [ Check if frequencies can be equal ] 🤔 Given a string s which contains only lower alphabetic characters, check if it is possible to remove at most one character from this string in such a way that frequency of each distinct character becomes same in the string. Return true if it is possible to do else return false. 👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! #ProblemSolving #CodingChallenge #GeeksforGeeks #potd here is my solution

gfg potd day-4 ✅ 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Maximum Index] 🤔 Given an array a of n positive integers. The task is to find the maximum of j - i subjected to the constraint of a[i] < a[j] and i < j. 👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! #ProblemSolving #CodingChallenge #GeeksforGeeks #potd

🌟 Celebrating 401 Days of GFG POTD Streak! 🌟 I'm thrilled to share that I've reached a milestone of 401 consecutive days of solving the GeeksforGeeks Problem of the Day (POTD)! 🎉 This journey has been a fantastic experience, filled with challenging problems, learning opportunities, and personal growth. Each day, I faced a new problem that tested my problem-solving skills, deepened my understanding of algorithms and data structures, and kept me sharp. What I've Gained: Consistency: The daily commitment has strengthened my discipline and perseverance. Knowledge: I've explored a wide range of topics and techniques, from basic concepts to advanced algorithms. Community: Engaging with fellow enthusiasts and seeing diverse approaches has been incredibly inspiring. A big thank you to the GFG community and everyone who supported and encouraged me along the way. Here's to many more days of learning and growing together! 🚀 #AchievementUnlocked #CodingJourney #GeeksforGeeks #POTD #Milestone #LearningEveryday #Community #GrowthMindset

Day-10 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Count pairs Sum in matrices ] 🤔 Given two sorted matrices mat1 and mat2 of size n x n of elements. Each matrix contains numbers arranged in strictly ascending order, with each row sorted from left to right, and the last element of a row being smaller than the first element of the next row. You're given a target value, x, your task is to find and count all pairs {a, b} such that a is from mat1 and b is from mat2 where sum of a and b is equal to x. 👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! #ProblemSolving #CodingChallenge #GeeksforGeeks #potd

Day-56 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Exit Point in a Matrix] 🤔Given a matrix of size n x m with 0’s and 1’s, you enter the matrix at cell (0,0) in left to right direction. Whenever you encounter a 0 you retain it in the same direction, else if you encounter a 1 you have to change the direction to the right of the current direction and change that 1 value to 0, you have to find out from which index you will leave the matrix at the end. 👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! hashtag #ProblemSolving #CodingChallenge  #GeeksforGeeks #potd

Day-46 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Minimize the Difference] 🤔You are given an array arr of size n. You have to remove a subarray of size k , such that the difference between the maximum and minimum values of the remaining array is minimized. Find the minimum value obtained after performing the operation of the removal of the subarray and return it. 👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! hashtag #ProblemSolving #CodingChallenge  #GeeksforGeeks #potd

🎉 I'm overjoyed to share that I've conquered the 101 Days of PotD (Problem of the Day) challenge on GeeksforGeeks! 💡💯 It's been an exhilarating journey immersed in daily problem-solving, learning, and growth. For the past 101 days, I've delved into the diverse array of challenges presented by GeeksforGeeks. From algorithms to data structures, each day's problem was a stimulating puzzle that tested and expanded my knowledge and problem-solving skills. This challenge has been more than just solving problems; it's been about persistence, resilience, and the thrill of cracking solutions to intricate coding challenges. It's taught me how to approach problems systematically, think critically, and find innovative solutions. I owe a tremendous thank-you to the incredible community at GeeksforGeeks for their support, encouragement, and shared insights. Your discussions, solutions, and engagement have been instrumental in my learning journey. A heartfelt appreciation to [tag individuals/mentors/inspirations] whose guidance and expertise have been a guiding light throughout this challenge. As this chapter draws to a close, I'm excited to leverage the skills and knowledge gained from this challenge. The 100 Days of PotD challenge has equipped me with a sharper coding mindset and a deeper understanding of algorithms and data structures. Here's to a hundred days of problem-solving triumphs and to the endless learning opportunities ahead! 🌟✨ #101DaysOfPotD #GeeksforGeeks #ProblemSolvingChampion #SandeepJain.

Day-52 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Row with minimum number of 1's] 🤔Given a 2D binary matrix(1-based indexed) a of dimensions nxm , determine the row that contains the minimum number of 1's. Note: The matrix contains only 1's and 0's. Also, if two or more rows contain the minimum number of 1's, the answer is the lowest of those indices. 👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! hashtag #ProblemSolving #CodingChallenge  #GeeksforGeeks #potd

Day-40 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Party of Couples] 🤔You are given an integer array arr[] of size n, representing n number of people in a party, each person is denoted by an integer. Couples are represented by the same number ie: two people have the same integer value, it means they are a couple. Find out the only single person in the party of couples. NOTE: It is guarantee that there exist only one single person in the party. 👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! hashtag #ProblemSolving #CodingChallenge  #GeeksforGeeks #potd