Sidharth dhiman

Hi connection, Today I Solved too hard question 502. IPO Problem in LeetCode uSing Swift.... ✴Intution:- Here we are going to be using a greedy approach where we prioritize projects based on their profits while considering the capital constraints. ✴Approach Initial Check: If the initial capital is sufficient to undertake any project (i.e., it is greater than or equal to the maximum capital requirement), simply sort the projects by profit in descending order and select the top k projects. This can be achieved by sorting the profits array and summing the top k elements. ✴Greedy Selection with Capital Constraints: Create an array of tuples combining the capital and profits arrays. Initialize the current capital to the given initial capital. Iterate up to k times to select projects. In each iteration, find the project with the highest profit that can be afforded with the current capital. If a project is found, add its profit to the current capital and mark the project as used by setting its capital requirement to a very high value. If no affordable project is found, break out of the loop early. ✴Complexity Time complexity: The time complexity of the approach is dominated by the need to find the most profitable affordable project in each of the kk k iterations. If we assume there are nn n projects: Sorting the profits array initially (if the initial capital is sufficient) takes O(nlog⁡n) In the general case, each iteration requires scanning through the projects, leading to a time complexity of O(k⋅n)O(k \cdot n) O(k⋅n). Thus, the overall time complexity is O(nlog⁡n+k⋅n). Space complexity: The space complexity is O(n)O(n) O(n) due to the storage of the projects array, which combines the capital and profits arrays. credit: approach in leet code solution feed 🙌 Happy coding 🙌

20

