Turn User Frustrations into Open Source Contributions

Day 4 of my 100 Days of Code challenge! 💻 Today I built a Rock Paper Scissors game in Python where the user plays against the computer. The program allows the user to choose between rock, paper, or scissors, while the computer randomly generates its choice. It then compares both and determines the winner. This project helped me practice working with lists, the random module, and building game logic using conditional statements. I’m starting to see how combining small concepts can turn into actual interactive programs, which has been really motivating. Learning in public and documenting my journey into software engineering. Check out the project here: https://lnkd.in/eNQhQkz3 #100DaysOfCode #Python #SoftwareEngineering #LearningInPublic #CodingJourney

Day 36- Strings in Focus Today I explored Python's string methods, sharpening my ability to handle text with precision and clarity. Case Conversion - lower(), upper(), capitalize(), title(), swapcase() taught me how presentation shapes readability. Trimming & Replacing - strip(), Istrip(), rstrip(), replace() showed the importance of clean inputs and adaptability. ⚫ Searching & Finding - find(), rfind(), index(), count(), startswith(), endswith() strengthened my pattern detection and validation skills. Reflection - Strings may look simple, but they're everywhere: from user inputs to APIs. Mastering these methods builds the foundation for scalable, real-world solutions. Thanks to Rudra Sravan Kumar sir, Mounika M mam, and the 10000 Coders team for guiding us to think like developers - focusing on clarity, efficiency, and adaptability. Day 36 was about turning text into logic, and logic into confidence. #Day36 #Python #StringMethods #CodingJourney #10000Coders #GrowthMindset

If your code is starting to look like spaghetti, it’s time to master Modules and Packages. This infographic is a perfect "cheat sheet" for: ✅ Modules vs. Packages – How to structure your files. ✅ Imports – The right way to bring in code. ✅ Virtual Environments – Keeping your projects clean and isolated. Pro-tip: Never skip the virtual environment. Your future self will thank you when you avoid version conflicts! 💡 What’s one Python tip you wish you knew when you started? 👇 #Python #Coding #SoftwareEngineering #TechTips

🚀 LinkedIn DSA Journey – Day 48 Problem: 217. Contains Duplicate Approach: The idea is to first sort the array. After sorting, duplicate elements will appear next to each other. Then iterate through the array and compare the current element with the previous one. If both are equal, it means a duplicate exists, so return True. If the loop finishes without finding duplicates, return False. Key Idea: Sorting helps bring equal elements together, making it easy to detect duplicates with a single pass. Time Complexity: Sorting: O(n log n) Traversal: O(n) Overall: O(n log n) Space Complexity: O(1) (no extra data structures used) #Day48 #DSA #LeetCode #ProblemSolving #Python #CodingJourney

Day 10/100 – DSA Challenge Today’s problem: Move Zeroes (LeetCode 283) What I Learned: The goal was to move all zeroes to the end of an array while maintaining the relative order of non-zero elements — and importantly, doing it in-place. Key Idea: Two-Pointer Technique I used a two-pointer approach: One pointer (fast) iterates through the array Another pointer (slow) tracks where the next non-zero element should go Whenever a non-zero element is found, it is swapped with the element at the slow pointer, ensuring all non-zero elements are shifted forward while zeroes naturally move to the end. Why this approach? Maintains order of elements Works in O(n) time complexity Uses O(1) extra space (in-place) Takeaway: This problem reinforced how powerful the two-pointer technique is for array manipulation problems, especially when constraints require in-place operations. Looking forward to tackling more problems and improving consistency! #Day10 #100DaysOfCode #DSA #Python #CodingJourney #LeetCode #ProblemSolving

