AddinyHost’s Post

Debug prints, the ultimate debugger tool. 😤 Currently in the process of implementing the evolution algorithm for my financial portfolio evolution project. Had a few problems with the convergence of my Series GAN implementation that I'll need to debug later, but for the most part everything is trained (not that the generator is usable 😮💨.) Will need to fiddle with the hyperparameters in due time, but right now the goal is to get this done, train portfolios and have the proof of concept done (move fast, break things, repeat.). I had an interesting idea for how to get past the generator issue which I am implementing right now. 🪽 Code available on GitHub: https://lnkd.in/eYVMWcpN Fully in Rust for performance reasons, will try to write Python endpoints for it down the line. #grindset #code #update #rustdev #pythondev

Day 53/100 of the #100DaysofCode Challenge!!🚀 Platform: GFG Problem: Modular Exponentiation for large numbers #100daysofcodingchallenge #drgvishwanathanchallenge #onedayatatimepal #pythonprogramming #geeksforgeeks #100daysofcode

🚀 Day 16 of #30DaysOfCode: Solved 'Find the Index of the First Occurrence in a String' on LeetCode using C! Worked through string searching algorithms to locate the first occurrence of a substring. Ready for the next challenge! #CodingChallenge #CProgramming #LeetCode #StringAlgorithms #ProblemSolving #30DaysOfCode

Hello guys!! 👉Day-36 of #100daysofcodechallenge 👉write a program to calculate the sum of series up to n terms for example , if n=5 the series will become 2+22+222+2222+22222=24690 #codingjourney #codingchallenge #pythonprogramming

🌟 #Day31 of #100DaysOfCode 🌟 📌 LeetCode Question No. 796 - Rotate String Today’s challenge was an interesting one involving string manipulation: Rotate String. The task is to determine if one string is a rotation of another, meaning if we can "rotate" the original string to eventually match the target string. Approach: 1️⃣ Concatenate and Search: By doubling the original string (i.e., s + s), any rotation of s will naturally appear as a substring. 2️⃣ Verify Presence: We then check if the target string exists within this concatenated version. Key Insights: This problem emphasizes the power of string manipulation techniques and how a simple trick like concatenation can simplify a complex problem. Instead of multiple rotations, this approach allows us to search for a match efficiently! Completing this challenge also reinforced the importance of edge case analysis, particularly with differing string lengths. Takeaways: Every problem-solving step can enhance our understanding of efficient algorithms and prepare us for more advanced challenges. The journey continues! 💪 💡 #drGViswanathanchallenge #100DaysOfCode #LeetCode #Day31 #CodingChallenge #StringManipulation #Programming #ProblemSolving #TechJourney #DataStructures #Algorithms #VITBhopal #Cpp #SoftwareEngineering #CodeEveryDay #LinkedInTech

100DaysOfCode Challenge DAY 🗓: 16/100 TOPIC : Binary Search 🎯 LEETCODE 2187 : Minimum Time to Complete Trips- https://lnkd.in/dBat3fk3 Problem Statement📝: You are given an array time where time[i] denotes the time taken by the ith bus to complete one trip. Each bus can make multiple trips successively; that is, the next trip can start immediately after completing the current trip. Also, each bus operates independently; that is, the trips of one bus do not influence the trips of any other bus. You are also given an integer totalTrips, which denotes the number of trips all buses should make in total. Return the minimum time required for all buses to complete at least totalTrips trips. Approach 💡 : 1) Finding Maximum Element in the array 2) Binary Search Algorithm ( Search Space -> lo = 1 , hi = max*totalTrips ) 3) Function for Checking time and trips TIME COMPLEXITY⏱️ : O(nlogn) SOURCE CODE🖥 : https://lnkd.in/dUdPBrym #100DaysOfCodechallenge #dsa #dailycoding #leetcodechallenge #problems #codenewbie #codepassion #programming #solved

🚀 𝗗𝗮𝘆 𝟳: Just solved LeetCode Problem 28: a string challenge to find the 𝗜𝗻𝗱𝗲𝘅 𝗼𝗳 𝗮 𝗦𝘂𝗯𝘀𝘁𝗿𝗶𝗻𝗴’𝘀 𝗙𝗶𝗿𝘀𝘁 𝗢𝗰𝗰𝘂𝗿𝗿𝗲𝗻𝗰𝗲 in a larger string! 𝗣𝗿𝗼𝗯𝗹𝗲𝗺: Given two strings 𝗻𝗲𝗲𝗱𝗹𝗲 and 𝗵𝗮𝘆𝘀𝘁𝗮𝗰𝗸, return the index of the first occurrence of needle in haystack, or -𝟭 if needle is not part of haystack. The task was to locate where one string (the needle) first appears in another string (the haystack). I used a straightforward iteration with the 𝘀𝘂𝗯𝗦𝘁𝗿() method to extract slices of the haystack string matching the length of the needle. Each slice was compared to the needle to check for a match, allowing me to efficiently locate the index of the first occurrence. If no match was found, the function returned -𝟭 as specified by the problem. 📍 Excited to continue tackling more problems and sharpening my skills one challenge at a time. Onward to the next! #LeetCode #CodingJourney #DataStructures #Algorithms #Cpp #DSA #FindingIndex #FirstOccurance #Programming #DailyLearning #Developer #ProblemSolving

