Virtual Environment for Python Machine Learning

Day 37 / #120DaysOfCode – LeetCode Challenge ✅ Problem Solved: • Search a 2D Matrix 💻 Language: Python 📚 Key Learnings: • Applied Binary Search on a 2D matrix • Learned how to treat matrix as a flattened sorted array • Practiced converting 1D index → 2D index (row, col) • Improved understanding of search space reduction • Strengthened logarithmic time complexity (O(log n)) thinking Better logic → Faster execution 🚀 🔗 LeetCode Profile: https://lnkd.in/gbeMKcv5 #LeetCode #Python #DSA #BinarySearch #Algorithms #CodingJourney #Consistency #120DaysOfCode

Group Anagrams: Frequency Signature Beats Sorting for Keying Sorting each string as key costs O(k log k) per string. Character frequency array is O(k) and creates same signature for anagrams. Fixed 26-element array converted to tuple serves as hashable HashMap key — cleaner, faster grouping. Frequency as Key: Character counts uniquely identify anagram groups. Tuple conversion enables using array as dict key (lists aren't hashable). This pattern applies to document clustering, duplicate detection. Time: O(n × k) vs O(n × k log k) with sorting | Space: O(n × k) #FrequencySignature #HashMap #Anagrams #KeyOptimization #Python #AlgorithmDesign #SoftwareEngineering

Day 32 / #120DaysOfCode – LeetCode Challenge Today’s focus: Arrays & Majority Voting Algorithm ✅ Problem Solved: • Majority Element II 💻 Language: Python 📚 Key Learnings: • Applied Boyer-Moore Voting Algorithm (extended version) • Learned how to track two candidates for n/3 majority • Understood the importance of validation step after candidate selection • Improved ability to handle edge cases in frequency problems Consistency builds confidence 🚀 Every day = 1% better 💪 🔗 LeetCode Profile: https://lnkd.in/gbeMKcv5 #LeetCode #Python #DSA #Arrays #Algorithms #Consistency #CodingJourney #120DaysOfCode

Day 3 of strengthening core Python and AI/ML foundations for production-level systems Explored control flow mechanisms for decision-making and iteration. Focus areas: ▪️ Conditional logic (if, elif, nested conditions) ▪️ Loop constructs (for, while, nested loops) ▪️ Flow control (break, continue, pass) Key takeaway: Efficient control flow design directly impacts performance and readability in real-world data processing workflows. #MachineLearning #ArtificialIntelligence #Python #SoftwareEngineering #AIMLWithPhitron

✅ Day 26 of #DSAPrep > Problem: Merge Sorted Array > Platform: LeetCode > Concept: Two Pointers / Merge Technique Solved this problem by merging two sorted arrays using two pointers and storing the result in sorted order. > Key Idea: Use one pointer for each array Compare current elements Insert smaller value into result Add remaining elements at the end > Time Complexity: O(m + n) > Space Complexity: O(m + n) #DSAPrep #Algorithms #Python #TwoPointers #Arrays #ProblemSolving #CodingJourney

Search Insert Position: Left Pointer as Natural Insertion Index When binary search terminates without finding target, left pointer automatically points to correct insertion position. No special handling needed — the loop invariant guarantees left is where target belongs to maintain sorted order. Termination Property: When l >= r, left has crossed to insertion position. This binary search property eliminates need for post-loop calculation. Time: O(log n) | Space: O(1) #BinarySearch #InsertPosition #LoopInvariant #SortedArrays #Python #AlgorithmDesign #SoftwareEngineering

Last Stone Weight: Max-Heap via Negation for Collision Simulation Python's heapq is min-heap only. Simulate max-heap by negating values. Repeatedly extract two largest stones (most negative), compute difference, reinsert. Continue until one/zero stones remain. Max-Heap Workaround: Negating values transforms min-heap to max-heap. This pattern applies whenever max-heap needed in Python. Remember to negate back when extracting final values. Time: O(n log n) | Space: O(n) #Heap #MaxHeap #NegationTrick #PriorityQueue #Python #AlgorithmDesign #SoftwareEngineering

How can you evaluate an AI model's robustness before real-world failures occur? In this webinar, we’ll demonstrate how to use the open source Natural Robustness Toolkit (NRTK) to create reproducible workflows for testing model performance. You’ll learn how to: ✅ Install and configure NRTK in Python ✅ Apply perturbations to expand existing datasets ✅ Design parameter sweeps to measure performance degradation ✅ Evaluate models under simulated operational conditions 📅 April 15, 2026 | 12–1 PM 👉 Register here: https://ow.ly/Ncnr50YBmK7 #AIResearch #MachineLearning #ModelValidation #NRTK #Python

Day 43/100 – #100DaysOfCode 🚀 Solved LeetCode #2610 – Convert an Array Into a 2D Array With Conditions (Python). Today I practiced hashmap (frequency counting) to construct a 2D array based on given conditions. Approach: 1) Create a frequency map to count occurrences of each element. 2) Initialize an empty result list. 3) While the frequency map is not empty: 4)  Create a new row. 5)  Iterate through keys and add each number once to the row. 6)  Decrease its frequency and remove it if it becomes zero. 7) Add the row to the result. 8) Return the final 2D array. Time Complexity: O(n) Space Complexity: O(n) Learning how frequency maps help in structuring data efficiently 💪 #LeetCode #Python #DSA #HashMap #Arrays #ProblemSolving #100DaysOfCode

DAY 53 🚀 – Bit Manipulation + Subsets 🔥 Exploring power sets and pattern expansion 💯 Day 53 / #120DaysOfCode – LeetCode Challenge ✅ Problem Solved: • 78. Subsets 💻 Language: Python 📚 Key Learnings: • Built subsets using iterative expansion technique • Understood relation to power set (2ⁿ combinations) • Learned alternative approach via bit manipulation • Strengthened understanding of combinatorics in coding 💡 Key Insight: Each element doubles the number of subsets → include / exclude 🔥 Progress: Moving deeper into patterns used in recursion & bit manipulation 💪 🔗 LeetCode Profile: https://lnkd.in/gbeMKcv5 #LeetCode #Python #DSA #BitManipulation #Subsets #Backtracking #Consistency #120DaysOfCode