About UsCoursesCareer PathsBlogOpportunities

Log In

Courses>log>Algorithms for Coding Interviews in C++

Algorithms for Coding Interviews in C++

Price:Paid

Length:15 hours

Content type:text

level:intermediate

Language:English

Updated:21 August 2022

Published:15 April 2022

Similar courses

Opportunities

Courses>>Algorithms for Coding Interviews in C++

Algorithms for Coding Interviews in C++Paid

Educative English

Coderust

DescriptionWith algorithms being arguably the most common theme in coding interviews, having a firm grip on them can be the difference between being hired and not. After this comprehensive course, you'll have an in-depth understanding of different algorithm types and be equipped with a simple process for approaching complexity analysis.
As you progress, you’ll be exposed to the most important algorithms you're likely to encounter on an interview, work your way through over 50 interactive coding challenges, and review detailed solutions for each problem. You’ll walk away with the ability to build up to the optimal solution for addressing those tough coding interview questions head-on.
This course is the latest addition to our popular Interview Refresher series, which has helped developers land jobs in top companies including Google, Microsoft, and Apple.

Syllabus

Introduction

1. Who This Course Is For

2. Learning Outcomes

Algorithmic Paradigms

1. Brute Force

2. Greedy Algorithms

3. Divide and Conquer

4. Dynamic Programming

Introduction to Complexity Measures

1. Comparing Algorithms

2. Example 1: Measuring Time Complexity of a Single Loop Algorithm

3. Example 2: Time Complexity of an Algorithm With Nested Loops

4. Introduction to Asymptotic Analysis and Big O

5. Other Common Asymptotic Notations and Why Big O Trumps Them

6. Useful Formulae

7. Common Complexity Scenarios

8. Challenge 1: Big (O) of Nested Loop with Addition

9. Solution Review: Big (O) of Nested Loop with Addition

10. Challenge 2: Big (O) of Nested Loop with Subtraction

11. Solution Review: Big (O) of Nested Loop with Subtraction

12. Challenge 3: Big (O) of Nested Loop with Multiplication

13. Solution Review: Big (O) of Nested Loop with Multiplication

14. Challenge 4: Nested Loop with Multiplication (Basic)

15. Solution Review: Nested Loop with Multiplication (Basic)

16. Challenge 5: Nested Loop with Multiplication (Intermediate)

17. Solution Review: Nested Loop with Multiplication (Intermediate)

18. Challenge 6: Nested Loop with Multiplication (Advanced)

19. Solution Review: Nested Loop with Multiplication (Advanced)

20. Challenge 7: Nested Loop with Multiplication (Pro)

21. Solution Review: Nested Loop with Multiplication (Pro)

22. Complexity Quiz: Test your understanding of Complexity

Sorting & Searching

1. Selection Sort, Bubble Sort, & Insertion Sort

2. Merge Sort

3. Quicksort

4. Overview of Sorting Algorithms

5. Searching Algorithms

6. Challenge 1: Find Two Numbers that Add up to "s"

7. Solution Review: Find Two Numbers that Add up to "s"

8. Challenge 2: Search in a Rotated Array

9. Solution Review: Search in a Rotated Array

10. Challenge 3: Group Anagrams

11. Solution Review: Group Anagrams

12. Challenge 4: Find the Median of Two Sorted Arrays

13. Solution Review: Find the Median of Two Sorted Arrays

14. Challenge 5: Find Duplicates in Array

15. Solution Review: Find Duplicates in Array

16. Challenge 6: Search in Sorted Matrix

17. Solution Review: Search in Sorted Matrix

18. Challenge 7: Count Element Occurrence

19. Solution Review: Count Element Occurrence

20. Challenge 8: Search Insert Position

21. Solution Review: Search Insert Position

22. Challenge 9: Sparse Search

23. Solution Review: Sparse Search

24. Challenge 10: Dutch National Flag Problem

25. Solution Review: Dutch National Flag Problem

26. Quiz on Sorting & Searching

Graph Algorithms

1. Introduction to Graph Algorithms and Implementation

2. Challenge 1: Implement Breadth First Graph Traversal

3. Solution Review: Breadth First Graph Traversal

4. Challenge 2: Implement Depth First Graph Traversal

5. Solution Review: Depth First Graph Traversal

6. Challenge 3: Calculate the Number of Nodes in a Given Graph Level

7. Solution Review: Calculate the Number of Nodes in a Given Graph Level

8. Challenge 4: Print the Transpose of a Graph

9. Solution Review: Print the Transpose of a Graph

10. Challenge 5: Print all Paths Between Two Nodes

11. Solution Review: Print all Paths Between Two Nodes

12. Challenge 6: Check If Graph is Strongly Connected

13. Solution Review: Check if a Graph is Strongly Connected

