Kiran Goje’s Post

Day-54 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Paths to reach origin] 🤔You are standing on a point (x, y) and you want to go to the origin (0, 0) by taking steps either left or down i.e. from each point you are allowed to move either in (x-1, y) or (x, y-1). Find the number of paths from point to origin. 👩💻 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-32 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Minimum Absolute Difference In BST] 🤔Given a binary search tree having n (n>1) nodes, the task is to find the minimum absolute difference between any two nodes. 👩💻 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-14 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Linked List that is Sorted Alternatingly] 🤔 You are given a Linked list of size n. The list is in alternating ascending and descending orders. Sort the given linked list in non-decreasing order. 👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! #ProblemSolving #CodingChallenge #GeeksforGeeks #potd

Day-36 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Count ways to N'th Stair] 🤔There are n stairs, and 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 not matter). 👩💻 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-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

Day-35 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Strictly Increasing Array] 🤔Given an array nums of n positive integers. Find the minimum number of operations required to modify the array such that array elements are in strictly increasing order (nums[i] < nums[i+1]). Changing a number to greater or lesser than original number is counted as one operation. Note: Array elements can become negative after applying operation. 👩💻 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-30 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Closest Neighbour in BST] 🤔Given the root of a binary search tree and a number n, find the greatest number in the binary search tree that is less than or equal to n. 👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! hashtag #ProblemSolving #CodingChallenge  #GeeksforGeeks #potd

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

Day-51 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Three way partitioning] 🤔Given an array of size n and a range [a, b]. The task is to partition the array around the range such that the array is divided into three parts. 1) All elements smaller than a come first. 2) All elements in range a to b come next. 3) All elements greater than b appear in the end. The individual elements of three sets can appear in any order. You are required to return the modified array. Note: The generated output is 1 if you modify the given array successfully. 👩💻 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