Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

25 algorithms every programmer should know: Let's start with my top favorite 10. If nothing else, you should read about these algorithms and have a good idea of how they work: 1. Linear search to find an element in a list 2. Binary search to find an element on...

273,905 Aufrufe • vor 2 Jahren •via X (Twitter)

9 Kommentare

Profilbild von John Crickett
John Crickettvor 2 Jahren

99% of programmers will never write one of this professionally. Ironically the ones I have done aren't on this list.

Profilbild von Santiago
Santiagovor 2 Jahren

They won't. But the usefulness of learning these algorithms is not to write them later. That's the argument I make in the video.

Profilbild von Raul Junco
Raul Juncovor 2 Jahren

The main benefit of understanding algorithms is the skills you learn to solve problems efficiently and effectively.

Profilbild von Byron Goodman
Byron Goodmanvor 2 Jahren

I've never implemented DFS except in college, and graduate school. I have implemented A* and variations (BFS) many, many times. The problem with DFS is incomplete graphs and the bias introduced. A* requires more memory in comparison, but memory is cheap. Dijkstra's algorithm is basically A* so you can take that one off as well.

Profilbild von Calc Consulting
Calc Consultingvor 2 Jahren

21 Every algorithm related to neural networks 😂

Profilbild von Santiago
Santiagovor 2 Jahren

Yup :)

Profilbild von Edward Manda
Edward Mandavor 2 Jahren

What’s the name of the book 📖?

Profilbild von Anirudh Sharma
Anirudh Sharmavor 2 Jahren

Learning algorithms is not only useful for interviews but also beneficial for becoming a better problem solver.

Profilbild von inner voice priv/acc
inner voice priv/accvor 2 Jahren

Seriously! 📺 vids!

Ähnliche Videos

Experiments in progress. The one on the right has been learning for ~3 hours, the one in the middle for ~1 hour, and the one on the left just started a few minutes ago. The initial motivation for making the physical Atari was just to commit ourselves to a subset of algorithms that can make progress in this setup. This commitment rules out algorithms that require billions of samples to learn (or worse, require multiple environments running in parallel). Atari games are simple enough that we should be able to show learning on them in a short amount of time with no prior knowledge. Since then, I've realized that this setup is also a good way to compare different paradigms in robotics in a principled way. These paradigms are sim2real, learning from tele-operated data, and learning directly on the robots. So far, I have observed that getting sim2real to work reliably is hard. It requires tweaks that don't scale. Policies that can play perfectly in simulation fall apart because of latencies and the messiness of the real world. These aspects could be modeled to improve the simulation, but not without sinking significant human engineering hours. I have higher hopes for learning from tele-operated data, but that requires a human to learn the task first. These experiments are on my to-do list. I have to learn to play some of the games well through the robot. I’m half-decent at playing Pong and Ms Pacman now. Learning directly on robots is looking like the most promising approach. This approach takes away pesky distribution shifts and makes it possible to have algorithms that continually improve with more data and time without any human intervention. It feels great to let experiments run overnight and wake up to find improved policies. With learning on robots, I should, in principle, be able to go on a long vacation and come back to find better policies for complex tasks beyond Atari games. Whether that is possible with current learning algorithms is a different question.

Khurram Javed

52,110 Aufrufe • vor 6 Monaten

a playlist of 30 youtube videos to learn machine learning fundamentals from scratch if you're struggling on where to start learning ML, this list goes this "Machine Learning: Teach by Doing" is a solid choice to learn both theory and code. (1) Introduction to Machine Learning Teach by Doing: (2) What is Machine Learning? History of Machine Learning: (3) Types of ML Models: (4) 6 steps of any ML project: (5) Install Python and VSCode and run your first code: (6) Linear Classifiers Part 1: (7) Linear Classifiers Part 2: (8) Jupyter Notebook, Numpy and Scikit-Learn: (9) Running the Random Linear Classifier Algorithm in Python: (10) The oldest ML model - Perceptron: (11) Coding the Perceptron: (12) Perceptron Convergence Theorem: (13) Magic of features in Machine Learning: (14) One hot encoding: (15) Logistic Regression Part 1: (16) Cross Entropy Loss: (17) How gradient descent works: (18) Logistic Regression from scratch in Python: (19) Introduction to Regularization: (20) Implementing Regularization in Python: (21) Linear Regression Introduction: (22) Ordinary Least Squares step by step implementation: (23) Ridge regression fundamentals and intuition: (24) Regression recap for interviews: (25) Neural network architecture in 30 minutes: (26) Backpropagation intuition: (27) Neural network activation functions: (28) Momentum in gradient descent: (29) Hands on neural network training in Python: (30) Introduction to Convolutional Neural Networks (CNNs):

