- Notifications
You must be signed in to change notification settings - Fork2
Uzbek translation of Aditya Y. Bhargava's Grokking Algorithms: An Illustrated Guide for Programmers and Other Curious People
License
NotificationsYou must be signed in to change notification settings
realtemirov/grokking-algorithms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
| cover | coverY |
|---|---|
-65 |
- Introduction to graph
- What is a graph
- Breadth-first search
- Implementing the graph
- Implementing the algorithm
- Recap
- Working with Dijkstra's algorithm
- Terminology
- Trading for a piano
- Negative-weight edges
- Implementation
- Recap
- The classroom scheduling problem
- The knapsack problem
- The set-covering problem
- NP-complete problems
- Traveling salesperson, step by step
- Recap
- The knapsack problem
- Knapsack problem FAQ
- What happens if you add an item?
- What happens if you change the order of the rows?
- Can you fill in the grid column-wise instead of row-wise?
- What happens if you add a smaller item?
- Can you steal fractions of an item?
- Optimizing your travel itinerary
- Handling items that depend on each other
- Is it possible that the solution will require more than two sub-knapsacks?
- Is it possible that the best solution doesn't fill the knapsack completely?
- Longest common substring
- Recap
- Classifying oranges vs. grapefruit
- Building a recommendations system
- Introduction to machine learning
- Recap
About
Uzbek translation of Aditya Y. Bhargava's Grokking Algorithms: An Illustrated Guide for Programmers and Other Curious People
Topics
Resources
License
Uh oh!
There was an error while loading.Please reload this page.
Stars
Watchers
Forks
Releases
No releases published
Packages0
No packages published