21.09.2024 Leetcode 100 Days Challenge - Day 3 Problem No : 50 A Feeling of Pride on reaching my first milestone of solving 50 Problems on Leetcode, and a sheer Feeling of Grit to acheive more. Solving programs on Leetcode has surely reflected my potential and I desire further enrichment. Solution: class Solution:     def myPow(self, x, n):         if n == 0:             return 1                 if n < 0:             x = 1 / x             n = -n         if n % 2 == 0:             return self.myPow(x * x, n // 2)         else:             return x * self.myPow(x * x, (n - 1) // 2) Easwari Engineering College(SRM Group) Dr. Kalai Selvi Thanupillai Revathi paramanathan Vijayaraj Janarthanan

12

Leetcode Contest 408 Problem A - Sum one- digit and two-digit numbers seprately and see if they are the same or not using OR operator. Problem B - Squares of primes numbers are such numbers only. So we just need to count how many prime squares are between these two numbers. Problem C - Could not solve during the contest. Problem D - In this question, if either (0,0) or (X,Y) lies inside any of the circles, it is not possible to proceed. We then consider each circle as a vertex of a graph and add an edge between all pairs of circles that intersect with each other. If there is a path of intersecting circles from the top edge to the bottom or right edge, or from the left edge to the bottom or right edge, we would not be able to reach the top-right cell (X,Y). To address this, we maintain two additional vertices: n for the top and left edges, and n + 1 for the right and bottom edges. These vertices are added to the graph if they intersect with any of the circles. If vertices n and n + 1 belong to the same connected component, it means we cannot reach from the bottom-left to the top-right corner. We can easily verify this using a Disjoint Set Union (DSU) of size n + 2, employing rank and path compression for optimization. #Leetcode #Editorial #WeeklyContest

8

🚀 Day 9: #CrackYourPlacement #CrackYourInternship Hey everyone 🌟, Keeping the momentum strong on the #CrackYourPlacement challenge! Today, I tackled: ➕ Add Two Numbers II ❌ Remove Nth Node From End of List 🌀 Rearrange a Linked List in Zig-Zag Fashion ⚖️ Segregate Even and Odd Nodes in a Linked List 📝 Check out my solutions on GitHub: https://lnkd.in/gQpxfTYw Feeling motivated and ready for more challenges. Let's keep this coding journey exciting! 🚀💻 Stay tuned for more updates! #CrackYourPlacement #CrackYourInternship #DSA #CodingChallenge #TechJourney #ProblemSolving #LinkedLists #EasyDifficulty

1

🌟 Conquering Challenges in the Div4 CodeForces Contest 🌟 Participating in competitive programming contests always brings its own set of challenges and learnings, and my recent Div4 Codeforces contest was no different. Here's a glimpse of my rollercoaster experience: 🔹Problem 2: Initially, I messed up by not taking the input correctly. I was panicking, trying to figure out why my code wasn’t working 😥 . Lesson learned: double-check inputs! 🔹Problem 3: I used a set but kept getting results off by ±1. Everything seemed right logically, so I switched to `long long` instead of `int`, even though the range was within `int` 😪 . Still, the issue persisted. Sometimes, it's the small details that trip us up. 🔹Problem 4: This was a relatively easy one - finding the center of a Manhattan circle in a grid of characters. A confidence booster amidst the chaos! ✌ 🔹Problem 5 (E): I hit a wall here 🤒 . No solution came to mind, and frustration was setting in. I was ready to give up and go to sleep in a bad mood 😔 . 🔹Problem 6 (F): Just when I was about to throw in the towel, I decided to give the next problem a try. Using Binary Search, I managed to solve it! 😍 This win turned the whole contest around for me, making all the struggles worth it and lifting my spirits. 💪 Despite wasting a lot of time on silly mistakes in the first half⏱, solving the final problem was incredibly satisfying. It reminded me that perseverance pays off, and sometimes, the breakthrough is just around the corner. To all my fellow coders out there: keep pushing, stay curious, and don’t let the setbacks define your journey. Every contest is a learning experience. Onward and upward! 🚀 #CompetitiveProgramming #Codeforces #ProblemSolving #NeverGiveUp #LearningJourney #CodingLife

5

LeetCode Weekly Contest #400 1. 𝗠𝗶𝗻𝗶𝗺𝘂𝗺 𝗡𝘂𝗺𝗯𝗲𝗿 𝗼𝗳 𝗖𝗵𝗮𝗶𝗿𝘀 𝗶𝗻 𝗪𝗮𝗶𝘁𝗶𝗻𝗴 𝗥𝗼𝗼𝗺 - Just Need to track consecutive 'E's, update the maximum needed chairs, and return the maximum count of consecutive 'E's. 2. 𝗖𝗼𝘂𝗻𝘁 𝗗𝗮𝘆𝘀 𝗪𝗶𝘁𝗵𝗼𝘂𝘁 𝗠𝗲𝗲𝘁𝗶𝗻𝗴𝘀 - Quite Similar to Overlapping intervals problem. Just count the number of free days given total days and schedules, merging overlapping schedules and calculating gaps. 3. 𝗟𝗲𝘅𝗶𝗰𝗼𝗴𝗿𝗮𝗽𝗵𝗶𝗰𝗮𝗹𝗹𝘆 𝗠𝗶𝗻𝗶𝗺𝘂𝗺 𝗦𝘁𝗿𝗶𝗻𝗴 𝗔𝗳𝘁𝗲𝗿 𝗥𝗲𝗺𝗼𝘃𝗶𝗻𝗴 𝗦𝘁𝗮𝗿𝘀 - Just need to iterate through the string, maintaining a stack to track characters and a multiset to keep track of the characters encountered. When encountering a '*', find the smallest character preceding it and remove it. Finally, reconstruct the resulting string while reversing it to maintain the original order. 4. 𝗙𝗶𝗻𝗱 𝗦𝘂𝗯𝗮𝗿𝗿𝗮𝘆 𝗪𝗶𝘁𝗵 𝗕𝗶𝘁𝘄𝗶𝘀𝗲 𝗔𝗡𝗗 𝗖𝗹𝗼𝘀𝗲𝘀𝘁 𝘁𝗼 𝗞 - Faced TLE on hidden testcases :( #leetcode #weeklycontest #problemsolving #dsa

11

2 Comments

𝙎𝙪𝙢𝙢𝙚𝙧 𝙂𝙧𝙞𝙣𝙙 - Day 20 / 40 Global Round 26 on codeforces.com Managed to solve the A problem. Tried solving C1, But got WA on 3rd test case 😅. Need to upsolve the problems now. #codeforces #coding #dsa #codechef #programming #tech #leetcode #contest

10

🎉 Celebrating 3 Months of Consistency on LeetCode! 🎉 I'm thrilled to share that I have successfully completed a three-month streak of solving Data Structures and Algorithms (DSA) problems on LeetCode daily! 💪 December marked the start of this journey, and while it was challenging at times, the consistent effort has paid off. Each day, I dedicated time to enhance my problem-solving skills and deepen my understanding of various DSA concepts. Highlights of this journey include: 🌟 Strengthening my coding proficiency. 🌟 Developing a disciplined routine. 🌟 Tackling a wide array of problems, from easy to complex. 🌟 Gaining confidence to approach technical challenges. Consistency is key, and this experience has reinforced my belief in continuous learning and perseverance. Whether you're preparing for coding interviews or simply looking to sharpen your skills, I highly recommend incorporating daily problem-solving into your routine. Onward and upward! 🚀 #LeetCode #DSA #Coding #Programming #Consistency #ProblemSolving #ContinuousLearning #TechJourney

28

2 Comments

Day 31 of #60dayscodechallenge 👉 Size of Largest BST in BT- To solve this problem, we have to define a Class that contain several pieces of information and collect information about the largest BST subtrees at each node. This approach involves the following steps: ->Define a class to encapsulate the information for each node. ->Use a helper function to recursively collect information from the left and right subtrees. ->The size of the largest BST subtree rooted at that node. ->The minimum and maximum values in the subtree rooted at that node. ->Combine the information to determine if the current subtree is a valid BST and compute the size of the largest BST subtree. #60DaysCodeChallenge #Java #DSA #BST

15

🖥️ DSA Day-7 Problem: Maximum Words in a Sentence Problem statement: A sentence is a list of words that are separated by a single space with no leading or trailing spaces. You are given an array of strings sentences, where each sentences[i] represents a single sentence. Return the maximum number of words that appear in a single sentence.   Example 1: Input: sentences = ["alice and bob love leetcode", "i think so too", "this is great thanks very much"] Output: 6 Explanation: - The first sentence, "alice and bob love leetcode", has 5 words in total. - The second sentence, "i think so too", has 4 words in total. - The third sentence, "this is great thanks very much", has 6 words in total. Thus, the maximum number of words in a single sentence comes from the third sentence, which has 6 words. Let’s connect and keep learning together! 🚀 #DSA #CodingChallenge #Day7 #Python #DataStructures #Algorithm

16

🚀 Day 37/45 of the 45-Day DSA Challenge by Arsh Goyal! 🚀 Today's problem-solving journey included: 1. Delete Nodes From Linked List Present in Array -> 2 pointers. 2. Remove Nodes From Linked List -> (method 1 → suffix array, 2 pointers), (method 2 → recursion). 3. Double a Number Represented as a Linked List -> maths (method 1 → recursion, carry variable), (method 2, iterate from left to right, and carry for current will be one if curr→next && curr→next→val ≥ 5). 4. Insert Greatest Common Divisors in Linked List -> 2 pointers. 5. Merge Nodes in Between Zeros -> 2 pointers. 6. Delete the Middle Node of a Linked List -> slow and fast pointers. 7. Maximum Twin Sum of a Linked List -> 2 pointers. 8. Binary Tree Postorder Traversal -> basics. 9. Binary Tree Preorder Traversal -> basics. 10. Kth Smallest Element in a BST -> pass k by reference, do inorder traversal, while processing root do k— and if k==0 root’s value is the answer, recursion. 11. Construct Binary Tree from Preorder and Inorder Traversal -> divide and conquer. 12. Construct Binary Tree from Inorder and Postorder Traversal -> divide and conquer. For detailed solutions, visit my Notion Page : (https://lnkd.in/gs5R9VQM). #CrackYourInternship #CrackYourPlacement #DSA #CodingChallenge #ReviseWithArsh #Day37

3

🌟 Day 24 at The Creator Program: Mastering Integration and Flutter Development! 🌟 Today was a powerhouse of learning at The Creator Program by the incredible Mr. Vimal Daga Sir. Here’s a snapshot of our exciting journey: 🌐 Integration of MongoDB, Cloud, and Docker: - Seamless Integration: Learning how to integrate MongoDB with cloud services and Docker to build robust and scalable applications. - DevOps Features: Exploring the powerful features of DevOps that streamline development and deployment processes. 🤖 Machine Learning Categorical Features: - Deep Dive: Understanding categorical features in machine learning and their impact on model performance. 📱 Flutter Development: - Module Installation: Getting hands-on with Flutter by installing essential modules for widgets and all the foundational setup. - Flutter Fundamentals: - materialApp() function: Creating the base structure for our apps. - Widgets: Exploring core widgets including scaffold, appbar, text, and custom widgets. - Stateless Widget: Understanding the concept and application of stateless widgets. - Hot Reload: Leveraging hot reload for quick development cycles. - Import: Managing imports efficiently to build feature-rich applications. 🎨 Figma Design: - Enhanced Understanding: Gaining a better grasp of Figma through practical self-experiments. - Application Design: Applying our skills to design applications from scratch, refining our UI/UX abilities. 🚀 Today was all about integrating cutting-edge technologies and enhancing our development skills. The hands-on practice and real-world applications are what make The Creator Program so impactful!

13

I got a rank 266 on code 360 weekly contest. If there was no silly mistake in last minute I would get full points of 3 rd question that can got me under 200 rank. next time I will work on my silly mistakes. my intuitions for first 3 questions. 1) Jump string : It is a simple question of conditions on characters of string. if '*' then skip 1 char if '#' skip two chars. otherwise push into res string. 2) max score : in this question I have given two arrays absolute difference I have to maximize of one no from bothe arrays. My intuition was There can be two possibility one no can be smallest from first array and another can be largest from second array and vice versa because absolute difference is given. I take max of both. 3) container queries: It was a bit hectic because of upto 1e5 queries and string length can be 1e5. In this I have to check for each query range if there exist all distinct characters in string. store 1 if exist else 0 in vector. I cannot use brute approach it gave me tle as I know it won't work. Then optimal approach: max chars can be 26 For each index I store prefix count of each character. First I copy previous i -1 table to current and then increment count. I check rth table and l-1 table which character cnt increment I added to set check. Then I iterate from first set containing all distinct character in string. It was very interesting question taking more time to implementy logic. #DSA #CompetitiveProgramming #Problem_solving #ICPC

