GFG GHRCEMN’s Post

✨ Day (009/160) of #gfg160 Streak! ✨ Today, I tackled an exciting problem: "Minimize the Heights I" from the Arrays track. 🏔️ It challenged my problem-solving and optimization skills, and I enjoyed implementing a strategy to balance tower heights effectively. Every day brings new learnings and progress, keeping me motivated on this journey. 🔥 🔗https://lnkd.in/dRb7tPpf GeeksforGeeks #GeeksForGeeks #gfg160 #geekstreak2024 #gfg #womenintech! #CodingChallenge #ProblemSolving #160DaysOfCode #GfG160Days #CodeHelp #CodingStreak

#Day2 of 160 days GFG Coding Challenge! Day 2 of the #gfg #GFG160 challenge and we're already building momentum! GeeksforGeeks Today's Problem: Move All Zeroes to End This problem was all about efficiently shifting zeroes to the end of an array while keeping the relative order of non-zero elements intact. I solved it with: Time Complexity: O(N) - We just need a single traversal of the array! Space Complexity: 0(1) - No extra space used, just swapping elements in-place. It was a nice reminder of how we can solve problems in an optimal way with simple swapping techniques. Let's keep the streak alive and keep pushing the limits! #gfg160 #geekstreak2024 #GeeksforGeeks #Codingjourney #Problemsolving

Hey there! 👋 Welcome to Day 13 of tackling the GeeksforGeeks (GfG 160 - 160 Days of Problem-Solving challenge!) 🚀 💡Day 13 Problem: Smallest Positive Missing Number Task: You are given an integer array arr[]. Your task is to find the smallest positive number missing from the array. Note: Positive number starts from 1. The array can have negative integers too. Difficulty: Medium Problem Link: https://lnkd.in/dKA9nbwz #GfG160 #GeekStreak2024 #DrGVishwanathanChallenge #VITBhopalLion #CodingChallenge #cpp #160DaysOfCode #ProblemSolving

🚀 Day 20 of #gfg160 🚀 🎉 Today, I successfully solved the "Count Inversions" problem. 🏆 Time Complexity: O(n logn) Auxiliary Space: O(n) Solving daily coding problems has been a great way to sharpen my problem-solving skills, and I’m looking forward to keeping up this streak! 💪 Here's a screenshot of the problem I solved. #gfg160 #geekstreak2024 #gfg GeeksforGeeks

🚀 Day 2 of #GFG 160 daysofcodechallenge. Todays problem on GeeksforGeeks is : Given an array arr[]. Push all the zeros of the given array to the right end of the array while maintaining the order of non-zero elements. Do the mentioned change in the array in place. Examples: Input: arr[] = [1, 2, 0, 4, 3, 0, 5, 0] Output: [1, 2, 4, 3, 5, 0, 0, 0] Explanation: There are three 0s that are moved to the end. Constraints: 1 ≤ arr.size() ≤ 105 0 ≤ arr[i] ≤ 105 #gfg #geeksforgeeks #gfg160 #geeksstreak2024 #learntocode #dsa160 #problemsolving #codingchallenge

🚀 Day 12 of #gfg160 🚀 🎉 Today, I solved the "Anagram" problem successfully. 🏆 Time Complexity: O(n + m) Auxiliary Space: O(1) Solving daily coding problems has been a great way to sharpen my problem-solving skills, and I’m looking forward to keeping up this streak! 💪 Here's a screenshot of the problem I solved. Join me on this coding journey to keep up the momentum and improve daily! #gfg160 #geekstreak2024 #gfg GeeksforGeeks

🎯 Day [1] of GfG 160 Challenge 🎯 I just solved the problem "Second Largest Element in an Array" on GeeksforGeeks as part of the #gfg160 and #geekstreak2024 challenge! 🚀 This challenge has been an incredible way to sharpen my problem-solving skills and stay consistent with daily coding. 💻✨ Here’s the problem in brief: 🔍 Task: Given an array, find the second largest element. 💡 Approach: Used a simple traversal technique to identify the largest and second largest elements in a single pass, ensuring an efficient O(n) solution! Looking forward to maintaining the streak for 80 days and unlocking exciting rewards! 🏅 Join me in this challenge, and let’s grow together as better problem-solvers! 💪 #CodingChallenge #GeeksForGeeks #Consistency #CodingGoals GeeksforGeeks

🚀 Day 6 of #GFG 160 daysofcodechallenge. Todays problem on GeeksforGeeks is : You are given an array of integer arr[] where each number represents a vote to a candidate. Return the candidates that have votes greater than one-third of the total votes, If there's not a majority vote, return an empty array.  Note: The answer should be returned in an increasing format. Examples: Input: arr[] = [2, 1, 5, 5, 5, 5, 6, 6, 6, 6, 6] Output: [5, 6] Explanation: 5 and 6 occur more n/3 times. #gfg #geeksforgeeks #gfg160 #geeksstreak2024 #learntocode #dsa160 #problemsolving #codingchallenge

🌟 Day 17 of the #GFG160 Day Challenge 🌟 Today's problem was Non-Repeating Character 🔍, a classic string problem that sharpened my logical thinking! 💻 Problem: Find the first non-repeating character in a string. If no such character exists, return '$'. Example: Input: s = "geeksforgeeks" Output: 'f' Explanation: The first non-repeating character is 'f'. Each day of this challenge reinforces my problem-solving skills and builds confidence. Excited for the days ahead! 🙌 Thank you, GeeksforGeeks , for keeping us engaged and motivated. 🚀 #GFG #CodingChallenge #Day17 #ProblemSolving #KeepCoding #GeekStreak2024

🚀 Day 1 of #GFG 160 daysofcodechallenge. Todays problem on GeeksforGeeks is : Given an array of positive integers arr[], return the second largest element from the array. If the second largest element doesn't exist then return -1. Example : Input: arr[] = [12, 35, 1, 10, 34, 1] Output: 34 Explanation: The largest element of the array is 35 and the second largest element is 34. Constraints: 2 ≤ arr.size() ≤ 105 1 ≤ arr[i] ≤ 105 #gfg #geeksforgeeks #gfg160 #geeksstreak2024 #learntocode #dsa160 #problemsolving #codingchallenge