Kiran Goje’s Post

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-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-8 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [ Find the N-th character ] 🤔 Given a binary string s. Perform r iterations on string s, where in each iteration 0 becomes 01 and 1 becomes 10. Find the nth character (considering 0 based indexing) of the string after performing these r iterations (see examples for better understanding). 👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! #ProblemSolving #CodingChallenge #GeeksforGeeks #potd

Day-45 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Count the elements] 🤔Given two arrays a and b both of size n. Given q queries in an array query each having a positive integer x denoting an index of the array a. For each query, your task is to find all the elements less than or equal to a[x] in the array b. 👩💻 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-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-19 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Sum of nodes on the longest path from root to leaf node] 🤔Given a binary tree having n nodes. Find the sum of all nodes on the longest path from root to any leaf node. If two or more paths compete for the longest path, then the path having maximum sum of nodes will be considered. Note: Path from A to B and B to A are considered to be the same.                                                             👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! #ProblemSolving #CodingChallenge #GeeksforGeeks #potd

Day-21 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Diagonal sum in binary tree] 🤔Consider Red lines of slope -1 passing between nodes (in following diagram). The diagonal sum in a binary tree is the sum of all node datas lying between these lines. Given a Binary Tree of size n, print all diagonal sums.                                                             👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! #ProblemSolving #CodingChallenge #GeeksforGeeks #potd

Day-23 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Insert an Element at the Bottom of a Stack] 🤔You are given a stack st of n integers and an element x. You have to insert x at the bottom of the given stack.  Note: Everywhere in this problem, the bottommost element of the stack is shown first while priniting the stack.                                                             👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! #ProblemSolving #CodingChallenge #GeeksforGeeks #potd

Day-43 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Reverse Bits] 🤔Given a number x, reverse its binary form and return the answer in decimal. 👩💻 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-16 ✅ gfg potd 🚀 Excited to tackle today's GeeksforGeeks Problem of the Day! 💡 🔍 Problem: [Count Pairs whose sum is equal to X] 🤔 Given two linked list head1 and head2 with distinct elements, determine the count of all distinct pairs from both lists whose sum is equal to the given value x. 👩💻 Let's brainstorm together! Share your insights and solutions in the comments below. Let's learn and grow together! #ProblemSolving #CodingChallenge #GeeksforGeeks #potd