Saji Kuttan’s Post

🚀 Leetcode Daily Challenge 📅 25th March 2024 Post Part-I (Problem Statement) Problem Statement: Given an integer array nums of length n where all the integers of nums are in the range [1, n] and each integer appears once or twice, return an array of all the integers that appears twice. You must write an algorithm that runs in O(n) time and uses only constant extra space. Example 1: Input: nums = [4,3,2,7,8,2,3,1] Output: [2,3] Can you think about the solution 🤔? ***NOTE : need to solve in O(n) time and uses only constant extra space.*** #dailycodingchallenge #leetcode #problemoftheday #programmers

🚀 Leetcode Daily Challenge 📅 11th April 2024 Post Part-I (Problem Statement) Problem Statement: Given string num representing a non-negative integer num, and an integer k, return the smallest possible integer after removingkdigits from num. Example: Input: num = "1432219", k = 3 Output: "1219" Explanation: Remove the three digits 4, 3, and 2 to form the new number 1219 which is the smallest. Input: num = "10200", k = 1 Output: "200" Explanation: Remove the leading 1 and the number is 200. Note that the output must not contain leading zeroes. #dailycodingchallenge #leetcode #problemoftheday #programmers

🚀 Leetcode Daily Challenge 📅 29th March 2024 Post Part-I (Problem Statement) Problem Statement: You are given an integer array nums and a positive integer k. Return the number of subarrays where the maximum element of nums appears at least k times in that subarray. A subarray is a contiguous sequence of elements within an array. Example 1: Input: nums = [1,3,2,3,3], k = 2 Output: 6 Explanation: The subarrays that contain the element 3 at least 2 times are: [1,3,2,3], [1,3,2,3,3], [3,2,3], [3,2,3,3], [2,3,3] and [3,3]. #dailycodingchallenge #leetcode #problemoftheday #programmers

🚀 Leetcode Daily Challenge 📅 14th March 2024 Post Part-I (Problem Statement) Problem Statement: Given a binary array nums and an integer goal, return the number of non-empty subarrays with a sum goal. A subarray is a contiguous part of the array.   Example 1: Input: nums = [1,0,1,0,1], goal = 2 Output: 4 Explanation: The 4 subarrays are bolded and underlined below: [1,0,1,0,1] [1,0,1,0,1] [1,0,1,0,1] [1,0,1,0,1] Example 2: Input: nums = [0,0,0,0,0], goal = 0 Output: 15 Can you think about the solution 🤔? #dailycodingchallenge #leetcode #problemoftheday #programmers

🚀 Leetcode Daily Challenge 📅 28th March 2024 Post Part-I (Problem Statement) Problem Statement: You are given an integer array nums and an integer k. The frequency of an element x is the number of times it occurs in an array. An array is called good if the frequency of each element in this array is less than or equal to k. Return the length of the longest good subarray of nums. A subarray is a contiguous non-empty sequence of elements within an array. Example 1: Input: nums = [1,2,3,1,2,3,1,2], k = 2 Output: 6 Explanation: The longest possible good subarray is [1,2,3,1,2,3] since the values 1, 2, and 3 occur at most twice in this subarray. Note that the subarrays [2,3,1,2,3,1] and [3,1,2,3,1,2] are also good. It can be shown that there are no good subarrays with length more than 6. #dailycodingchallenge #leetcode #problemoftheday #programmers

#30-day streak on LeetCode this month! Mastered algorithms like sorting, sliding window, linked lists, and BSTs. Solved 50+ questions this month based on above mentioned algorithms. Which has strengthen my concepts and enhanced my logic. Great experience with competitive programming!! Just started to feel a real programmer 😁 !!! Feeling confident of the progress and ready for more challenges! #LeetCode #CodingStreak #Algorithms #ContinuousLearning #CodingJourney

🚀 Leetcode Daily Challenge 📅 27th Feb 2024 Post Part-I (Intuition and Problem Statement) Problem Statement: Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root. The length of a path between two nodes is represented by the number of edges between them. Intuition: The problem requires finding the diameter of a binary tree, which is defined as the number of nodes along the longest path between any two nodes in the tree. Initially, consider traversing the tree recursively, calculating the length of the longest path passing through each node. Can you think about the solution 🤔? #dailycodingchallenge #leetcode #problemoftheday #programmers

