So now that you know what machine learning is (teaching computers to learn from data), the next thing is.

How do they learn?

That’s where algorithms come in.
Think of algorithms as different learning styles.

Just like people — some learn best by watching videos, others by solving problems — computers have different ways to learn too. These different ways are what we call machine learning algorithms.

Let’s start with the most common and simple ones.

I’ll explain them one by one in a way that makes sense.

Here’s a quick list of popular ML algorithms:
Linear Regression – predicts numbers (like house prices).
Logistic Regression – predicts categories (yes/no, spam/not spam).
Decision Trees – makes decisions by asking questions.
Random Forest – a group of decision trees working together.
K-Nearest Neighbors (KNN) – looks at neighbors to decide.
Support Vector Machine (SVM) – draws lines to separate data.
Naive Bayes – based on probability, good for text (like spam filters).
K-Means Clustering – groups similar things together.
Principal Component Analysis (PCA) – reduces complexity of data.
Neural Networks – the backbone of deep learning (used in face recognition, voice assistants, etc.).

Wanna need a detailed explanation on each algorithm?

React with ♥️ and let me know in the comments if you really want to learn more about the algorithms.

You can now find Data Science & Machine Learning resources on WhatsApp as well: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

Now let's understand Linear Regression in detail.

Linear Regression is all about predicting a continuous value (like salary, price, temperature) based on another variable (like years of experience, number of products sold, etc.).

Let's say, You’re trying to predict someone's salary based on their years of experience. As experience increases, you generally expect the salary to increase too. What linear regression does is find the best line that fits this trend.

The line is represented by this simple equation:

Salary = m * Years of Experience + b