114. Flatten Binary Tree to Linked List Question: https://lnkd.in/dB5wGF3i Solution: https://lnkd.in/dYnr_9Jk 𝚃𝚑𝚎 𝚋𝚒𝚗𝚊𝚛𝚢 𝚝𝚛𝚎𝚎 𝚏𝚕𝚊𝚝𝚝𝚎𝚗𝚒𝚗𝚐 𝚜𝚘𝚕𝚞𝚝𝚒𝚘𝚗 𝚛𝚎𝚌𝚞𝚛𝚜𝚒𝚟𝚎𝚕𝚢 𝚝𝚛𝚊𝚗𝚜𝚏𝚘𝚛𝚖𝚜 𝚊 𝚋𝚒𝚗𝚊𝚛𝚢 𝚝𝚛𝚎𝚎 𝚒𝚗𝚝𝚘 𝚊 𝚙𝚛𝚎-𝚘𝚛𝚍𝚎𝚛 "𝚕𝚒𝚗𝚔𝚎𝚍 𝚕𝚒𝚜𝚝" 𝚋𝚢 𝚜𝚢𝚜𝚝𝚎𝚖𝚊𝚝𝚒𝚌𝚊𝚕𝚕𝚢 𝚌𝚘𝚗𝚟𝚎𝚛𝚝𝚒𝚗𝚐 𝚎𝚊𝚌𝚑 𝚗𝚘𝚍𝚎'𝚜 𝚕𝚎𝚏𝚝 𝚊𝚗𝚍 𝚛𝚒𝚐𝚑𝚝 𝚜𝚞𝚋𝚝𝚛𝚎𝚎𝚜. 𝙸𝚝 𝚊𝚌𝚌𝚘𝚖𝚙𝚕𝚒𝚜𝚑𝚎𝚜 𝚝𝚑𝚒𝚜 𝚋𝚢 𝚗𝚞𝚕𝚕𝚒𝚏𝚢𝚒𝚗𝚐 𝚕𝚎𝚏𝚝 𝚌𝚑𝚒𝚕𝚍 𝚙𝚘𝚒𝚗𝚝𝚎𝚛𝚜, 𝚛𝚎𝚍𝚒𝚛𝚎𝚌𝚝𝚒𝚗𝚐 𝚛𝚒𝚐𝚑𝚝 𝚌𝚑𝚒𝚕𝚍 𝚙𝚘𝚒𝚗𝚝𝚎𝚛𝚜 𝚝𝚘 𝚌𝚛𝚎𝚊𝚝𝚎 𝚊 𝚕𝚒𝚗𝚎𝚊𝚛 𝚕𝚒𝚗𝚔𝚎𝚍-𝚕𝚒𝚜𝚝 𝚜𝚝𝚛𝚞𝚌𝚝𝚞𝚛𝚎 𝚝𝚑𝚊𝚝 𝚏𝚘𝚕𝚕𝚘𝚠𝚜 𝚝𝚑𝚎 𝚙𝚛𝚎-𝚘𝚛𝚍𝚎𝚛 𝚝𝚛𝚊𝚟𝚎𝚛𝚜𝚊𝚕 𝚜𝚎𝚚𝚞𝚎𝚗𝚌𝚎. #KodaVidya #CodingMadeEasy #LearnToCode #ProgrammingBasics #JavaScriptTutorial #CodingTips #CodeWithFun #JavaProgramming #TechEducation #CodeForBeginners #CodingLife #LearnProgramming #CodingJourney #WebDevelopment #ProgrammingTutorials #CodeLearning #TechForEveryone #CodingCommunity #LearnToCodeOnline #TypeCasting

🚀 𝗗𝗮𝘆 𝟯: Just solved LeetCode Problem 9: an intriguing challenge, 𝗣𝗮𝗹𝗶𝗻𝗱𝗿𝗼𝗺𝗲 𝗡𝘂𝗺𝗯𝗲𝗿! 𝗣𝗿𝗼𝗯𝗹𝗲𝗺: Given an integer 𝘅, return 𝘁𝗿𝘂𝗲 if x is a palindrome, and 𝗳𝗮𝗹𝘀𝗲 otherwise. An integer is a palindrome when it reads the same forwards and backwards. For example, 𝟭𝟮𝟭 is a palindrome, while 𝟭𝟮𝟯 is not. The challenge was to determine whether a given integer reads the same forwards and backwards, without converting it to a string. I extracted digits one by one from the end of the number using the modulus operator (%10). With a while loop, I built a reversed half of the number to check against the original half. This method allowed me to determine if the integer is a palindrome without needing to handle it as a string or additional data structure. 📍 Every problem like this is a chance to sharpen my algorithm skills. Excited for the next one! #LeetCode #CodingJourney #DataStructures #Algorithms #Cpp #DSA #PalindromeNumber #Programming #DailyLearning #Developer #ProblemSolving

🚀 Solved LeetCode Problem 1545: Find Kth Bit in Nth Binary String! 🔍 💡 Approach: This problem involved constructing a sequence of binary strings with specific recursive properties. Instead of constructing the entire string (which grows exponentially), I tackled it using: Recursive Analysis: Identified the middle bit and used the symmetry of the string (reversal and inversion). Efficiency: Reduced the problem size by calculating whether the target bit lies in the first or second half of the string. Inversion Logic: Used inversion for the second half of the string to avoid building it explicitly. This was a fun challenge, optimizing both time and space while focusing on recursion and bit manipulation! 👨💻 C Implementation: Efficient recursive function to directly compute the k-th bit without generating large strings. Leetcode: https://lnkd.in/gJgptwW8 Git: https://lnkd.in/gzMfV5PB #LeetCode #CProgramming #RecursiveSolution #AlgorithmicThinking #DataStructuresAndAlgorithms #CodingChallenge #DailyCoding #ProblemSolving #TechJourney #BinarySearch #InterviewPrep #Programming #TechCommunity #CodeMaster #CodingLife #TechSkills #SoftwareDevelopment #LinkedInCodingCommunity