VehiclesFashionRecipesBlogsHuntTravelsSportFunHandmadeITEducation
Mini-Games
x

x
zakruti.com » IT - Software » freeCodeCamp.org
Data Structures and Algorithms in Python - Full Course for Beginners

Data Structures and Algorithms in Python - Full Course for Beginners

FBTwitterReddit

video description

Rating: 4.0; Vote: 1
A beginner-friendly introduction to common data structures (linked lists, stacks, queues, graphs) and algorithms (search, sorting, recursion, dynamic programming) in Python. This course will help you prepare for coding interviews and assessments. - Course website: https://jovian.ai/learn/data-structures-and-algorithms-in-python -- Created by Aakash N S, founder and CEO of Jovian. -- Course Lessons with Code -- - Lesson 1 - Binary Search, Linked Lists and Complexity - Linear and Binary Search: https://jovian.ai/aakashns/python-binary-search - Problem Solving Template: https://jovian.ai/aakashns/python-problem-solving-template - Linked Lists in Python: https://jovian.ai/aakashns/python-classes-and-linked-lists - Assignment 1 - Binary Search Practice - Starter Notebook: https://jovian.ai/aakashns/python-binary-search-assignment - Lesson 2 - Binary Search Trees, Traversals and Recursion - Binary Search Trees in Python: https://jovian.ai/aakashns/python-binary-search-trees - Problem Solving Template: https://jovian.ai/aakashns/python-problem-solving-template - Linked Lists in Python: https://jovian.ai/aakashns/python-classes-and-linked-lists - Assignment 2 - Hash Tables and Python Dictionaries - Starter Notebook: https://jovian.ai/aakashns/python-hash-tables-assignment - Lesson 3 - Sorting Algorithms and Divide & Conquer - Sorting and Divide & Conquer: https://jovian.ai/aakashns/python-sorting-divide-and-conquer - Problem Solving Template: https://jovian.ai/aakashns/python-problem-solving-template - Assignment 3 - Divide and Conquer Practice - Starter Notebook: https://jovian.ai/aakashns/python-divide-and-conquer-assignment - Lesson 4 - Recursion and Dynamic Programming - Problem-solving template: https://jovian.ai/aakashns/python-problem-solving-template - Dynamic Programming problems: https://jovian.ai/aakashns/dynamic-programming-problems - Lesson 5 - Graph Algorithms (BFS, DFS & Shortest Paths) - Graphs and Graph Algorithms (Starter Notebook): https://jovian.ai/aakashns/python-graph-algorithms - Project - Step-by-Step Solution to a Programming Problem - Starter Notebook: https://jovian.ai/aakashns/python-problem-solving-template - Lesson 6 - Python Interview Questions, Tips & Advice - Problem solving template: https://jovian.ai/aakashns/python-problem-solving-template - Coding problem 1: https://jovian.ai/aakashns/python-subarray-with-given-sum - Coding problem 2: https://jovian.ai/aakashns/python-minimum-edit-distance
Date: 2022-03-14

Comments and reviews: 10


I thank you for the lecture but I have major problem with the method. I was enjoying it initially until you got to the point of not solving the problems, rather giving the problems as questions without providing solutions. Many questions without solutions, how do I solve them? going for another research to get solution, what if the method is different from the one you are giving here and the scenario different as well? You just got us stocked on the way, browsing the net hopelessly in search for answers you needed to provide. If we have known the solution, then we would not have come to learn it again. Those questions are pain in the ass. Started well but ending sadly with regrets. My thought though
reply

You are right ma'am! your explanation is easy to follow up for every beginner's, after much tutorial online I decided to give investor Emilia a try of $500 in less than two weeks she was able to make a profit of $5000,999. ever since then my life have been better afterwards, I'm grateful at all your financial information and education.
reply

11:55 completely disagree with why Leetcode is important, this is a standard, nobody cares if you can solve it, it is a must, but if you can't, it means you did not do your homework, why bother. Simple separator. It does not tell a dime about how good a programmer is, only how prepared he is for the test.
reply

As a good teacher, if you want to give such question, while not give solve similar question as a guide, then give us a similar scenario to try our skills? This is how to help those who don't know in order to make them know, as a good teacher.
reply

For your linear search algorithm:
How is your return statement returning values? Mine only does so if I use print. Nothing is given when I use return, yet it works for you. Why is that? My code is verbatim the same as yours.

reply

Watch this 2x...
Implement in Java or C++
Do 1 hour increments alongside 2 hour increments for introduction to algorithm books
Do 1 hour leetcode blocks
Congrats, you're understanding is at a new level.

reply

there was a problem in binary search (1:08:06).first elif i think this should be lo=mid+1.bcs query is greater than midnumber so we have to search right side of the array.and next elif it should be hi=mid-1.
reply

Thank you so much for the lesson man. I wish you could hear me screaming that you are checking two different strings -exception- and -execution-. Anyway great video!
reply

A good substitute for the hashing function is just the -hash()- function in python since it uses a collision free algorithm called siphash.
reply

These people are my heroes...free learning with superb contnt.Thanku so much aakash and freecodecamp for such a great course.
reply
Add a review, comment






Other channel videos