Himanshu Shekhar

#100daysleetcodechallenge Day 1/100💥 Problem no : 2826 Difficulty : Medium Sorting Three Groups-https://lnkd.in/e2ZwJCSb Solution -https://lnkd.in/e8_R2iqq #leetcode #leetcodechallenge #coding #skills #100dayschallenge #problemsolving #cpp #python

8

Today I joined Mega Class and solved the 3SUM Problem by Love Babbar ✔️Day 9: Supreme Batch 3.0 ✳What I learned today! - Arrays leetcode question understanding 3 questions - find unique - 2 Sums - 3 Sums - Shifting Array / rotating array - that's all today class ✳Time to practice array questions and previous lecture Thanks, Codehelp #supremebatch3.0 #Supreme3.0 #C++ #datastucture #algorithm #codehelp

28

Day 4 of #30daysofcodingchallenge #DrGViswanathan challenge Today I solved the problem: Minimum add to make parenthesis valid Problem description: A parentheses string is valid if and only if: It is the empty string, It can be written as AB (A concatenated with B), where A and B are valid strings, or It can be written as (A), where A is a valid string. You are given a parentheses string s. In one move, you can insert a parenthesis at any position of the string.

17

1 Comment

🌟 Day 31/160: K-th Element of Two Sorted Arrays 🌟 Today, I tackled an interesting medium-level problem: 💡 Problem Statement: Given two sorted arrays, find the element that would be at the K-th position in their combined sorted array, without explicitly merging them. 🔑 Key Insights: The naive approach of merging both arrays takes O(m+n)O(m + n)O(m+n), but I optimized it to O(log⁡(min⁡(m,n)))O(\log(\min(m, n)))O(log(min(m,n))) using binary search. By partitioning one array and calculating the complementary partition in the other, I could directly pinpoint the K-th smallest element. 📚 Takeaway: This problem reinforced the power of binary search for optimizing solutions and handling sorted arrays effectively. One step closer to mastering problem-solving! 💪 Let’s keep pushing forward 🚀 #GFG #GeekStreak2024 #ProblemSolving #GFG160 #GeeksForGeeks

14

Day 8/160 GeeksforGeeks DSA challenge Today’s focus was on tackling problems related to arrays and optimization techniques. One of the highlights was solving a classic problem: "Maximum profit from stock prices with at most one transaction" 💹. #DSAChallenge #CodingJourney #ProblemSolving #DataStructuresAndAlgorithms #KeepLearning #geeksforgeeks

5

**Day 9 of #DrGViswanathanChallenge #100DaysOfCode** Solved the "Increasing Triplet Subsequence" problem today! 🔺🔻 **My Approach:** - Used two variables to track the smallest and second smallest numbers while iterating through the array. - As soon as I found a third number greater than both, the solution was confirmed! Key takeaway: Optimized the solution to O(n) time and O(1) space—it's all about keeping track of the right values! 💡 #Coding #Java #LeetCode #ProblemSolving #Algorithms #100DaysOfCode #VITBhopal #VITBhopalLions

7

🚀Kicking Off My 21 Days POTD Challenge on geeksforgeeks!🌟 𝐃𝐚𝐲 21 𝐨𝐟 21 𝗛𝗲𝘆 𝗟𝗶𝗻𝗸𝗲𝗱𝗶𝗻 𝗙𝗮𝗺𝗶𝗹𝘆!👋 𝗧𝗼𝗱𝗮𝘆, 𝗜 𝗦𝗼𝗹𝘃𝗲𝗱 Medium 𝗟𝗲𝘃𝗲𝗹 𝗣𝗿𝗼𝗯𝗹𝗲𝗺. 𝗣𝗿𝗼𝗯𝗹𝗲𝗺 𝘁𝗵𝗮𝘁 𝗜 𝗦𝗼𝗹𝘃𝗲𝗱: Rotate and delete Problem Description: Given an array arr integers. Assume sz to be the initial size of the array. Do the following operations exactly sz/2 times. In every kth (1<= k <= sz/2) operation: Right-rotate the array clockwise by 1. Delete the (n– k + 1)th element from begin. Now, Return the first element of the array. Note: Here n keeps on decreasing with every operation. 𝗣𝗿𝗼𝗯𝗹𝗲𝗺 𝗕𝗿𝗲𝗮𝗸𝗱𝗼𝘄𝗻: - 𝗥𝗶𝗴𝗵𝘁 𝗥𝗼𝘁𝗮𝘁𝗲: Each time, we need to right-rotate the array by one position, meaning the last element moves to the first position and every other element shifts right. - 𝗗𝗲𝗹𝗲𝘁𝗲 𝘁𝗵𝗲 (𝗻 - 𝗸 + 𝟭)𝘁𝗵 𝗲𝗹𝗲𝗺𝗲𝗻𝘁 𝗳𝗿𝗼𝗺 𝘁𝗵𝗲 𝗯𝗲𝗴𝗶𝗻𝗻𝗶𝗻𝗴: After each rotation, we remove the element located at position (n - k + 1) where n is the current size of the array, and k is the iteration number (starting from 1). - Repeat the above two operations sz/2 times where sz is the initial size of the array. - After all operations, return the first element of the array. 𝗔𝗽𝗽𝗿𝗼𝗮𝗰𝗵: - Use a loop to perform the operations sz/2 times. - For each iteration, right-rotate the array by 1. - Then, remove the (n - k + 1)th element from the beginning (which is n-k in zero-based index). - After completing all iterations, return the first element of the array. 𝗘𝘅𝗽𝗹𝗮𝗻𝗮𝘁𝗶𝗼𝗻: - 𝗥𝗶𝗴𝗵𝘁 𝗥𝗼𝘁𝗮𝘁𝗲: We take the last element, remove it from the array, and insert it at the first position. This simulates the right-rotate operation. - 𝗗𝗲𝗹𝗲𝘁𝗲 𝘁𝗵𝗲 (𝗻 - 𝗸 + 𝟭)𝘁𝗵 𝗲𝗹𝗲𝗺𝗲𝗻𝘁: We calculate the zero-based index for the element to delete using the formula (n - k) (where n is the current array size and k is the operation number). - After performing sz/2 operations, the first element of the array is returned as the result. Excited to share more updates with you all as I progress through this coding journey! 💻🌟 #geekstreak2024 #geeksforgeeks #deutschebank #DeutscheBank

2

🎯 Day 255 of 365 Days of DSA Challenge: Conquered the Snake and Ladder Problem! 🐍🪜 Today, I tackled a fascinating problem that combines both strategy and problem-solving. The Snake and Ladder problem brings back childhood memories, but this time, it required a breadth-first search (BFS) approach to efficiently navigate the board and find the shortest path to victory. 💡 Key Takeaways: BFS is perfect for problems involving shortest paths on an unweighted graph. Mapping out snakes and ladders as edges helped visualize the game in a whole new light. Every challenge is another step toward mastering algorithms and data structures! Excited for the next challenge! 💪 Discord Server: https://lnkd.in/gstPhXQX Scaler #DataStructure #Algorithms #CodingChallenge #ProgrammingJourney #CodeNewbieLeetCode LeetCode #AchievementUnlocked #scalerdiscord #codewithscaler #365daysofcodescaler #365daysofcode #100DaysOfCode #DSA #DataStructures #Algorithms #ProblemSolving #CodingJourney #LinkedInCodingCommunity

4

🚀 Day 187 of my 365-day LeetCode Challenge Today, I tackled Problem 1727: Largest Submatrix With Rearrangements. This problem challenges us to find the largest submatrix area after rearranging columns in any order. ✔️ Problem: 1727. Largest Submatrix With Rearrangements 💡 Java Approach: Computed the height of consecutive 1s for each column by iterating row-wise. For each row, sorted the column heights in descending order to maximize the potential area. Calculated the area for every column in the sorted row using height * (column index + 1). Kept track of the maximum area across all rows. This approach combines sorting with dynamic programming concepts to efficiently compute the largest submatrix area. ✔️ Progress: ✅ 187/365 days completed — optimizing matrices and maximizing areas! 🏗️✨ LeetCode Leetcode Challenge Daily Leetcode #LeetCode #LeetcodeChallenge #DailyLeetcode #187DayChallenge #Submatrix #CodingSolutions #JavaProgramming #ProblemSolving #CodingJourney

