C++ Data Structures & Algorithms + LEETCODE Exercises

Course Name : C++ Data Structures & Algorithms + LEETCODE Exercises
Students : 11,898
Duration : 9.5 hrs & 111 downloadable resources
Avg Rating : 4.8 (1,771 ratings)
Original Price : $119.99
Discount Price : $14
Instructor / Provider : Udemy
Course Type : Self Paced Online Course. Lifetime Access
Coupon : Click on ENROLL NOW to apply discount code

You’ll Learn How to

• 96 Coding Exercises: Solve detailed coding exercises with comprehensive explanations.
• Accelerated Learning with Visuals: Learn data structures and algorithms faster through animated examples.
• Master Data Structures and Algorithms: Build a solid foundation in core DSA concepts.
• Ace Technical Interviews: Gain the confidence to answer challenging technical interview questions.
• Understand Complexity: Learn time and space complexity for various data structures and algorithms.
• Enhance Your Developer Skills: Strengthen your coding abilities and problem-solving skills.

Frequently Bought Together

Topics Covered

Foundational Concepts

• Big O Notation: Understand how to analyze the efficiency of algorithms.

Data Structures

• Arrays: Learn how to store and manipulate linear collections of data.
• Vectors: Dive into dynamic arrays with resizable capabilities.
• Linked Lists: Understand singly linked lists and their applications.
• Doubly Linked Lists: Explore linked lists with forward and backward traversal.
• Stacks & Queues: Implement and use these fundamental data structures.
• Binary Trees: Master tree-based data structures for hierarchical data.
• Hash Tables: Learn efficient key-value data storage techniques.
• Graphs: Represent and traverse relationships between data points.

Algorithms

Sorting

• Bubble Sort: Understand this simple comparison-based sorting algorithm.
• Selection Sort: Learn how to sort by selecting the smallest element.
• Insertion Sort: Master inserting elements into their correct position.
• Merge Sort: Dive into this efficient, divide-and-conquer sorting algorithm.
• Quick Sort: Implement one of the fastest sorting techniques.

Searching

• Breadth-First Search (BFS): Traverse graphs layer by layer.
• Depth-First Search (DFS): Explore graphs deeply along each branch.

FAQs on Udemy Coupon