46

🌟 𝑯𝒆𝒚 𝑪𝒐𝒏𝒏𝒆𝒄𝒕𝒊𝒐𝒏𝒔 🌟 𝐃𝐚𝐲 𝟙𝟟 of my coding journey at LeetCode platform 🙌🏻✨ 🔹Problem - Count pairs whose sum is less than target 🔹ID - 2824 🔗Link - https://lnkd.in/gJy8zikg 💡 Solution - https://lnkd.in/gQyy_hRU 🔹 Description : Given a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < target 👨‍💻 🔹Solved the problem by using two pointer approach and iterating through it and incrementing the count of the sum of two pointers that are less than target💡✨ 🔹I aim to be consistent with my progress. Have a good day 🌠✨ #LeetCode #DailyCoding #CodingChallenge #CodingJourney #ProblemSolving #TechCommunity #PersonalGrowth #CareerDevelopment

18

Day #6 🚀 Problem-Solving Journey Continues on LeetCode! Today, I solved an interesting problem: 242. Valid Anagram on LeetCode. This one’s all about determining if two strings are anagrams by comparing character counts and ensuring both strings have identical compositions. 🔄 🔍 Solution Highlights: 1. Checked if both strings have the same length – a basic but essential step. 2. Used an integer array to count the occurrences of each character in the first string. 3. Decremented the character count based on the second string, ensuring a balanced count for each letter. 4. Returned false if any count was negative, indicating a mismatch in characters. Result: Solution accepted with optimal runtime – efficient and concise! ⚡ #ProblemSolving #LeetCode #CodingJourney #Java #Anagram #CodingSkills #TechEnthusiast #LearningEveryday