5

🚀 Day 199 of 365 Days of DSA Challenge 🚀 Today, I learned to solve: Best Time to Buy and Sell Stock III(https://lnkd.in/dsFuBK79) - Explored advanced dynamic programming techniques to handle at most two transactions.  - Enhanced my problem-solving skills with deeper insights into optimization strategies. The journey continues stronger than ever! #DSAChallenge #Day199 #DynamicProgramming #StockTrading #CodeEveryDay 

9

Day 8 of #30DaysCodingChallenge 🚀 Problem Name: Plus one Problem ID:66 ✅ Approach: 1. Traversing the Array: Start from the least significant digit (rightmost) and check if it is less than 9. If it is, increment it and return the array immediately. 2.Handling Carry: If a digit is 9, set it to 0 and continue to the next digit to the left. Repeat this process until there are no more digits to process. 3.Edge Case: If all the digits are 9 (e.g., [9, 9, 9]), create a new array one element larger. The most significant digit is set to 1, and the rest are 0. #coding #java #day8 #leetcode

27

🌟 Day 127 of My LeetCode Journey! 🌟 Today, I tackled another fascinating challenge on LeetCode, advancing further in my pursuit of growth and skill enhancement: 🔄 𝐏𝐫𝐨𝐛𝐥𝐞𝐦: 938. Range Sum of BST ✨ 𝐃𝐢𝐟𝐟𝐢𝐜𝐮𝐥𝐭𝐲: Easy ⏱️ 𝐓𝐢𝐦𝐞 𝐂𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲: O(n) 🚀 𝐒𝐩𝐚𝐜𝐞 𝐂𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲: O(n) 🧠 𝐊𝐞𝐲 𝐂𝐨𝐧𝐜𝐞𝐩𝐭𝐬: DFS, Binary Tree, Binary Search Tree. Each challenge provides a unique learning experience, pushing the boundaries of my problem-solving skills. This continuous endeavor is about more than just coding; it's about embracing the journey of perpetual improvement. #LeetCode #CodingJourney #StayMotivated #KeepLearning #ProblemSolving #CodingChallenge #ContinuousImprovement #DailyLeetCode #TechSkills #Programming #DeveloperLife #CodeNewbie #365DaysOfCode #JavaProgramming #TechCommunity #CodeEveryDay #AlgorithmChallenges #DailyPractice #SkillBuilding #GrowthMindset #TechInspiration #Innovation #Commitment #Resilience #GoalSetting #Success #TechPassion #CodingLife #LearningNeverStops #SoftwareDevelopment #CodeMastery #DailyCodingPractice #JavaDeveloper Leetcode Challenge | Daily Leetcode

25

🌟 LeetCode 100 Days Challenge 🌟 🖥️ Day 21/100: 🎯 Today's Goal: Left and Right Sum Differences  💡 Given a 0-indexed integer array nums, find a 0-indexed integer array answer where: answer.length == nums.length. answer[i] = |leftSum[i] - rightSum[i]|. Where: leftSum[i] is the sum of elements to the left of the index i in the array nums. If there is no such element, leftSum[i] = 0. rightSum[i] is the sum of elements to the right of the index i in the array nums. If there is no such element, rightSum[i] = 0. Return the array answer.   Example 1: Input: nums = [10,4,8,3] Output: [15,1,11,22] Explanation: The array leftSum is [0,10,14,22] and the array rightSum is [15,11,3,0]. The array answer is [|0 - 15|,|10 - 11|,|14 - 3|,|22 - 0|] = [15,1,11,22]. 🏁 hashtag #LeetCodeChallenge hashtag #CodingJourney hashtag #100DaysOfCode

6

1 Comment

Hey folks, hope you all are doing well.✨ DAY-9 of learning WEB-D.🚀 Today, i worked upon: - <div> and <span> tag - some semantic tags: - article - aside - details - figcaption - main - header - nav - footer - section - Creating favicon. Here my doubt arises , pls try to resolve it in the comment section.... What is the difference b/w <main> & <body> tag ? #web_development #HTML #CSS #coding #coding_journey #javascript

3

Day 45 of #150daysofcoding Cohort 0 to 100 Week 19 - completed till 19.1 ✅ Today I am learning What is Websockets and Some Advance Backend stuff Overall a good day 😌 100xDevs #buildinginpublic Harkirat Singh #fullstackDevelopment

1

#100DaysOfCodeChallenge Day - 100 / 100 Today's Problem - Arranging Coins Problem statement - You have n coins and you want to build a staircase with these coins. The staircase consists of k rows where the ith row has exactly i coins. The last row of the staircase may be incomplete. Given the integer n, return the number of complete rows of the staircase you will build. Example - Input: n = 5 Output: 2 Time complexity - O(1) Space complexity - O(1)

65

5 Comments

🎉Day 22 of 100 Days of DSA Challenge 🎉 #100DaysofDSA Hello everyone! Day 22 is here, and after exploring doubly linked lists yesterday, I’m eager to delve deeper into more advanced applications and nuanced scenarios where doubly linked lists shine. 📚 Advancing with Doubly Linked Lists: 1. Recap of Day 21: 🔸 We covered the basics of doubly linked lists, including their structure and basic operations like insertion, deletion, and traversal. 🔸 Discussed practical applications like browser history management, undo-redo functionality, and music playlists. 2. Advanced Operations and Use Cases: - Reversing a Doubly Linked List: 🔸 A straightforward process thanks to the bidirectional nature of the list. - Sorting: 🔸 Implementing efficient sorting algorithms such as quicksort or mergesort directly on the list. - Splitting and Merging: 🔸 Handling large data sets by splitting lists and merging them as needed. 3. Real-World Scenarios: - Memory Management: 🔸 Used in operating systems for managing free memory blocks. - Cache Implementation: 🔸 Often utilized in LRU (Least Recently Used) cache algorithms for efficient data retrieval and storage. - Complex Data Structures: 🔸 Forms the backbone of more complex data structures like Fibonacci heaps and graph adjacency representations. 🔹 Hands-on Coding: Today, I'll be tackling more complex problems: - Reversing a doubly linked list. - Implementing sorting algorithms. - Demonstrating a real-world application like an LRU cache. 🔹 Insights and Learnings: - I’ll share code snippets and explanations of these advanced operations. - Discuss the performance implications and optimizations for these tasks. 🔹 Looking Ahead: Tomorrow, I’ll transition into exploring another critical data structure – Binary Trees. Understanding trees will lay the foundation for solving hierarchical data problems efficiently. 💬 Join the Conversation: Working on advanced data structures? Let’s connect! Sharing insights and challenges will help us all progress faster. Happy coding! 💻 #100DaysOfCode #DoublyLinkedLists #AdvancedDataStructures #Algorithms #CodingJourney #TechInnovation #ProblemSolving #100DaysofDSA #RealWorldApplications Looking forward to Day 23 and the exciting journey ahead!

8

1 Comment

Day - 26: Today I tackled 3 problems . 1. Palindrome Doubly Linked list 2. Find a Node in a Linked list (Recursive). 3. Reverse Linked list (Iterative) If you're interested in exploring my solutions further, I invite you to visit my GitHub repository, where you can access and review my code ! 👇 [ https://lnkd.in/gpD6aPsR] Platform - Coding Ninjas ; #cpp. #coding #Programming #trending #challenge #DSA #Day26 #github

1

Day 26 of 100 days of code challenge💫 #100DaysOfCode challenge #DrGViswanathan challenge ✨ Every small step is a step towards progress ✨ Problem Statement: Given head which is a reference node to a singly- linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary representation of a number. Return the decimal value of the number in the linked list. The most significant bit is at the head of the linked list. #ConvertBinaryNumberInALinkedListToDecimal #VITBhopal #VITBhopalLion #IbelieveIcanfly #Leetcode

2