With the knowledge of data structures and algorithms at your fingertips, you can write efficient computer programs to solve real-world problems. This course will help you to get up and running with data structures and algorithms in no time.
The course starts by explaining the concepts of complexity analysis and big O notation. Next, you will become familiar with the concepts of memory and logarithms. Moving along, you will get a solid understanding of data structure concepts, such as arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs. Next, you will understand what recursion is and get to grips with a variety of basic and advanced algorithms, such as searching, sorting elementary, sorting advanced, tree traversal, and graph traversal. Towards the end, you will go through a set of interview questions that will enhance your knowledge of data structures and algorithms and prepare you for job interviews.
By the end of this course, you will have gained exceptional knowledge of data structure and algorithms and will have developed skills to apply in the real world.
Discover how to design a linked list
Distinguish between static and dynamic array
Grasp the steps to construct a binary tree
Understand the concepts of a call stack and tree recursion
Discover the role of searching and sorting algorithms
Find the solution to the longest palindrome substring