Solved LCS with Dynamic Programming in Python

Day 64: Distinct Subsequences (Dynamic Programming) I'm focused on challenging algorithms on Day 64 of 100DaysOfCode with "Distinct Subsequences." The goal is to count how many unique ways a shorter string (t) can be formed by deleting characters from a longer string (s). My solution uses Dynamic Programming (DP), which is essential for this combinatorial counting problem. The DP table tracks the number of ways to form prefixes of t using prefixes of s. The key recurrence relation is: we either dont use the current character of s or, if they match, we add the ways we could form the previous prefix of t. This methodical approach correctly counts every distinct subsequence, running in O(m * n) time. #Python #DSA #Algorithms #DynamicProgramming #DP #100DaysOfCode #ProblemSolving

Day 62 Of #100DaysOfCode Problem #3354: Make Array Elements Equal to Zero Successfully solved today’s problem with an optimized solution achieving 93.09% runtime efficiency and 95.74% memory optimization! 🚀 🧩 Problem Insight: Given an integer array, the task is to determine the number of valid selections of a starting index and direction that reduce all array elements to zero by following specific movement and decrement rules. ⚙️ Approach: Used prefix/suffix summation logic to track balance between left and right movements. Calculated total sum and suffix sums efficiently to identify valid starting points. Achieved O(n) time complexity using cumulative tracking. 🧠 Language: Python ✅ Result: Accepted | Beats 93.09% in Runtime, 95.74% in Memory #LeetCode #Python #ProblemSolving #CodingChallenge #Mythyly #DailyPractice #DSA #ProgrammingJourney #WomenInTech

🚀 #Day27 of #30DaysOfCode Topic: Nested Conditional Statements Platform: NxtWave CCBP 4.0 Today, I explored the concept of Nested Conditional Statements — a way to make decisions inside other decisions. It allows programs to handle multiple logical conditions efficiently and execute the right block of code based on complex scenarios. 💡 What I learned: How to use if statements within another if. How nesting improves decision-making in real-world programs. Writing cleaner and more structured conditional logic. #NxtWave #CCBP4.0 #21stCenturySkills #Python #LearningJourney #CodingChallenge #Day27

Day 7 of #100DaysOfLeetCode Problem: 5. Longest Palindromic Substring Category: Strings / Two Pointers / Dynamic Programming Today’s challenge was about finding the longest palindromic substring within a given string. This problem helped me improve my understanding of string traversal and palindrome validation using substring slicing. 🧠 Key Learnings: Iterated through all possible substrings to check for palindromes. Compared each substring with its reverse to find the longest one. Reinforced the concept of two-pointer expansion and string symmetry. Understood how optimizing brute-force logic can significantly reduce time complexity in future attempts. 🎯 Takeaway: Palindrome problems are all about symmetry — once you recognize that, expanding around centers or slicing becomes much more intuitive. #LeetCode #100DaysOfCode #ProblemSolving #CodingJourney #Strings #TwoPointers #Python #AIEngineer #Consistency

Another IDA Python script pretty handy while #reverse #engineering binaries, specially firmware. The script converts a block of bytes to code and outputs address where it failed to so; this is helpful to review areas that might be data and note code. Link to the script: https://lnkd.in/dcqR-ry5

In Python, a generator function is a special type of function that uses the yield keyword instead of return to produce a sequence of values. But how do we actually code it? 🤔🧐 Episode 17: #yield shift101 IT Workshop Keep Learning, Keep Coding! 👩💻👨💻 Full Video https://lnkd.in/gSnC5vgJ BOYA Noise-Cancelling Microphone https://lnkd.in/g8RjyWqK 4-in-1 Selfie Stick Tripod https://lnkd.in/gDMNFes3 A4Tech Full HD Webcam https://lnkd.in/gkuPz_kQ WD Elements External Hard Drive https://lnkd.in/gCsdus2c #IT #Programming #Python #Tutorial #Skills

Introducing our REV Estimator 🤝 If you didn’t know yet, IPSDK Explorer includes a free, Python-ready plugin for Representative Elementary Volume (REV) analysis ! ✨ No need to be an image analysis expert, REV Estimator helps you determine your dataset’s REV with just a few clicks 🧠 It’s fast, robust and fully customizable : ✅Define the optimal dataset size to save computing time and workstation requirements, without impacting the final result ✅Adjust parameters based on dataset size and variability ✅Access and modify the Python code to make it your own Simplify your workflow and gain accurate, noise-free REV measurements : for free 🤗 #IPSDKExplorer #OpenSource #Python #REV #ImageAnalysis #MaterialsScience #Innovation #DataAnalysis 

In Python, a generator function is a special type of function that uses the yield keyword instead of return to produce a sequence of values. But how do we actually code it? 🤔🧐 Episode 17: #yield shift101 IT Workshop Keep Learning, Keep Coding! 👩💻👨💻 Full Video https://lnkd.in/g4kRZfSK BOYA Noise-Cancelling Microphone https://lnkd.in/g-rWNn2Z 4-in-1 Selfie Stick Tripod https://lnkd.in/gG3C8jxS A4Tech Full HD Webcam https://lnkd.in/gTrXAARf WD Elements External Hard Drive https://lnkd.in/guxgD97C #IT #Programming #Python #Tutorial #Skills

Created a simple BFS and DFS creator with Python for CPSC 335 – Algorithm Engineering at California State University, Fullerton. It really helped me to visualize pathways. While it's not perfect the code visualizes how paths can be viewed and really helped to understand BFS vs DFS. DFS having more than one option makes sense and sometimes due to traversal BFS and DFS will change as the borders change. I've added a demo video, and hope it helps anyone looking to do the same. #Python #Algorithms #CSUF #GraphTraversal #BFS #DFS