Showing posts with label Algorithms. Show all posts
Showing posts with label Algorithms. Show all posts
Data Structures & Algorithms, Level-up Course(2021)
Wednesday, August 18, 2021
Data Structures & Algorithms, Level-up Course(2021) - The only course you need to master problem solving using Data Structures & Algorithms in C++
- Hot & New
- Created by Prateek Narang, Coding Minutes
- English [Auto]
What you'll learn
- Accelerate your algorithmic thinking
- Learn to optimise brute force solutions
- Learn to apply data structures
- Learn to write complex codes
- 150+ carefully curated problems
- Analysis of space-time complexity
- Using C++ Standard Template Library
- Become a 10x Problem Solver
- Sliding Window, Hashing, Maps & Sets
- Master Dynamic Programming & Graphs
- BONUS : Build a LRU Cache
- Practice Questions on all important topics
Description
Do you find yourself feeling like you get "stuck" every time you get a coding question?
Welcome to Data Structures & Algorithms, Level up Course the only course that provides you an ultimate practice on problem solving process and helping you to take your data structures & algorithms to the next level. The course is taught by an expert instructor Prateek Narang from Google, who is not just a software engineer but also has mentored thousands of students in becoming great programmers & developers.
The Course contains 25+ hours of interactive video content & dozens of coding exercises, teaching you the right tips & tricks in problem solving in a most concise way. Every problem discussion starts with a brute force approach, optimisations and ends with hands-on-coding video in C++ as well.
Here is what you will learn -
Problems on Data Structures
* Arrays, Strings, Vectors
* Hashing (Unordered Maps, Maps, Sets)
* Stacks, Queues, Linked Lists
* Binary Trees, BSTs, Heaps
* Graphs, Tries
Problems on Algorithms
* Brute force, Backtracking
* Sliding Window Algorithms
* Sorting, Searching, Binary Search
* Dynamic Programming Fundamentals
* Important Graph Algorithms
* BFS & DFS, Shortest Paths
Course exercises are in C++ but programmers having experience in one or more languages (C++/Java/Python/JavaScript) can definitely do this course, provided they have fundamental understanding of data structures. The course covers both breadth & depth of topics, diving deep where-ever needed. You will also learn how to apply techniques involving like - sorting & searching algorithms, sliding window, binary search, hashing which are very important for problem solving. For advanced topics like Dynamic Programming & Graphs, the course starts from the basics & helps you master these topics from the very fundamentals.
Unlike most instructors, I am not a salesperson or a marketer. My job is to help you build strong fundamentals in programming & be a successful developer. Through Udemy, I am providing this course to you at a fraction of cost of its original cost, so that anyone who is interested to learn can take their skills to the next level. So I hope you sign up today, and I will see you in the course.
Who this course is for:
- Students pursuing Computer Science or related fields
- Beginner-Intermediate level programmers with basic knowledge of data structures
- Developers who want to excel in problem solving skills & competitive coding
- Students who know theory of data structures, but find hard to implement in problems
100% Off Udemy Coupon . Free Udemy Courses . Online Classes
Posted by
free courses
at
August 18, 2021
Labels: Algorithms, Development, Software Engineering
Advanced Algorithms and Data Structures in Python
Wednesday, August 11, 2021
Free Udemy Coupon
Advanced Algorithms and Data Structures in Python - Fenwick trees, Caches, Splay Trees, Prefix Trees (Tries), Substring-Search Algorithms and Travelling Salesman Problem
- Created by Holczer Balazs
- English [Auto]
Description
This course is for those who are interested in computer science and want to implement the algorithms and given data structures in Python. In every chapter you will learn about the theory of a given data structure or algorithm and then you will implement them from scratch.
Chapter 1: Binary Indexed Trees (Fenwick Trees)
theory behind the binary indexed tree or Fenwick tree data structure
how to use this data structure in computer vision and artificial intelligence
implementation in Python
Chapter 2: LRU Caches
what are caches and why are they so important
how to use doubly linked lists to implement caches
theory behind LRU caches
implementation in Python
Chapter 3: Splay Trees
what are splay trees
how to achieve caches with splay trees
Chapter 4: B-Trees
external memory and internal memory (RAM)
data structures for the external memory
trees with multiple children and multiple keys
what are B-tree data structures?
Chapter 5: Prefix Trees (Tries)
what are tries or prefix trees
real world applications of tries
autocomplete feature of tries
sorting with tries
IP routing
Chapter 6: Ternary Search Trees
what are ternary search trees
boggle game with tries
Chapter 7: Substring Search Algorithms
what are substring search algorithms and why are they important in real world softwares
brute-force substring search algorithm
hashing and Rabin-Karp method
Knuth-Morris-Pratt substring search algorithm
Z substring search algorithm (Z algorithm)
implementations in Python
Chapter 8: Hamiltonian cycles (Travelling Salesman Problem)
Hamiltonian cycles in graphs
what is the travelling salesman problem?
how to use backtracking to solve the problem
meta-heuristic approaches to boost algorithms
Chapter 9: Eulerian Cycles (Chinese Postman Problem)
Eulerian cycles in graphs
what is the chinese postman problem?
Thanks for joining my course, let's get started!
Who this course is for:
- This course is suited for anyone who has some basic knowledge in Python and interested in algorithms and data structures
100% Off Udemy Coupon . Free Udemy Courses . Online Classes
Posted by
free courses
at
August 11, 2021
Labels: Algorithms, IT & Software, Other IT & Software
Ultimate JavaScript Interview Course
Saturday, June 20, 2020
Free Coupon Discount - Prepare for you next JavaScript interview by learning Data Structures, Algorithms, and Interview Questions | Created by Eric Traub
Students also bought
- Asynchronous JavaScript Deep Dive
- React js. From the beginning. w/ Redux and React Router
- Mastering JavaScript Arrays
- Mastering Regular Expressions in JavaScript
- Gulp 4: Automate your development workflow
Preview this Udemy Course GET COUPON CODE
Description
Are you looking for a job as a JavaScript developer or software engineer? This is the course for you! This course is specifically designed to prepare you for any JavaScript coding interviews that you have coming up. Programming interviews are known to be stressful and difficult, but they don't have to be! The key to succeeding in a coding interview is preparation. This course will prepare you for coding interviews by teaching you the 3 most important aspects you need to know: Data Structures, Algorithms, and Practice Interview Questions. Throughout this course you will learn how to code out all of these and more! The data structures, algorithms, and interview questions that we will cover in this course come from real-life interviews at real companies.
The purpose of this course is not for you to memorize the exercises that we will be covering, but instead for you to gain a deep understanding about how the javascript code is working under-the-hood. By really understanding how the code works you will be able to succeed in any interview questions that you may be asked in real life. The purpose of this course is for you to learn the important skills, techniques, and concepts that will help you to excel in any real life interview questions that you are asked. Some of the skills, techniques, and concepts that you will learn in this course are:
Algorithms
Data Structures
Real Interview Questions
Recursion & the Call Stack
Big O Notations
Memoization
Functional Programming
Variable and Function Hoisting
Global, function, & block scopes
Closures
Immediately Invoked Function Expressions (IIFEs)
Currying functions
Passing data by reference
The prototype object & constructor functions
The "this" keyword and it's use cases
Temporary variables
Manipulating data types
The importance of "strict" mode
Object equivalency
Binary search (recursively)
Merge Sort & Bubble Sort
The Sieve of Eratosthenes
Caesar Cipher
Fibonacci
Inheritance in JavaScript
Binary Search Trees
Hash Tables
And much, much more...
When you have completed this course you will have a great understanding of data structures, algorithms, and interview questions, but more importantly you will also have learned the concepts, skills, and techniques, that are necessary for you to excel in any other interview questions that you may be asked. You will feel very confident going into any javascript interviews you will have. I hope you enjoy the course!
Who this course is for:
Anyone who is looking for a job as a programmer
Anyone who is looking for a job as a web developer
Anyone who will be interviewing for a programming or web developer job
Anyone who wants to strengthen their javascript skills and knowledge
100% Off Udemy Coupon . Free Udemy Courses . Online Classes
Posted by
free courses
at
June 20, 2020
Labels: Algorithms, Development, Software Engineering
Algorithms Bootcamp in C++
Sunday, December 15, 2019
Free Coupon Discount - Algorithms Bootcamp in C++, Recursion, backtracking, dynamic programming and data structures (linked lists, queues, stacks and binary search trees)
4.4 (137 ratings), Created by Holczer Balazs, English [Auto-generated]
Preview this Udemy Course - GET COUPON CODE
Description
This course is for those who are interested in computer science and want to implement the algorithms and given data structures in C++ from scratch. In every chapter you will learn about the theory of a given data structure or algorithm and then you will implement them from scratch.
Chapter 1: Recursion
theory behind recursion (recursive function calls)
recursion and stack memory of the OS
recursive problems: binary search and Towers of Hanoi problem
Chapter 2: Backtracking
what is backtracking
how to solve problems with backtracking
N-queens problem, coloring problem and knight's tour
Chapter 3: Dynamic Programming
overlapping subproblems and dynamic programming
what is "memoization"
Fibonacci numbers and knapsack problem
Chapter 4: Data Structures
data structures and abstract data types (ADTs)
arrays and linked lists
stacks
queues
binary search trees
priority queues (heaps)
associative arrays (maps)
Thanks for joining my course, let's get started!
Who this course is for:
Intermediate C++ developers curious about algorithms and data structures
100% Off Udemy Coupon . Free Udemy Courses . Online Classes
Posted by
free courses
at
December 15, 2019
Labels: Algorithms, Development, Programming Languages
Subscribe to:
Posts (Atom)