16

💻……. 6 months back I first opened Leetcode being so confident that I know C++ very well and I can handle this easily.... The first line of the first problem had ‘vector<int>‘.... And I didn’t know anything about what vector was or what STL was. I hesitantly started but couldn’t submit even 1 right answer on that day…. I was highly disappointed and was humbled that there is still a lot out there to learn…. It took quite a long time for me to get back to Leetcode.... but then I was determined to get myself through this.... With constant questioning of my self-worth and a loss of confidence in my work, it was a rollercoaster…. one day I would clear all the problems I opened…. the next day I would stumble again…… But above all these, the most important lesson that I learned through the stumbling and numerous incorrect submissions is that…… Everything has a breakpoint, every new skill that we try to learn or every new thing we try to master scares us only till a certain point…. When we reach that certain point where we have failed countless times but still managed to pass through, we will have no more fear. Even though I am not the best Leetcoder out there…. It’s safe to say that I have passed the breakpoint, I am not nervous anymore about the wrong answers, as long as I try, I know I will get them right eventually. I wanted my first LinkedIn post to be a special one…. Completing 100 days in Leetcode, for a person who couldn’t submit one right answer on the first day, this is quite special. Hoping to learn and grow more with all the other coders and developers out there…. Happy Coding.... ……. 💻  

56

2 Comments

🚀 Day 37/90 of Placement Prep Journey 🚀 Continuing my dive into Binary Search Trees (BST) with some exciting challenges today! 🌳 🔍 DSA: Construct a BST from a Preorder Traversal - Building the tree from scratch using preorder data. Merge 2 BSTs - Combining two BSTs into a single, balanced one. Two Sum in BST - Checking if there exists a pair with a sum K. Recover BST - Correcting a BST with two nodes swapped. Spending 80% of my day deep in DSA, feeling good, enthusiastic, and confident! Loving the process and the learning curve. 💪 #100DaysOfCode #DSA #PlacementPreparation #BinarySearchTree #CodingJourney #TechLife

10

2 Comments

Hello people, Iam back with my updates on #100daysoftech in #Roblox I’ve been experimenting with game development lately and as apart of my roblox game development i have created a simple yet fun game of falling dice. This game is developed by basic scripting concepts which involve: ➡️Anchor property : In Roblox, the Anchor property of a part determines whether it is fixed in place or can move. When you set a part's Anchored property to true, the part will not be affected by physics such as gravity or collisions, meaning it will stay in its position regardless of any interactions. --> Here we want the dice to fall hence we set it to false. ➡️Gravity : In Roblox, gravity is a property of the game’s physics engine that affects how objects fall. Gravity pulls objects downwards, simulating real-world gravitational force. Roblox's default gravity is set to 196.2 studs/second², which is equivalent to Earth's gravity in real-life units. -->we have set the gravity to 500 to effectively show the fall of the dice. ➡️ Wait function 🕐: so in this game we see two dice , one is expected to fall after another so we use wait() function so that the first dice falls first and the second dice waits for a second for it to fall. ➡️ Images 🖼️: The images on the dice are from the roblox tool box which are set precisely on each face of dice. I know this is a basic game and its sometimes fun to dive into basic concepts also its a great game to begin with . Also 🎥 Special Thanks to AlvinBlox , whose tutorials on Roblox development really helped me understand the basics and this game is totally from his tutorials. -->There isn't much scripting involved in this except for a three lines of code which i have shared below. ▶game.WorkSpace.dice1.Anchored= false wait(1) game.WorkSpace.dice2.Anchored= false You can check this out on Roblox: https://lnkd.in/gQJhbGRE Let’s connect and share our journey into the world of game development! 🎮 If you have any tips or projects you'd like to share, feel free to comment below! Happy scripting! 💻 #RobloxStudio #GameDevelopment #LuaProgramming #Coding #GameDesign #Scripting #Roblox #TechCommunity #TechChallenge #LearnTech #TechJourney #CodeEveryday #TechLearning #ProgrammingChallenge #TechSkills #DailyTechChallenge #TechProgress. #CodeChallenge #100DaysOfCode #TechMilestone #DailyCoding #TechExplorer #CodeLearning #TechCommunity #CodingJourney #TechEnthusiast #LearnToCode #edam #Roblox #Gaming #Community #Edam Yasasvi Mandapati,Abhishek Nagaraja

15