Hashing Technique : its a searching technique, designed using mathematical model of functions. its fastest searching technique. ideal hashing takes O(1)

Hashing Technique - Simplified

This video shows how to device an Algorithm for Tower of Hanoi Problem and also Trace the Algorithm for 3 Discs Problem.

Tower of Hanoi Problem - Made Easy

Matrix Chain Multiplication using Dynamic Programming Formula

PATREON : https://www.patreon.com/bePatron?u=20475192

Courses on Udemy
================
Java Programming
https://www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6

Data Structures using C and C++
https://www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D

C++ Programming
https://www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225

[New] Matrix Chain Multiplication using Dynamic Programming Formula

PATREON : https://www.patreon.com/bePatron?u=20475192

Courses on Udemy
================
Java Programming
https://www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6

Data Structures using C and C++
https://www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D

C++ Programming
https://www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225


Bresenham's Line Drawing Algorithm
------------------------------------------------------------
1. Basics
2. Drawback of DDA
3. Problem with Floats
4. Derivation of Bresenhams
5. Algorithm
6. Example

Bresenham's Line Drawing Algorithm

Learn the basics of Big O Notation and Time Complexity in this crash course video.  Learn how to evaluate and discuss the performance of different solutions to the same problem.  How do you know which implementation is best?

If you're ready to launch your career as a software engineer, check out my job-guaranteed bootcamp with Springboard: https://springboard.com/workshops/software-engineering-career-track/?utm_source=coltsteele&utm_medium=youtubedescription&utm_campaign=sec

Complete Beginner's Guide to Big O Notation

In this multi-part coding challenge, I attempt an implementation of the A* Pathfinding Algorithm to find the optimal path between two points in a 2D grid. Code: https://thecodingtrain.com/challenges/51-a-pathfinding-algorithm

💻 Github Repo: https://github.com/CodingTrain/AStar
🕹️ p5.js Web Editor Sketch: https://editor.p5js.org/codingtrain/sketches/ehLjdFpat

Other Parts of this Challenge:
📺 A* Algorithm - Part 2: https://youtu.be/EaZxUCWAjb0
📺 A* Algorithm - Part 3: https://youtu.be/jwRT4PCT6RU

🎥 Previous video: https://youtu.be/QHEQuoIKgNE?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH
🎥 Next video: https://youtu.be/l__fEY1xanY?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH
🎥 All videos: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH

References:
📘 Artificial Intelligence: A Modern Approach: http://aima.cs.berkeley.edu/
🗄 A* Search Algorithm on Wikipedia: https://en.wikipedia.org/wiki/A*_search_algorithm
💻 Online demo: https://codingtrain.github.io/AStar/

Live Stream Archive:
🔴 Live Stream #72: https://www.youtube.com/watch?v=S4yQYiAECnM&t=34m50s

Related Coding Challenges:
🚂 #10 Maze Generator: https://youtu.be/HyK_Q5rrcr4
🚂 #162 Self Avoiding Walk: https://youtu.be/m6-cm6GZ1iw

Timestamps:
0:00:00 Introduction
0:01:26 A* Pathfinder
0:09:39 Coding a Grid
0:13:09 A* Pathfinder Algorithm
0:22:07 Choosing Best Available Path
0:27:05 Finding New Nodes
0:38:30 Adding Heuristic
0:41:50 Tracing Back
0:46:49 Using Better Heuristics

Editing by Mathieu Blanchette
Animations by Jason Heglund
Music from Epidemic Sound

🚂 Website: http://thecodingtrain.com/
👾 Share Your Creation! https://thecodingtrain.com/guides/passenger-showcase-guide
🚩 Suggest Topics: https://github.com/CodingTrain/Suggestion-Box
💡 GitHub: https://github.com/CodingTrain
💬 Discord: https://discord.gg/hPuGy2g
💖 Membership: http://youtube.com/thecodingtrain/join
🛒 Store: https://standard.tv/codingtrain
🖋️ Twitter: https://twitter.com/thecodingtrain
📸 Instagram: https://www.instagram.com/the.coding.train/

🎥 Coding Challenges: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH
🎥 Intro to Programming: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6Zy51Q-x9tMWIv9cueOFTFA

🔗 p5.js: https://p5js.org
🔗 p5.js Web Editor: https://editor.p5js.org/
🔗 Processing: https://processing.org

📄 Code of Conduct: https://github.com/CodingTrain/Code-of-Conduct

This description was auto-generated. If you see a problem, please open an issue: https://github.com/CodingTrain/thecodingtrain.com/issues/new

#aalgorithm #pathfinding #heuristic #p5js #javascript

Coding Challenge 51.1: A* Pathfinding Algorithm - Part 1

An introduction to dynamic programming, how to approach these types problems, and we'll step through a few basic ones.

Support me on:
Patreon: https://www.patreon.com/simondevyt

Follow me on:
Twitter: https://twitter.com/iced_coffee_dev
Instagram: https://www.instagram.com/beer_and_code/
Github: https://github.com/simondevyoutube/


Covering dynamic programming, top down vs bottom up approaches. What is memoization and tabulation. Will also answer a few quick problems like the Fibonacci series, Coin Change, Min Path Sum, 0-1 Knapsack, Subset Sum, and the Staircase problem.

1 Simple Trick to FAANG Interview Questions

An introduction to the floating point numbers (iee-754), and some of the oddities surrounding it.

Support me on:
Patreon: https://www.patreon.com/simondevyt

Follow me on:
Twitter: https://twitter.com/iced_coffee_dev
Instagram: https://www.instagram.com/beer_and_code/
Github: https://github.com/simondevyoutube/


Some great resources:
https://docs.oracle.com/cd/E19957-01/806-3568/ncg_goldberg.html
https://randomascii.wordpress.com/category/floating-point/

Some more great stuff:
https://en.wikipedia.org/wiki/Floating-point_arithmetic
https://en.wikipedia.org/wiki/Subnormal_number
https://en.wikipedia.org/wiki/Unit_in_the_last_place
https://www.h-schmidt.net/FloatConverter/IEEE754.html
https://cowboyprogramming.com/2007/01/05/visualizing-floats/