14. Challenge 7: Print all Connected Components in a Graph

15. Solution Review: Print all Connected Components of a Graph

16. Challenge 8: Check if Removing Edge Creates Components in Graph

17. Solution Review: Check if Removing Given Edge Creates Components in Graph

18. Challenge 9: Check If Given Graph is Bipartite

19. Solution Review: Check If Given Graph is Bipartite

20. Challenge 10: Topological Sorting of a Graph

21. Solution Review: Topological Sorting of a Graph

22. Quiz on Graph Algorithms

Greedy Algorithms

1. Activity Scheduling Problem

2. Challenge 1: Counting Money!

3. Solution Review: Counting Money

4. Challenge 2: Connecting n pipes with minimum cost

5. Solution Review: Connecting n pipes with minimum cost

6. Challenge 3: Find the Egyptian Fraction

7. Solution Review: Find the Egyptian Fraction

8. Challenge 4: Find Minimum Number of Platforms Required for a Train Station

9. Solution Review: Find Minimum Number of Platforms Required for a Train Station

10. Challenge 5: Help the Policemen Catch the thieves!

11. Solution Review: Help the Policemen Catch the thieves!

12. Challenge 6: Fractional Knapsack Problem

13. Solution Review: Fractional Knapsack Problem

14. Challenge 7: Largest Number with Given Number of Digits and Sum of Digits

15. Solution Review: Largest Number with Given Number of Digits and Sum of Digits

16. Challenge 8: Graph Coloring

17. Solution Review: Graph Coloring

18. Challenge 9: Find the Minimum Spanning Tree of the Given Graph

19. Solution Review: Kruskal’s Solution to Minimum Spanning Tree

20. Solution Review: Prim's Solution to Minimum Spanning Trees

21. Challenge 10: Find Shortest Distance of Each Node from the Source

22. Solution Review: Shortest Distance of Each Node from the Source

23. Quiz on Greedy Algorithms

Dynamic Programming

1. Calculating Fibonnacci Numbers

2. Introducing Dynamic Programming With Fibonacci Numbers

3. Memoizing Fibonacci Numbers

4. Tabulating Fibonacci Numbers

5. Challenge 1: The 0/1 Knapsack Problem

6. Solution Review: The 0/1 Knapsack Problem

7. Challenge 2: Staircase Problem

8. Solution Review: Staircase Problem

9. Challenge 3: The Partition Problem

10. Solution Review: The Partition Problem

11. Challenge 4: Longest Common Substring

12. Solution Review: Longest Common Substring

13. Challenge 5: Shortest Common Supersequence

14. Solution Review: Shortest Common Supersequence

15. Challenge 6: Longest Palindromic Subsequence

16. Solution Review: Longest Palindromic Subsequence

17. Challenge 7: The Coin Change Problem

18. Solution Review: Coin Change Problem

19. Challenge 8: Egg Dropping Problem

20. Solution Review: Egg Dropping Problem

21. Challenge 9: Strings Interleaving

22. Solution Review: Strings Interleaving

23. Challenge 10: Edit Distance Problem

24. Solution Review: The Edit Distance Problem

25. Quiz on Dynamic Programming

Divide and Conquer

1. Introduction to Divide and Conquer with Binary Search

2. Pascal's Triangle

3. Challenge 1: Euclidean Algorithm

4. Solution Review: Euclidean Algorithm

5. Challenge 2: Peak Element

6. Solution Review: Peak Element

7. Challenge 3: Maximum Subarray Sum

8. Solution Review: Maximum Subarray Sum

9. Challenge 4: Merge a Number of Sorted Arrays

10. Solution Review: Merge a Number of Sorted Arrays

11. Challenge 5: Collect Coins in Minimum Steps

12. Solution Review: Collect Coins in Minimum Steps

13. Challenge 6: Find The Closest Number

14. Solution Review: Find Closest Number

15. Challenge 7: Closest Pair of Points

16. Solution Review: Closest Pair of Points

17. Challenge 8: Missing Number in Sorted Array

18. Solution Review: Missing Number in Sorted Array

19. Challenge 9: Binary Search on Singly Linked List

20. Solution Review: Binary Search on Singly Linked List

21. Challenge 10: Shuffle Integers

22. Solution Review: Shuffle Integers

23. Quiz on Divide and Conquer

Appendix: Auxiliary Source Code

1. STL Classes

2. Linked List

3. Array Functions

4. Graph

Conclusion

1. Overview

2. Where to Go from Here

Similar courses

Opportunities

Make the most out of your online education

Copyright © 2021 Careertail.

All rights reserved

All rights reserved

Quick Links

Get StartedLog InAbout UsCourses

Company

BlogContactsPrivacy PolicyCookie PolicyTerms and Conditions

