Understanding how to access data efficiently Day 34 at Luminar Technolab Worked on NumPy indexing and slicing forward indexing, backward indexing, and slicing in both 1D and 2D arrays. Learning how to navigate data more effectively step by step. #Python #NumPy #DataHandling #LearningJourney #Consistency
NumPy Indexing and Slicing Techniques
More Relevant Posts
-
Day 35 at Luminar Technolab Took NumPy a step further worked on reshaping arrays and applying indexing,slicing more practically. Starting to connect the concepts instead of just learning them #Python #NumPy #LearningJourney
To view or add a comment, sign in
-
From concepts → to code 💻 Explored Regularization (L1 & L2) with hands-on implementation and performance comparison. Analyzed how coefficients change, reduced overfitting, and improved model generalization. Gained deeper insight into the bias-variance tradeoff through practical learning. #ML #DataScience #LearningJourney #Python
To view or add a comment, sign in
-
Day 39 at Luminar Technolab Focused on data manipulation in Pandas adding columns, sorting values, and filtering using conditions. Also explored useful methods like head() and tail() for quick data insights. #Python #Pandas #DataAnalysis #LearningJourney #Consistency
To view or add a comment, sign in
-
🔁 Exploring Sorting Algorithms in Python Today I practiced two fundamental sorting techniques: ✅ Bubble Sort ✅ Selection Sort 💡 Key Learnings: * Bubble Sort repeatedly swaps adjacent elements to push larger elements to the end * Selection Sort selects the minimum element and places it in the correct position * Understanding time complexity becomes clearer when you count operations manually #Python #DataStructures #Algorithms #CodingJourney #100DaysOfCode #LearningInPublic
To view or add a comment, sign in
-
-
The Pearson correlation coefficient, is a statistical measure that quantifies the strength and direction of the linear relationship between two continuous variables, ranging from -1 to +1. A value of +1 implies a perfect positive linear relationship, -1 a perfect negative relationship, and 0 no linear correlation. The following video shows how to setup envoirnment for video (.mp4) or animation of the coefficient using python script and Jupyter Notebook. #Python #Machinelearning #Scripting
To view or add a comment, sign in
-
"Fisher-Pearson Moment based Coefficient of Skewness" self made statistical function in python. Types of Skewness are Negatively Skewed, Symmectric (Not Skewed), Positively Skewed. #python #DataScience #statistics #skewness #fisher #pearson #moment #sample #population #coefficient #data #distribution #negative #positive #bias #symmectric #gamma
To view or add a comment, sign in
-
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
To view or add a comment, sign in
-
-
🎥 Project Explanation Video Here is my explanation for Iris Flower Classification project using Machine Learning. 🔗 GitHub Link: https://lnkd.in/gKwJNFrr #DataScience #MachineLearning #Python #CodeAlpha
To view or add a comment, sign in
-
Day 32 at Luminar Technolab Focused on file handling in Python, reading data from files, processing it, and extracting useful insights. A small step closer to handling real world data. #Python #FileHandling #LearningJourney #ContinuousGrowth
To view or add a comment, sign in
-
Longest Consecutive Sequence: O(n) via Sequence Start Detection Sorting achieves O(n log n). HashSet enables O(n) with key insight — only start sequences from their true beginning. If n-1 exists, skip n (it's part of another sequence). This prevents redundant work, ensuring each number processed once. Start Detection Optimization: The n-1 check is what makes this O(n) not O(n²). Each element visited at most twice: once in outer loop, once during sequence counting. Recognizing when to skip prevents nested iteration. Time: O(n) | Space: O(n) #HashSet #SequenceDetection #LinearTime #OptimizationTrick #Python #AlgorithmDesign #SoftwareEngineering
To view or add a comment, sign in
-
Explore content categories
- Career
- Productivity
- Finance
- Soft Skills & Emotional Intelligence
- Project Management
- Education
- Technology
- Leadership
- Ecommerce
- User Experience
- Recruitment & HR
- Customer Experience
- Real Estate
- Marketing
- Sales
- Retail & Merchandising
- Science
- Supply Chain Management
- Future Of Work
- Consulting
- Writing
- Economics
- Artificial Intelligence
- Employee Experience
- Workplace Trends
- Fundraising
- Networking
- Corporate Social Responsibility
- Negotiation
- Communication
- Engineering
- Hospitality & Tourism
- Business Strategy
- Change Management
- Organizational Culture
- Design
- Innovation
- Event Planning
- Training & Development