NumPy operations and data analysis with Python

Group Anagrams: Frequency Array as Hashable Key Sorting each string costs O(k log k) per string. Character frequency array is O(k) and creates identical signature for anagrams. Fixed 26-element array converted to tuple serves as hashable HashMap key — faster, cleaner grouping. Frequency Signature: Character counts uniquely identify anagram groups without sorting. Tuple conversion makes array hashable for dict keys. Pattern applies to document clustering, duplicate detection. Time: O(n × k) vs O(n × k log k) sorting | Space: O(n × k) #FrequencyArray #Anagrams #HashMap #KeyOptimization #Python #AlgorithmOptimization #SoftwareEngineering

💧 Max Water Problem — Two Pointer Optimization Solved Container With Most Water using the Two Pointer technique in O(n) time. Key Idea: Move the pointer with the smaller height, since it limits the water capacity. 📈 Complexity: Time → O(n) Space → O(1) Small logic shift, big optimization. #DSA #Python #TwoPointers #CodingInterview #Algorithms

PyVista is now regularly crossing 1 million downloads per month on PyPI. It's the 3D visualization library for Python. Learn more at pyvista.org Mesh analysis, 3D plotting, and filters that fit in with NumPy, pandas, and xarray, so your research code stays in one idiom from load to figure. Thanks to every contributor, every paper that cited the project, and every engineer who gave "pip install pyvista" a shot! NumFOCUS affiliated, MIT licensed, and built in the open #PyVista #Python #SciPy #3DVisualization #OpenSource #NumFOCUS

Day 24/100 – DSA Journey Problem: Intersection of Two Arrays Initially thought of using loops, but that would increase time complexity. Then realized the problem requires only unique common elements, which makes sets a perfect fit. Converted both arrays into sets and used intersection to directly get the result in an efficient way. Key Learning: Choosing the right data structure can simplify the entire problem. #Day24 #100DaysOfCode #DSA #Python #LeetCode #ProblemSolving

Tribonacci: Space-Optimized Triple-Window DP Tribonacci extends Fibonacci to three predecessors: f(n) = f(n-1) + f(n-2) + f(n-3). Instead of storing all values, maintain sliding window of last three. Shift window left, compute new value as sum. Fixed-Window DP: When recurrence depends on fixed k previous states, maintain k-sized window instead of full array. Reduces O(n) space to O(k) — here O(3) = O(1). Time: O(n) | Space: O(1) #DynamicProgramming #Tribonacci #SlidingWindow #SpaceOptimization #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

🚀 Solved today’s GeeksforGeeks Problem of the Day: Intersection of Two Sorted Arrays using Python 🐍 Problem: Find the distinct common elements between two sorted arrays. Approach: Used the efficient Two Pointer Technique 👇 ✔ Traverse both arrays simultaneously ✔ Compare elements and move pointers accordingly ✔ Skip duplicates to ensure unique results 💡 Key Insight: Since arrays are already sorted, we can avoid extra data structures and solve it in O(n + m) time. 💡 Concepts Used: Two Pointers | Arrays | Duplicate Handling This problem is a great example of how understanding input properties (sorted arrays) can drastically optimize your solution 🚀 #geekstreak60 #geeksforgeeks #dsa #python #coding #problemSolving #arrays #twopointers

✅ Day 20 of #DSAPrep > Problem: Move Zeroes > Platform: LeetCode > Concept: Two Pointers Solved this problem using the two-pointer approach to move all zeroes to the end while maintaining the order of non-zero elements. > Key Idea: - Use one pointer to track position of non-zero elements - Traverse array and swap non-zero elements forward - Keep zeroes at the end automatically > Time Complexity: O(n) > Space Complexity: O(1) #DSAPrep #Algorithms #Python #TwoPointers #ProblemSolving #CodingJourney

Day 37 at Luminar Technolab Started with Pandas working with Series and DataFrames. Learned how to create, access, and manipulate data, along with basic indexing using iloc. Stepping into data analysis and EDA. #Python #Pandas #DataAnalysis #LearningJourney #Consistency

Day 38 at Luminar Technolab Worked with Pandas DataFrame selection using iloc and explored different ways to access rows and columns. Getting more comfortable navigating structured data #Python #Pandas #DataAnalysis #LearningJourney