Stay up to date

Trustpilot

Courses>log>Algorithms for Coding Interviews in C++

Algorithms for Coding Interviews in C++

Price:Paid

Length:15 hours

Content type:text

level:intermediate

Language:English

Updated:21 August 2022

Published:15 April 2022

Similar courses

Opportunities

Courses>>Algorithms for Coding Interviews in C++

Algorithms for Coding Interviews in C++Paid

Educative English

Coderust

DescriptionWith algorithms being arguably the most common theme in coding interviews, having a firm grip on them can be the difference between being hired and not. After this comprehensive course, you'll have an in-depth understanding of different algorithm types and be equipped with a simple process for approaching complexity analysis.
As you progress, you’ll be exposed to the most important algorithms you're likely to encounter on an interview, work your way through over 50 interactive coding challenges, and review detailed solutions for each problem. You’ll walk away with the ability to build up to the optimal solution for addressing those tough coding interview questions head-on.
This course is the latest addition to our popular Interview Refresher series, which has helped developers land jobs in top companies including Google, Microsoft, and Apple.

Syllabus

Introduction

1. Who This Course Is For

2. Learning Outcomes

Algorithmic Paradigms

1. Brute Force

2. Greedy Algorithms

3. Divide and Conquer

4. Dynamic Programming

Introduction to Complexity Measures

1. Comparing Algorithms

2. Example 1: Measuring Time Complexity of a Single Loop Algorithm

3. Example 2: Time Complexity of an Algorithm With Nested Loops

4. Introduction to Asymptotic Analysis and Big O

5. Other Common Asymptotic Notations and Why Big O Trumps Them

6. Useful Formulae

7. Common Complexity Scenarios

8. Challenge 1: Big (O) of Nested Loop with Addition

9. Solution Review: Big (O) of Nested Loop with Addition

10. Challenge 2: Big (O) of Nested Loop with Subtraction

11. Solution Review: Big (O) of Nested Loop with Subtraction

12. Challenge 3: Big (O) of Nested Loop with Multiplication

13. Solution Review: Big (O) of Nested Loop with Multiplication

14. Challenge 4: Nested Loop with Multiplication (Basic)

15. Solution Review: Nested Loop with Multiplication (Basic)

16. Challenge 5: Nested Loop with Multiplication (Intermediate)

17. Solution Review: Nested Loop with Multiplication (Intermediate)

18. Challenge 6: Nested Loop with Multiplication (Advanced)

19. Solution Review: Nested Loop with Multiplication (Advanced)

20. Challenge 7: Nested Loop with Multiplication (Pro)

21. Solution Review: Nested Loop with Multiplication (Pro)

22. Complexity Quiz: Test your understanding of Complexity

Sorting & Searching

1. Selection Sort, Bubble Sort, & Insertion Sort

2. Merge Sort

3. Quicksort

4. Overview of Sorting Algorithms

5. Searching Algorithms

6. Challenge 1: Find Two Numbers that Add up to "s"

7. Solution Review: Find Two Numbers that Add up to "s"

8. Challenge 2: Search in a Rotated Array

9. Solution Review: Search in a Rotated Array

10. Challenge 3: Group Anagrams

11. Solution Review: Group Anagrams

12. Challenge 4: Find the Median of Two Sorted Arrays

13. Solution Review: Find the Median of Two Sorted Arrays

14. Challenge 5: Find Duplicates in Array

15. Solution Review: Find Duplicates in Array

16. Challenge 6: Search in Sorted Matrix

17. Solution Review: Search in Sorted Matrix

18. Challenge 7: Count Element Occurrence

19. Solution Review: Count Element Occurrence

20. Challenge 8: Search Insert Position

21. Solution Review: Search Insert Position

22. Challenge 9: Sparse Search

23. Solution Review: Sparse Search

24. Challenge 10: Dutch National Flag Problem

25. Solution Review: Dutch National Flag Problem

26. Quiz on Sorting & Searching

Graph Algorithms

1. Introduction to Graph Algorithms and Implementation

2. Challenge 1: Implement Breadth First Graph Traversal

3. Solution Review: Breadth First Graph Traversal

4. Challenge 2: Implement Depth First Graph Traversal

5. Solution Review: Depth First Graph Traversal

6. Challenge 3: Calculate the Number of Nodes in a Given Graph Level

7. Solution Review: Calculate the Number of Nodes in a Given Graph Level

8. Challenge 4: Print the Transpose of a Graph

9. Solution Review: Print the Transpose of a Graph

10. Challenge 5: Print all Paths Between Two Nodes

11. Solution Review: Print all Paths Between Two Nodes

12. Challenge 6: Check If Graph is Strongly Connected

13. Solution Review: Check if a Graph is Strongly Connected

