Algorithms and Data Structures - Part 3

Name: Algorithms and Data Structures - Part 3
Rating: 4.4 (4 reviews)

Ace your next technical interview!

Created byKal Academy

Last updated 9/2020

English

What you'll learn

Basics of problem solving
Gain deeper understand of Algorithms and Data Structures
Master the skills needed to ace technical interviews
Dynamic Programming

Course content

4 sections • 10 lectures • 1h 33m total length

Introduction1:18

Introduction2:16
Problem 114:21
In this lecture, you will learn about Binomial Coefficient problem.
Problem 215:16
In this lecture, you will learn about Longest Increasing Subsequence Problem.
Problem 315:54
In this lecture, you will learn about Longest Common Subsequence problem.
Problem 415:15
In this lecture, you will learn about Edit Distance problem.
Problem 516:01
In this lecture, you will learn about N-Queens problem.

Requirements

Be able to comfortably program in a programming language of choice

Description

There are four parts to this program.

In part 1 of the course, we start with the deep dive implementations on some of the basic linear structures such as Arrays, Queues, Stacks and Dictionary. Understanding data structures are key to problem solving.

In part 2 of the course we will deep dive into problem solving, strings, Linked List and recursion.

In this part 3 of the course, we deep dive into more problem solving and dynamic programming.

Finally in part 4, we will cover Trees and Graphs.

Happy coding!

Who this course is for:

Developers preparing for technical interviews

Algorithms and Data Structures - Part 3

What you'll learn

Explore related topics

Course content

Introduction1 lecture • 1min

Dynamic Programming2 lectures • 13min

Problem Solving6 lectures • 1hr 19min

Conclusion1 lecture • 1min

Requirements

Description

Who this course is for: