Suman Saha’s Post

🚀 Day-32 of #100DaysOfCode 🐍 Python Pattern Programming Challenge Today I worked on generating an Alphabet Triangle Pattern using ASCII values and nested loops. 🔹 Problem: Print a right-angled triangle where each row starts from A and prints characters sequentially. 🔹 Concepts Practiced: ✔ Nested for loops ✔ ASCII value manipulation using chr() ✔ Pattern visualization ✔ Loop resetting logic 🔹 Approach: Use ASCII value 65 to represent 'A' Convert ASCII to characters using chr() Reset the ASCII value at the start of each row Increase characters row-wise Pattern-based challenges help strengthen loop control, logical thinking, and character handling in Python 💡 #Python #PatternProgramming #CorePython #AlphabetPattern #100DaysOfCode #Day32 #LearnPython #CodingPractice #PythonDeveloper

LeetCode Problem 83: Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well. The below implementation in Python successfully resolves this in time complexity of O(n) where n is length of the list with constant space complexity. The approach is simple, handle the base case first like list having 0 or 1 number of nodes and then write the logic of handling lists of length greater than one. Maintain two pointers, one to keep track of present node and other to keep track of previous node. Check if the value of both nodes match or not, if match update the pointing of previous node, point its next to the present.next. #LeetCode #LinkedList #Python #CompetitiveProgramming #Algorithms #DataStructures #ProblemSolving

Solved LeetCode Problem #125 – Valid Palindrome using a clean and Pythonic approach focused on readability and efficiency. In this problem, the objective was to determine whether a string is a palindrome after removing non-alphanumeric characters and ignoring letter case. Instead of using complex logic, I implemented a compact and optimized solution using string preprocessing and Python’s built-in capabilities. Approach Highlights: • Used string filtering to extract only alphanumeric characters • Applied case normalization using .lower() • Leveraged Python list comprehension for concise preprocessing • Performed palindrome validation using string slicing (reverse comparison) This approach keeps the solution both readable and efficient, showing how strong fundamentals and knowledge of language features can simplify problem-solving. Time Complexity: O(n) Space Complexity: O(n) Consistent DSA practice is helping me improve not just problem-solving speed, but also code clarity and optimization mindset. #LeetCode #Python #ProblemSolving #DSA #CodingJourney #SoftwareDevelopment #TechSkills

𝗪𝗲𝗲𝗸 𝟯 of my 𝗗𝗮𝘁𝗮 𝗦𝗰𝗶𝗲𝗻𝗰𝗲 & 𝗠L program with ParoCyber wrapped up with two solid labs on Python operators and string methods. We covered a lot of ground on arithmetic, comparison, logical, assignment, bitwise, membership, and identity operators. Each one serves a specific purpose in how Python reads and evaluates data. 💡The operators '𝙞𝙨' vs '==' were a good reminder that two values can be equal without pointing to the same object in memory. The second lab focused on string methods like split(), join(), replace(), and more.  💡One thing that stuck: strings in Python are 𝗶𝗺𝗺𝘂𝘁𝗮𝗯𝗹𝗲. Any operation returns a new string, not a modified original. Small detail, but it matters. To see the full breakdown, it's all documented on my GitHub. Link below. 🔗 https://lnkd.in/dVnTd3jS #DataScience #Python #MachineLearning #ParoCyber #LearningInPublic #CareerGrowth #WomenInTech

🚀 Day-31 of #100DaysOfCode 🐍 Python Pattern Programming Challenge Today I worked on generating Floyd’s Triangle using nested loops and a continuously increasing number sequence. 🔹 What is Floyd’s Triangle? It is a right-angled triangular pattern of natural numbers, where numbers are printed sequentially across rows. 🔹 Concepts Practiced: ✔ Nested for loops ✔ Loop-controlled number incrementation ✔ Pattern-based logic ✔ Output formatting using end 🔹 Approach: Use an outer loop for rows Use an inner loop to print numbers in each row Maintain a separate variable to keep numbers continuous Pattern problems like this help strengthen loop control, logic building, and visualization skills 💡 #Python #FloydsTriangle #PatternProgramming #CorePython #100DaysOfCode #Day31 #LearnPython #CodingPractice #PythonDeveloper

Day 45 – Splitting and Joining a String: Today’s task focused on splitting a string using a user-defined delimiter and then joining the parts back into a clean, readable format. This exercise strengthened understanding of string methods, input handling, and text restructuring, which are essential skills for data preprocessing and text manipulation in real-world applications. GitHub Code: https://lnkd.in/gznh5VpR #Day45 #100DaysOfCode #Python #StringManipulation #LogicBuilding #TextProcessing #DailyCoding #Consistency

This is demo for my Algorithm class where we would take a couple of algorithms and visualize them in a python program to demonstrate how fast they each run both on runtime and with visual feedback. The main goal was to demonstrate big O notation through visuals and including the time each one took. We would randomize the numbers and pass them through the algorithms to see how they ran, how fast they ran and organized them. It was clear that with big data sets Quick and merge were the best at handling larger and more scattered sets. One of the key takeaways was seeing just how each was useful in its own way and how even one that is clearly much faster than the rest like merge or quick would maybe be overkill when it comes to smaller changes which bubble sort would be better at #CSUF #AlgorithmEngineering #Spring2026

𝗣𝘆𝘁𝗵𝗼𝗻 𝗗𝗮𝗶𝗹𝘆 𝗖𝗵𝗮𝗹𝗹𝗲𝗻𝗴𝗲 | 𝗛𝗮𝗰𝗸𝗲𝗿𝗥𝗮𝗻𝗸 – 𝗶𝘁𝗲𝗿𝘁𝗼𝗼𝗹𝘀.𝗽𝗿𝗼𝗱𝘂𝗰𝘁() | 𝗗𝗮𝘆 𝟮𝟱 Nested loops are optional if you know this. Day 25 of my Python Daily Challenge 🚀 𝗧𝗼𝗱𝗮𝘆’𝘀 𝘁𝗮𝘀𝗸: 👉 Generate all pairs from two lists 👉 Maintain correct order 👉 No missing combinations Most people instantly write nested loops. And yes — that works. But interviews reward awareness, not effort 👇 💡 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗽𝗮𝘁𝘁𝗲𝗿𝗻 𝗳𝗿𝗼𝗺 𝗗𝗮𝘆 𝟮𝟱: • Cartesian product is a concept, not just loops • itertools.product() expresses intent clearly • Cleaner code = stronger signal to interviewers Python isn’t about writing more code. It’s about knowing what already exists. Do you still default to nested loops for combinations? 👀 #Python #HackerRank #DailyCoding #ProblemSolving #InterviewPrep #LearnInPublic #Consistency

Solved an interesting array problem using prefix sums + hash maps 🚀 This solution efficiently finds the longest subarray based on a comparison condition (arr[i] > k) by converting the problem into a prefix sum balance and tracking first occurrences with a hashmap. ✅ O(n) time complexity ✅ Smart use of prefix sums ✅ Great example of turning a complex condition into a simple math problem Always fun when problem-solving meets optimization! 💻📊 #Python #DataStructures #Algorithms #CodingInterview #ProblemSolving #100DaysOfCode

Day 32 of #100DaysOfCode 🚀 Today’s LeetCode lesson wasn’t about algorithms — it was about reading errors carefully. 🔍 Problem: Minimum Removals to Balance Array 💡 Approach: Sorting + Sliding Window (Two Pointers) But I hit a Runtime Error even though my logic was correct. Takeaways: Always match the exact function name expected by the platform Don’t panic on runtime errors — read the driver message carefully Logic can be perfect, but naming matters 🧠 Final solution uses: Sorting Two pointers O(n log n) time complexity Consistency > Speed. Small details > Big mistakes. On to the next problem 💪 #100DaysOfCode #LeetCode #Python #DSA #ProblemSolving #CodingJourney #LearningByDoing