14. Challenge 7: Print all Connected Components in a Graph

15. Solution Review: Print all Connected Components of a Graph

16. Challenge 8: Check if Removing Edge Creates Components in Graph

17. Solution Review: Check if Removing Given Edge Creates Components in Graph

18. Challenge 9: Check If Given Graph is Bipartite

19. Solution Review: Check If Given Graph is Bipartite

20. Challenge 10: Topological Sorting of a Graph

21. Solution Review: Topological Sorting of a Graph

22. Quiz on Graph Algorithms

Greedy Algorithms

1. Activity Scheduling Problem

2. Challenge 1: Counting Money!

3. Solution Review: Counting Money

4. Challenge 2: Connecting n pipes with minimum cost

5. Solution Review: Connecting n pipes with minimum cost

6. Challenge 3: Find the Egyptian Fraction

7. Solution Review: Find the Egyptian Fraction

8. Challenge 4: Find Minimum Number of Platforms Required for a Train Station

9. Solution Review: Find Minimum Number of Platforms Required for a Train Station

10. Challenge 5: Help the Policemen Catch the thieves!

11. Solution Review: Help the Policemen Catch the thieves!

12. Challenge 6: Fractional Knapsack Problem

13. Solution Review: Fractional Knapsack Problem

14. Challenge 7: Largest Number with Given Number of Digits and Sum of Digits

15. Solution Review: Largest Number with Given Number of Digits and Sum of Digits

16. Challenge 8: Graph Coloring

17. Solution Review: Graph Coloring

18. Challenge 9: Find the Minimum Spanning Tree of the Given Graph

19. Solution Review: Kruskal’s Solution to Minimum Spanning Tree

20. Solution Review: Prim's Solution to Minimum Spanning Trees

21. Challenge 10: Find Shortest Distance of Each Node from the Source

22. Solution Review: Shortest Distance of Each Node from the Source

23. Quiz on Greedy Algorithms

Dynamic Programming

1. Calculating Fibonnacci Numbers

2. Introducing Dynamic Programming With Fibonacci Numbers

3. Memoizing Fibonacci Numbers

4. Tabulating Fibonacci Numbers

5. Challenge 1: The 0/1 Knapsack Problem

6. Solution Review: The 0/1 Knapsack Problem

7. Challenge 2: Staircase Problem

8. Solution Review: Staircase Problem

9. Challenge 3: The Partition Problem

10. Solution Review: The Partition Problem

11. Challenge 4: Longest Common Substring

12. Solution Review: Longest Common Substring

13. Challenge 5: Shortest Common Supersequence

14. Solution Review: Shortest Common Supersequence

15. Challenge 6: Longest Palindromic Subsequence

16. Solution Review: Longest Palindromic Subsequence

17. Challenge 7: The Coin Change Problem

18. Solution Review: Coin Change Problem

19. Challenge 8: Egg Dropping Problem

20. Solution Review: Egg Dropping Problem

21. Challenge 9: Strings Interleaving

22. Solution Review: Strings Interleaving

23. Challenge 10: Edit Distance Problem

24. Solution Review: The Edit Distance Problem

25. Quiz on Dynamic Programming

Divide and Conquer

1. Introduction to Divide and Conquer with Binary Search

2. Pascal's Triangle

3. Challenge 1: Euclidean Algorithm

4. Solution Review: Euclidean Algorithm

5. Challenge 2: Peak Element

6. Solution Review: Peak Element

7. Challenge 3: Maximum Subarray Sum

8. Solution Review: Maximum Subarray Sum

9. Challenge 4: Merge a Number of Sorted Arrays

10. Solution Review: Merge a Number of Sorted Arrays

11. Challenge 5: Collect Coins in Minimum Steps

12. Solution Review: Collect Coins in Minimum Steps

13. Challenge 6: Find The Closest Number

14. Solution Review: Find Closest Number

15. Challenge 7: Closest Pair of Points

16. Solution Review: Closest Pair of Points

17. Challenge 8: Missing Number in Sorted Array

18. Solution Review: Missing Number in Sorted Array

19. Challenge 9: Binary Search on Singly Linked List

20. Solution Review: Binary Search on Singly Linked List

21. Challenge 10: Shuffle Integers

22. Solution Review: Shuffle Integers

23. Quiz on Divide and Conquer

Appendix: Auxiliary Source Code

1. STL Classes

2. Linked List

3. Array Functions

4. Graph

Conclusion

1. Overview

2. Where to Go from Here

Similar courses

Opportunities

Make the most out of your online education

Copyright © 2021 Careertail.

All rights reserved

All rights reserved

Quick Links

Get StartedLog InAbout UsCourses

Company

BlogContactsPrivacy PolicyCookie PolicyTerms and Conditions

Stay up to date

Trustpilot