🚀 Day 35/60 — LeetCode Discipline Problem Solved: Remove Nth Node From End of List Difficulty: Medium Today’s challenge was about linked lists and efficient traversal. Instead of calculating the length first, I used the two-pointer approach to remove the target node in a single pass. 💡 Focus Areas: • Two-pointer technique (fast & slow pointers) • Linked list traversal optimization • Handling edge cases (removing head node) • Use of dummy node for cleaner logic • Writing efficient O(n) solutions ⚡ Performance Highlight: Achieved 0 ms runtime (100% performance) Two pointers… one moving ahead, one following behind— like time and memory walking together. And at the right moment… one node quietly disappears, as if it was never meant to stay. #LeetCode #60DaysOfCode #100DaysOfCode #DSA #LinkedList #TwoPointers #CodingJourney #ProblemSolving #Python #Developers #TechGrowth #Consistency

Today I used Cortex Code to run evaluations on my Cortex Agent and the workflow is surprisingly smooth. Cortex Code can create eval datasets, configure metrics, kick off evaluation runs, and analyze results -- all from the CLI. No context-switching between Snowsight tabs. You describe what you want to test, it writes the SQL  and Python, and you iterate from there. I was able to compare accuracy and groundedness across different prompt configs in about 15 minutes. The traces show exactly where the agent went off track, which makes debugging way faster than staring at raw logs. If you're building Cortex Agents, pair them with Cortex Code for evals. Works just as well for production monitoring as it does for continual testing as you tweak prompts and configs. What's your workflow for evaluating agents as they evolve?  #Snowflake #CortexCode #CortexAI #AIAgents #AIObservability

🚀 Day 55 – Strings in Focus 💻✨ Today I explored Python’s string methods, sharpening my ability to handle text with precision and clarity. 🔹 Case Conversion – lower(), upper(), capitalize(), title(), swapcase() taught me how presentation shapes readability. 🔹 Trimming & Replacing – strip(), lstrip(), rstrip(), replace() showed the importance of clean inputs and adaptability. 🔹 Searching & Finding – find(), rfind(), index(), count(), startswith(), endswith() strengthened my pattern detection and validation skills. 🌱 Reflection – Strings may look simple, but they’re everywhere: from user inputs to APIs. Mastering these methods builds the foundation for scalable, real-world solutions. ✨ Thanks to Rudra Sravan Kumar sir, Mounika M mam, and the 10000 Coders team for guiding us to think like developers — focusing on clarity, efficiency, and adaptability. ⚡Day 55 was about turning text into logic, and logic into confidence. #Day55 #Python #StringMethods #CodingJourney #10000Coders #GrowthMindset

🚀 Day 14 of Consistency | #75DaysLeetCodeChallenge 🧠 Today’s Problem : Best Time to Buy and Sell Stock (#121) 💡 Key Learning: This problem builds intuition for tracking minimum values and maximizing profit using a single pass. ⚡ Approach: Use two pointers → buy (l) & sell (r) If price[r] > price[l] → calculate profit Update max profit If price[r] < price[l] → move l to r (better buying point) 🧠 Why this works: Single traversal → O(n) Keeps track of minimum buying price No extra space required → O(1) 🔥 Result : ✔️ Runtime: 57 ms (Beats 38.25%) 📈 Simple logic, but powerful pattern for many stock & profit-based problems. Consistency is compounding. Keep going. 💪 #Day14 #LeetCode #DSA #CodingJourney #100DaysOfCode #Python #Greedy #Consistency

Day 3 / 100 🚀 Solved “Reverse Integer” — a problem that looks simple but actually tests how carefully you handle edge cases. At first, reversing digits feels straightforward. But the real challenge is handling 32-bit overflow without using extra space. 💡 Key learning: Before updating the result, always check if multiplying by 10 will exceed the allowed range. Core idea: rev * 10 + digit must stay within [-2³¹, 2³¹ - 1] Highlights: • Time Complexity: O(log n) • Space Complexity: O(1) • Correctly handles negative numbers and overflow This problem reinforced a critical habit: Don’t just make the logic work — validate boundary conditions. #100DaysOfCode #LeetCode #DSA #Python #ProblemSolving #CodingInterview