Here:
m is the slope of the line (it tells you how much salary increases with each additional year of experience).
b is the y-intercept (the starting point, or the salary when there's no experience).

The Process:

Training the model: The algorithm looks at all your data and tries to draw the straightest line possible that fits the pattern between experience and salary. It does this by adjusting the m (slope) and b (intercept) to minimize the difference between predicted and actual salaries.

Making predictions: Once the model has learned the best line, it can predict salaries for new people based on their years of experience. For example, if you tell it someone has 5 years of experience, it will give you the predicted salary.

Linear regression is great when there's a straight-line relationship between variables. It helps you make predictions, and because it’s simple, it’s often used as a starting point for many problems.

React with ♥️ if you need similar explanation for the rest of the algorithms

Data Science & Machine Learning resources: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

Top Machine Learning Libraries 👆

Let’s move on to the next one: Logistic Regression.

And don’t worry — even though it sounds like “linear regression,” this one’s all about yes or no answers.

What is Logistic Regression?

Let’s say you want to predict if someone will get approved for a loan or not.

You’ve got details like:

Their income
Credit score
Employment status

But the final output is binary — either “Yes” (approved) or “No” (not approved).

That’s where Logistic Regression comes in. It’s used when the outcome is yes/no, true/false, 0/1 — anything with just two categories.

Real-Life Vibe:
Imagine you’re trying to figure out if a student will pass or fail an exam based on the number of hours they study.

Now instead of drawing a straight line (like in linear regression), logistic regression draws an S-shaped curve.

Why?

Because we want to squeeze all predictions into a range between 0 and 1 — where:
Closer to 1 = high chance of “Yes”
Closer to 0 = high chance of “No”

For example:
If the model says 0.95 → Very likely to pass
If it says 0.20 → Not likely to pass

You can set a cut-off point, say 0.5 — anything above that is considered “Yes,” and below it is “No.”

It’s the go-to model for problems like:
Will the customer churn?
Is this email spam?
Will the patient have a disease?
Simple, fast, and surprisingly powerful.

React with ♥️ if you want me to cover the next one — Decision Trees!

Data Science & Machine Learning resources: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

Data Science Learning Circle 👆

Alright, let’s get into Decision Trees — one of the easiest and most intuitive ML algorithms out there.

Think of it like this:

You're playing 20 Questions — where each question helps you narrow down the possibilities. Decision Trees work just like that.

It’s like teaching a computer how to ask smart questions to reach an answer.

Real-Life Example:

Say you’re trying to decide whether to go for a walk.

Your brain might go:

Is it raining?
→ Yes → Stay home.
→ No → Next question.

Is it too hot?
→ Yes → Stay home.
→ No → Go for a walk.


This “question-answer” logic is exactly how a Decision Tree works.

It keeps splitting the data based on the most useful questions — until it reaches a decision.


In ML Terms (Still super simple):

Let’s say you’re building a model to predict if someone will buy a product online.

The decision tree might ask:

Is their age above 30?

Did they visit the website more than 3 times this week?

Do they have items in their cart?


Depending on the answers (yes/no), the tree branches out until it reaches a final decision: Buy or Not Buy.

Why It’s Cool:

Easy to understand and explain (no complex math).

Works for both classification (yes/no) and regression (predicting numbers).

Looks just like a flowchart — very visual.


But there’s a twist: one tree is cool, but a bunch of trees is even better.

Shall we talk about that next? It’s called Random Forest — and it’s like a team of decision trees working together.

React with ❤️ if you want me to explain Random Forest

Data Science & Machine Learning resources: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

ENJOY LEARNING 👍👍

Let’s go — time for Random Forest, one of the most powerful and popular algorithms out there!


Let's say, You want to make an important decision — so instead of asking just one person, you ask 100 people and go with the majority opinion.

That’s Random Forest in a nutshell.

It builds many decision trees, lets them all vote, and then takes the most popular answer.

Why?

Because relying on just one decision tree can be risky — it might overfit (aka learn too much from the training data and mess up on new data).

But if you build many trees on slightly different pieces of data, each one learns something different. When you bring all their results together, the final answer is way more accurate and balanced.

It’s like:

One tree might make a mistake.

But a forest of trees? Much smarter together.


Real-Life Analogy:

Let’s say you’re trying to decide which laptop to buy.

You ask one friend (that’s like a decision tree).

Or you ask 10 friends, each with different experiences, and you go with what most of them say (that’s a random forest).


You’ll feel a lot more confident in your decision, right?

That’s exactly what this algorithm does.

Where to use it:

- Predicting whether someone will default on a loan

- Detecting fraud

- Recommending products

Any place where accuracy really matters


It’s a bit heavier computationally, but the trade-off is often worth it.

React with ♥️ if you want me to cover all ML Algorithms

Up next: K-Nearest Neighbors (KNN) — the friendly neighbor algorithm!

Data Science & Machine Learning resources: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

ENJOY LEARNING 👍👍

Cool! Let’s jump into K-Nearest Neighbors (KNN) — the friendly, simple, but surprisingly smart algorithm.

Let's say, You move into a new neighborhood and you want to figure out what kind of food the locals like.

So, you knock on the doors of your nearest 5 neighbors and ask them.

If 3 say “we love pizza” and 2 say “we love sushi,” you assume — “Alright, this area probably loves pizza.”

That’s how KNN works.


How It Works:

Let’s say you have a bunch of data points (people, items, whatever) and each one is labeled — like:

This customer bought the product.

This one didn’t.


Now you get a new customer and want to predict if they’ll buy.

KNN looks at the K closest points (neighbors) in the data — maybe 3, 5, or 7 — and checks:

What decision did those neighbors make?

Whichever label is in the majority becomes the prediction for the new one.


Simple voting system — based on closeness.


But Wait, What’s “Nearest”?

It means:

Whose values (like age, income, etc.) are most similar?

“Closeness” is measured using math — like distance in space.


So, it’s not literal neighbors — it’s more like “closest match” in the data.”


Where It Works Well:

Classifying handwritten digits (0–9)

Recommendation systems

Face recognition

When you need something simple but effective


The beauty? No training phase! It just stores the data and looks around at prediction time.


React with ♥️ if you're ready for the next algorithm, Support Vector Machines (SVM). It’s like drawing the cleanest line possible between two groups.

Data Science & Machine Learning resources: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

ENJOY LEARNING 👍👍

I unlocked my perplexity pro with college email id today, I think it's valid till 31st May only

Now, Let’s learn about Support Vector Machines (SVM) — sounds fancy, but I’ll break it down super chill.


Imagine, You’ve got two types of animals — let’s say cats and dogs — scattered around on a piece of paper.

Your job? Draw a straight line that separates all the cats from the dogs.

There might be lots of possible lines, but you want the best one — the one that keeps cats on one side, dogs on the other, and is as far away from both groups as possible.

That’s exactly what SVM does.


SVM finds the clearest boundary (called a hyperplane) between two groups. And not just any boundary — the one with the maximum margin, meaning the most space between the two groups.

Because more margin = better separation = fewer mistakes.


Real-Life Example:

Let’s say you're a bouncer at a club.

People line up outside and you need to decide:

Let them in? (Yes)

Turn them away? (No)


You make your call based on their age, dress code, and maybe how confident they walk up.

Now you want the cleanest rule possible to decide this every time — that’s what SVM builds.

Extras:

If the data isn’t linearly separable (i.e., you can’t split it with a straight line), SVM can do some math magic (called kernel trick) and bend the space so you can split it — like adding another dimension.


Imagine drawing a circle in 2D vs slicing with a plane in 3D — yeah, that kind of cool.

When to Use SVM:

- Face detection

- Text classification (like spam or not spam)

- Bioinformatics (disease prediction, gene classification)


SVM can be a bit heavy and sensitive to scaling, but it’s super powerful when tuned right.

React with ♥️ if you want to keep the things going?

Next up: Naive Bayes — it’s got the word “naive” but don’t let that fool you. 😂

Data Science & Machine Learning resources: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

ENJOY LEARNING 👍👍

Awesome — time for Naive Bayes, the underdog of ML algorithms that’s way smarter than it sounds!


Let’s start with the name:

“Naive” — because it assumes that all the features (inputs) are independent of each other.
“Bayes” — comes from Bayes’ Theorem, a rule in probability that helps us update our belief based on new evidence.

Sounds a bit nerdy? Let me simplify.


Real-Life Example:

Imagine you're trying to guess if someone is a morning person or night owl based on:

Do they drink coffee?

Do they watch Netflix late?

Do they wake up early?


Now, a Naive Bayes model would assume that each of these habits independently contributes to the final guess — even if in real life, they might be related (like Netflix late = wakes up late).

Despite this "naive" assumption — it works shockingly well, especially with text data.


Think of It Like This:

It calculates the probability of each possible outcome and chooses the one with the highest chance.

Let’s say you're checking an email and deciding:

Spam or Not Spam


Naive Bayes looks at:

Does the email have the word "free"?

Does it mention "limited offer"?

Is there a weird link?


It uses all these clues (independently) to guess: “Hmm, looks like spam.”


Why It’s Awesome:

Blazing fast — great for real-time stuff

Works really well for:

- Spam detection

- Sentiment analysis (positive or negative reviews)

- News classification (sports, politics, tech)


It’s not perfect when features are heavily dependent on each other, but for text and high-dimensional data — it’s a beast.

React with ❤️ if you're ready for the next algorithm Logistic Regression — don’t be fooled by the name, it’s more about classification algorithm than regression.

Data Science & Machine Learning resources: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

ENJOY LEARNING 👍👍

Let’s go! Time to understand our next algorithm Logistic Regression

First things first:

Despite the name, it’s not used for regression (predicting numbers) — it’s actually used for classification (like yes/no, spam/not spam, 1/0).

So think of it more like:

> “Will this happen or not?”
“Yes or No?”
“True or False?”


Real-Life Example:

Let’s say you're a recruiter looking at resumes.

You want to predict: Will this candidate get hired?

You’ve got features like:

Years of experience

Skill match

Education level


You feed those into a Logistic Regression model, and it gives you a probability, like:

> “There’s an 82% chance this person will be hired.”



If it’s above a certain threshold (like 50%), it predicts “Yes” — otherwise “No.”


How It Works (Simply):

It draws a boundary between two classes — like a straight line (or curve) that separates:

All the YES cases on one side

All the NO cases on the other


It uses something called a sigmoid function to convert numbers into probabilities between 0 and 1.

That’s the trick — instead of predicting a raw score, it predicts how confident it is.


Why It’s Used:

- Easy to understand

- Works well with smaller data

- Good baseline model for many classification problems


Some good usecases:

Credit scoring (Will you repay the loan?)

Medical diagnosis (Is it cancerous or not?)

Marketing (Will the customer click the ad?)


It’s like the entry-level, but highly reliable classifier in your ML toolkit.

React with ♥️ if you want to dive into the next one — Gradient Boosting

ENJOY LEARNING 👍👍

Now, let’s understand Gradient Boosting Algorithm


Let's say, You’re trying to guess someone’s age just by looking at them.

You ask your friend, and they say:

> “Hmm, looks like 30.”



You know they’re not great at guessing, but not totally wrong either.

So, you ask a second friend to fix the mistake made by the first one.
Then a third friend tries to fix the errors of both.

Now combine all their guesses — the final answer is a smarter, more accurate prediction.

That’s exactly how Gradient Boosting works.


Simply, It doesn’t build one big smart model.

Instead, it builds lots of small, weak models (usually decision trees), and each one tries to correct the mistakes made by the previous ones.

- First model gives a rough prediction.

- Second model looks at where the first went wrong.

- Third model fixes that again.

And so on…


By the end, all those tiny models work together like a squad to give a powerful prediction.

Why “Gradient” Boosting?

“Gradient” refers to using gradient descent — a fancy way of saying:

> "Let's go step-by-step in the right direction to reduce errors."



Every new tree is built in a way that reduces the error made by the previous ones — kind of like learning from feedback.


Where to use Gradient Boosting:

- Loan default prediction

- Customer churn modeling

- Kaggle competitions (it’s a fan favorite)

- Stock price movements


It’s used in powerful libraries like XGBoost, LightGBM, and CatBoost — all variations of this technique.

Super powerful, but can be slow and needs good tuning.

React with ♥️ if you want to me to talk about Random Forest — another tree-based algorithm, but with a different twist!

Data Science & Machine Learning Resources: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

ENJOY LEARNING 👍👍

🔍 Machine Learning Cheat Sheet 🔍

1. Key Concepts:
- Supervised Learning: Learn from labeled data (e.g., classification, regression).
- Unsupervised Learning: Discover patterns in unlabeled data (e.g., clustering, dimensionality reduction).
- Reinforcement Learning: Learn by interacting with an environment to maximize reward.

2. Common Algorithms:
- Linear Regression: Predict continuous values.
- Logistic Regression: Binary classification.
- Decision Trees: Simple, interpretable model for classification and regression.
- Random Forests: Ensemble method for improved accuracy.
- Support Vector Machines: Effective for high-dimensional spaces.
- K-Nearest Neighbors: Instance-based learning for classification/regression.
- K-Means: Clustering algorithm.
- Principal Component Analysis(PCA)

3. Performance Metrics:
- Classification: Accuracy, Precision, Recall, F1-Score, ROC-AUC.
- Regression: Mean Absolute Error (MAE), Mean Squared Error (MSE), R^2 Score.

4. Data Preprocessing:
- Normalization: Scale features to a standard range.
- Standardization: Transform features to have zero mean and unit variance.
- Imputation: Handle missing data.
- Encoding: Convert categorical data into numerical format.

5. Model Evaluation:
- Cross-Validation: Ensure model generalization.
- Train-Test Split: Divide data to evaluate model performance.

6. Libraries:
- Python: Scikit-Learn, TensorFlow, Keras, PyTorch, Pandas, Numpy, Matplotlib.
- R: caret, randomForest, e1071, ggplot2.

7. Tips for Success:
- Feature Engineering: Enhance data quality and relevance.
- Hyperparameter Tuning: Optimize model parameters (Grid Search, Random Search).
- Model Interpretability: Use tools like SHAP and LIME.
- Continuous Learning: Stay updated with the latest research and trends.

Best Data Science & Machine Learning Resources: https://topmate.io/coding/914624

All the best 👍👍

If you're serious about getting into Data Science with Python, follow this 5-step roadmap.

Each phase builds on the previous one, so don’t rush.

Take your time, build projects, and keep moving forward.

Step 1: Python Fundamentals
Before anything else, get your hands dirty with core Python.
This is the language that powers everything else.

✅ What to learn:
type(), int(), float(), str(), list(), dict()
if, elif, else, for, while, range()
def, return, function arguments
List comprehensions: [x for x in list if condition]
– Mini Checkpoint:
Build a mini console-based data calculator (inputs, basic operations, conditionals, loops).

Step 2: Data Cleaning with Pandas
Pandas is the tool you'll use to clean, reshape, and explore data in real-world scenarios.

✅ What to learn:
Cleaning: df.dropna(), df.fillna(), df.replace(), df.drop_duplicates()
Merging & reshaping: pd.merge(), df.pivot(), df.melt()
Grouping & aggregation: df.groupby(), df.agg()
– Mini Checkpoint:
Build a data cleaning script for a messy CSV file. Add comments to explain every step.

Step 3: Data Visualization with Matplotlib
Nobody wants raw tables.
Learn to tell stories through charts.

✅ What to learn:
Basic charts: plt.plot(), plt.scatter()
Advanced plots: plt.hist(), plt.kde(), plt.boxplot()
Subplots & customizations: plt.subplots(), fig.add_subplot(), plt.title(), plt.legend(), plt.xlabel()
– Mini Checkpoint:
Create a dashboard-style notebook visualizing a dataset, include at least 4 types of plots.

Step 4: Exploratory Data Analysis (EDA)
This is where your analytical skills kick in.
You’ll draw insights, detect trends, and prepare for modeling.

✅ What to learn:
Descriptive stats: df.mean(), df.median(), df.mode(), df.std(), df.var(), df.min(), df.max(), df.quantile()
Correlation analysis: df.corr(), plt.imshow(), scipy.stats.pearsonr()
— Mini Checkpoint:
Write an EDA report (Markdown or PDF) based on your findings from a public dataset.

Step 5: Intro to Machine Learning with Scikit-Learn
Now that your data skills are sharp, it's time to model and predict.

✅ What to learn:
Training & evaluation: train_test_split(), .fit(), .predict(), cross_val_score()
Regression: LinearRegression(), mean_squared_error(), r2_score()
Classification: LogisticRegression(), accuracy_score(), confusion_matrix()
Clustering: KMeans(), silhouette_score()

– Final Checkpoint:

Build your first ML project end-to-end
✅ Load data
✅ Clean it
✅ Visualize it
✅ Run EDA
✅ Train & test a model
✅ Share the project with visuals and explanations on GitHub

Don’t just complete tutorialsm create things.

Explain your work.
Build your GitHub.
Write a blog.

That’s how you go from “learning” to “landing a job

Best Data Science & Machine Learning Resources: https://topmate.io/coding/914624

All the best 👍👍

Let's move on to the next Machine Learning Algorithm Random Forest

Let's say, you’ve got a really tough question to answer — so you don’t just ask one expert.
You ask a whole panel of experts, each with their own opinion.

Then, you take a vote — and go with what the majority says.

That’s how Random Forest works.


At its core, it builds lots of decision trees, not just one.

Each tree gets:

- A random subset of the data

- A random subset of the features (columns)


Each tree makes a prediction — and then the forest says:

> “Alright, let’s vote!” 😄



For classification, it picks the class most trees agree on.
For regression, it averages the numbers predicted by each tree.


Why Randomness? 🤔

That randomness actually makes the model more robust.

Instead of every tree seeing the same stuff and making the same mistakes, each tree gets its own “view,” which reduces overfitting and makes the whole forest more balanced and fair.


In Real Life:

Let’s say you’re predicting whether a loan applicant is risky.

One tree might focus on income and age.
Another tree might focus on employment history and loan amount.
Another might consider credit score and existing debt.

Together, they make a better decision than any single tree.


When to Use Random Forst:

- Credit scoring

- Stock market analysis

- Fraud detection

- Healthcare diagnosis


It’s often the go-to when you want high accuracy and don’t mind the model being a bit of a black box.

React with ❤️ if you want me to cover next important algorithm K-Nearest Neighbors (KNN)

Data Science & Machine Learning Resources: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

ENJOY LEARNING 👍👍

Roadmap to become a Data Scientist:

📂 Learn Python & R
∟📂 Learn Statistics & Probability
∟📂 Learn SQL & Data Handling
∟📂 Learn Data Cleaning & Preprocessing
∟📂 Learn Data Visualization (Matplotlib, Seaborn, Power BI/Tableau)
∟📂 Learn Machine Learning (Supervised, Unsupervised)
∟📂 Learn Deep Learning (Neural Nets, CNNs, RNNs)
∟📂 Learn Model Deployment (Flask, Streamlit, FastAPI)
∟📂 Build Real-world Projects & Case Studies
∟✅ Apply for Jobs & Internships

React ❤️ for more

Free Data Science Resources: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

Machine Learning Algorithms every data scientist should know:

📌 Supervised Learning:

🔹 Regression
∟ Linear Regression
∟ Ridge & Lasso Regression
∟ Polynomial Regression

🔹 Classification
∟ Logistic Regression
∟ K-Nearest Neighbors (KNN)
∟ Decision Tree
∟ Random Forest
∟ Support Vector Machine (SVM)
∟ Naive Bayes
∟ Gradient Boosting (XGBoost, LightGBM, CatBoost)


📌 Unsupervised Learning:

🔹 Clustering
∟ K-Means
∟ Hierarchical Clustering
∟ DBSCAN

🔹 Dimensionality Reduction
∟ PCA (Principal Component Analysis)
∟ t-SNE
∟ LDA (Linear Discriminant Analysis)


📌 Reinforcement Learning (Basics):
∟ Q-Learning
∟ Deep Q Network (DQN)


📌 Ensemble Techniques:
∟ Bagging (Random Forest)
∟ Boosting (XGBoost, AdaBoost, Gradient Boosting)
∟ Stacking

Don’t forget to learn model evaluation metrics: accuracy, precision, recall, F1-score, AUC-ROC, confusion matrix, etc.

Free Machine Learning Resources: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D

React ❤️ for more free resources

Machine Learning – Essential Concepts 🚀

1️⃣ Types of Machine Learning

Supervised Learning – Uses labeled data to train models.

Examples: Linear Regression, Decision Trees, Random Forest, SVM


Unsupervised Learning – Identifies patterns in unlabeled data.

Examples: Clustering (K-Means, DBSCAN), PCA


Reinforcement Learning – Models learn through rewards and penalties.

Examples: Q-Learning, Deep Q Networks



2️⃣ Key Algorithms

Regression – Predicts continuous values (Linear Regression, Ridge, Lasso).

Classification – Categorizes data into classes (Logistic Regression, Decision Tree, SVM, Naïve Bayes).

Clustering – Groups similar data points (K-Means, Hierarchical Clustering, DBSCAN).

Dimensionality Reduction – Reduces the number of features (PCA, t-SNE, LDA).


3️⃣ Model Training & Evaluation

Train-Test Split – Dividing data into training and testing sets.

Cross-Validation – Splitting data multiple times for better accuracy.

Metrics – Evaluating models with RMSE, Accuracy, Precision, Recall, F1-Score, ROC-AUC.


4️⃣ Feature Engineering

Handling missing data (mean imputation, dropna()).

Encoding categorical variables (One-Hot Encoding, Label Encoding).

Feature Scaling (Normalization, Standardization).


5️⃣ Overfitting & Underfitting

Overfitting – Model learns noise, performs well on training but poorly on test data.

Underfitting – Model is too simple and fails to capture patterns.

Solution: Regularization (L1, L2), Hyperparameter Tuning.


6️⃣ Ensemble Learning

Combining multiple models to improve performance.

Bagging (Random Forest)

Boosting (XGBoost, Gradient Boosting, AdaBoost)



7️⃣ Deep Learning Basics

Neural Networks (ANN, CNN, RNN).

Activation Functions (ReLU, Sigmoid, Tanh).

Backpropagation & Gradient Descent.


8️⃣ Model Deployment

Deploy models using Flask, FastAPI, or Streamlit.

Model versioning with MLflow.

Cloud deployment (AWS SageMaker, Google Vertex AI).

Join our WhatsApp channel: https://whatsapp.com/channel/0029Va8v3eo1NCrQfGMseL2D