Saji Kuttan’s Post

🚀 Day 53 of #YearLongDSAChallenge 🌟 Solved the "Majority Element II" problem on LeetCode! 💪 📚 𝐏𝐫𝐨𝐛𝐥𝐞𝐦 𝐎𝐯𝐞𝐫𝐯𝐢𝐞𝐰: Given an integer array, find all elements that appear more than ⌊ n/3 ⌋ times. 🚀 𝐓𝐨𝐝𝐚𝐲'𝐬 𝐀𝐜𝐡𝐢𝐞𝐯𝐞𝐦𝐞𝐧𝐭: ➡️ Successfully solved the "Majority Element II" problem on LeetCode! 🧩 ➡️ Implemented an algorithm to find elements that appear more than ⌊ n/3 ⌋ times in an array. 💡 𝐊𝐞𝐲 𝐈𝐧𝐬𝐢𝐠𝐡𝐭𝐬: ➡️ Utilized a HashMap to count the frequency of each element in the array. ➡️ Iterated through the map to find elements with frequencies greater than ⌊ n/3 ⌋. ➡️ Returned a list containing all such elements. 🌐 #LeetCodeChallenge #TakeuForward #CodingJourney #JavaProgramming Another problem solved! Share your progress with the community! #CodingCommunity #AlgorithmAdventure 👨💻✨

Hello Everyone👋 #DAY10 Let's Discuss 10 Feb 2024, Daily Leetcode Challenge Q: 647. Palindromic Substrings Intuition Behind this: Get all substring and check its palindrome or not. Full explanation with code and  Pen and Paper | O(n^3) -> O(n^2) : https://lnkd.in/g3CSasaF Can you develop an optimized solution or share your thoughts on approaching this problem? Comment below! 👇 #leetcodechallenge #codeexploration #dailycoding #dailyleetcodechallenge Rahul Maheshwari

Hello everyone!! it was 56 day of #75daysofcode 🔴56/75 The day didn't start well; I woke up too late. I began by revising questions on linked lists, focusing on: 1. Adding one to a number represented by a linked list. 2. Adding two numbers in the form of a linked list. I completed these two questions, and the rest of the time was spent on random exploration. 😐 #75daysofcodechallenge #75daysofcode #75daysofcoding

🌟 LeetCode Day 41 Challenge Completed! 🚀 The one LeetCode challenges I conquered today:- Solution Approach: Given a binary tree, add a row of nodes at a specified depth with a given value. This involves traversing the tree and inserting nodes according to certain rules. The task tests your understanding of tree traversal and node manipulation. Check out my solution on LeetCode! #LeetCodehashtag #Codinghashtag #Algorithmshashtag #problemsolvinghashtag #leetcode100days

DAY93 #100daysofcodechallange organized by the PAT team of #vitbhopal . ✅ ✅ ✅ Problem Solved (Leetcode 43) Multiply Strings Difficulty level (Medium) Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Note: You must not use any built-in BigInteger library or convert the inputs to integer directly. #drgvishwanathanchallenge #cpp #leetcode #100daysofbeingalion #codingjourney

🚀 Leetcode Daily Challenge 📅 12th Mar 2024 Post Part-II (Intuition and Solution) Intuition: To approach this problem, we can utilize a hashmap to keep track of the cumulative sum encountered while traversing the linked list. If we encounter the same cumulative sum again, it means the subsequence between the current node and the node with the same cumulative sum sums to zero, so we can remove that subsequence. To facilitate this removal, we maintain a dummy node to handle cases where the entire linked list needs to be modified. #comment the Time Complexity and Space Complexity for this approach. #dailycodingchallenge #leetcode #problem #solution

🚀 Leetcode Daily Challenge 📅 8th Mar 2024 Post Part-II (Approach and Solution) Approach: Step 1: We will use a hash table to get frequencies. Step 2: Then we will find the maximum frequency from the hash table. Step 3: After that, we will check how many times does the maximum frequency occurred in the same hash table. Final step: Return the product of maximum frequency and occurred count. #comment the Time Complexity and Space Complexity for this approach. #dailycodingchallenge #leetcode #problem #solution

🌟 Day 55 of #LeetCode Daily Challenge 🌟 Today’s problem was LeetCode 2501: Longest Square Streak in an Array. This challenge required identifying the longest streak of numbers in an array where each number is the square of the previous one, revealing patterns in a unique sequence. I approached it with a HashMap-based solution to map each number to the length of its possible square streak. By leveraging square root checks and dynamic updates to the map, I optimized the solution for efficiency. It's been great to dive deeper into pattern-based solutions! Every new problem is a step forward! 🧠💪 #LeetCodeChallenge #HashMap #CodingJourney #ProblemSolving #DailyCoding

🎯 Leetcode daily challenge 🗓 !!! Today is Day 15 of the 50-Day Consistency Challenge. Today, I'm solving the problem of the day. Problem: Sum Root to Leaf Numbers. Topic: Tree, Depth-First Search, Binary Tree. #leetode #leetcodedailychallenge

Hello connections, Here is my solution to the Daily LeetCoding Challenge for February, Day 15. Problem link: https://lnkd.in/dmBn-Zmn Github Solution link: https://lnkd.in/dUjhacQW LeetCode Solution link (Detailed Explanation): https://lnkd.in/dmedjxQM Time Complexity - O(N log N) Space Complexity - O(log N) Learning from the problem: By understanding the triangle inequality theorem, which dictates that the sum of the lengths of any two sides of a triangle must be greater than the length of the remaining side, we can optimise our approach. Sorting the array allows us to easily identify potential triangle sides and efficiently iterate through them to find the largest perimeter. #leetcode #problemsolving #cpp #datastructures #happycoding