🚀 𝐃𝐚𝐲 𝟑𝟐 𝐨𝐟 𝟏𝟎𝟎 𝐃𝐚𝐲𝐬 LeetCode 𝐏𝐫𝐨𝐛𝐥𝐞𝐦 𝐒𝐨𝐥𝐯𝐢𝐧𝐠 𝐂𝐡𝐚𝐥𝐥𝐞𝐧𝐠𝐞 🔍 Leetcode Challenge: 𝐄𝐯𝐚𝐥𝐮𝐚𝐭𝐞 𝐑𝐞𝐯𝐞𝐫𝐬𝐞 𝐏𝐨𝐥𝐢𝐬𝐡 𝐍𝐨𝐭𝐚𝐭𝐢𝐨𝐧 🔍 🔹 𝐏𝐫𝐨𝐛𝐥𝐞𝐦: Given an array of strings representing an arithmetic expression in Reverse Polish Notation (RPN), evaluate the expression and return its integer value. Valid operators are '+', '-', '*', and '/'. Operands may be integers or other expressions, and division truncates toward zero. 🔹 𝐀𝐩𝐩𝐫𝐨𝐚𝐜𝐡: 𝐒𝐭𝐚𝐜𝐤-𝐁𝐚𝐬𝐞𝐝 𝐄𝐯𝐚𝐥𝐮𝐚𝐭𝐢𝐨𝐧: Used a stack to store operands. 𝐏𝐫𝐨𝐜𝐞𝐬𝐬𝐢𝐧𝐠 𝐓𝐨𝐤𝐞𝐧𝐬: Iterated through each token, pushing numbers onto the stack and applying operators by popping the required operands. 𝐎𝐩𝐞𝐫𝐚𝐭𝐢𝐨𝐧𝐬 𝐇𝐚𝐧𝐝𝐥𝐢𝐧𝐠: Implemented addition, subtraction, multiplication, and division by popping operands, performing the operation, and pushing the result back onto the stack. 𝐑𝐞𝐬𝐮𝐥𝐭 𝐄𝐱𝐭𝐫𝐚𝐜𝐭𝐢𝐨𝐧: The final result was the last element remaining on the stack. 🔹 𝐎𝐮𝐭𝐜𝐨𝐦𝐞: Successfully evaluated RPN expressions in O(n) time complexity, ensuring correct handling of various operators and operand combinations. Submission Link:https://lnkd.in/gB9ZAk5N #coding #leetcode #problemsolving #programming #stack #datastructures

DAY 60 of problem solving in leetcode 🚀 PROBLEM : The set [1, 2, 3, ..., n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, we get the following sequence for n = 3: "123" "132" "213" "231" "312" "321" Given n and k, return the kth permutation sequence. Example 1: Input: n = 3, k = 3 Output: "213" Example 2: Input: n = 4, k = 9 Output: "2314" Example 3: Input: n = 3, k = 1 Output: "123" Constraints: 1 <= n <= 9 1 <= k <= n! #CODING #C++ #LEETCODE #LOVEFORCODING

Hello #connections 🙋♀️ Let's discuss the solutions for today's LeetCode Biweekly Contest 124📈 1. Maximum Number of Operations With the Same Score I -->The code uses a queue to pair up elements from an array and calculate their sum. It continues pairing until no more pairs can be formed, counting the operations with consistent sums. The result is the maximum count of such operations. 2. Apply Operations to Make String Empty -->Find the character(s) with the highest frequency at the last positions in a given string, using HashMaps to track character occurrences and their last indices, and then construct a resulting string based on these characters and their order of occurrence at the end of the input string. 3. Maximum Number of Operations With the Same Score II -->Calculate the maximum number of operations with consistent sums in an array by considering three possible ways to choose pairs of elements. It uses dynamic programming and recursion to find the optimal solution. Visit: https://lnkd.in/gGF6HDpJ #coding #dsa #contest #leetcode #leetcodechallenge