ℏεsam

117,570 Aufrufe • vor 1 Jahr

if you're struggling on where to start learning ML, here’s a playlist of 30 youtube videos to learn machine learning fundamentals from scratch "Machine Learning: Teach by Doing" is a solid choice to learn both theory and code. (1) Introduction to Machine Learning Teach by Doing: (2) What is Machine Learning? History of Machine Learning: (3) Types of ML Models: (4) 6 steps of any ML project: (5) Install Python and VSCode and run your first code: (6) Linear Classifiers Part 1: (7) Linear Classifiers Part 2: (8) Jupyter Notebook, Numpy and Scikit-Learn: (9) Running the Random Linear Classifier Algorithm in Python: (10) The oldest ML model - Perceptron: (11) Coding the Perceptron: (12) Perceptron Convergence Theorem: (13) Magic of features in Machine Learning: (14) One hot encoding: (15) Logistic Regression Part 1: (16) Cross Entropy Loss: (17) How gradient descent works: (18) Logistic Regression from scratch in Python: (19) Introduction to Regularization: (20) Implementing Regularization in Python: (21) Linear Regression Introduction: (22) Ordinary Least Squares step by step implementation: (23) Ridge regression fundamentals and intuition: (24) Regression recap for interviews: (25) Neural network architecture in 30 minutes: (26) Backpropagation intuition: (27) Neural network activation functions: (28) Momentum in gradient descent: (29) Hands on neural network training in Python: (30) Introduction to Convolutional Neural Networks (CNNs):

ℏεsam

108,861 Aufrufe • vor 1 Jahr

Holy shit… someone just made DSA finally click. Not static notes Not boring pseudocode Not guessing what happens in memory Real data structures — animating step-by-step — visually. It’s called Data Structure Visualizations and it lets you watch algorithms run in real time. Here’s why this is different: Instead of dumping theory, it shows execution live • nodes getting inserted • trees rotating • pointers moving • queues filling • stacks popping • graphs traversing • heaps rebalancing You literally see algorithms think. Everything is interactive: • Binary Search Trees • AVL Trees (with rotations) • Red-Black Trees • Heaps & Priority Queues • Graph BFS / DFS • Dijkstra & MST • Hash Tables • Tries • Sorting (Quick, Merge, Heap…) • Dynamic Programming No black box. Just input → steps → result Watch in real time: • AVL rotations balancing themselves • BFS exploring layer by layer • DFS diving deep then backtracking • Dijkstra relaxing edges step-by-step • Quick sort partition visually • Heap forming after each insert • Hash collisions resolving live This solves the biggest DSA problem: Most resources teach code → memorize → hope it works This shows input → execution → visualization → understanding Which means you finally understand: • why AVL rotates • how heap property maintains • how BFS differs from DFS • how Dijkstra actually updates distances • what happens during rehashing • how quicksort partitions • how trees rebalance Even better: You control everything Change values Insert nodes Run step-by-step Pause execution Replay algorithms Learning DSA becomes interactive Not passive Not confusing Not theoretical Just… visible. Perfect for: • DSA beginners • interview prep • visual learners • CS students • LeetCode prep • teaching algorithms • debugging understanding This is the kind of resource that makes trees, graphs, and sorting finally click. Link: We’re moving from reading DSA → watching DSA execute And once you can see algorithms… you stop memorizing and start understanding.

Suryansh Tiwari

14,425 Aufrufe • vor 2 Monaten