Master Data Structures and Algorithms in Python from Udemy

What's inside

Learning objectives

Advance data structure and algorithms in python : arrays, linked lists, stacks, queues, trees, and graphs
Building a strong foundation in computer science fundamentals for efficient problem-solving
Analyzing time and space complexity of algorithms for efficiency

Algorithm design techniques: divide and conquer, dynamic programming, and greedy algorithms
Using algorithmic paradigms such as brute force, backtracking, and heuristics to solve problems efficiently.

Advance data structure and algorithms in python : arrays, linked lists, stacks, queues, trees, and graphs
Building a strong foundation in computer science fundamentals for efficient problem-solving
Analyzing time and space complexity of algorithms for efficiency
Algorithm design techniques: divide and conquer, dynamic programming, and greedy algorithms
Using algorithmic paradigms such as brute force, backtracking, and heuristics to solve problems efficiently.

Syllabus

Array problems solving techniques with examples

Time Complexity and Space Complexity Introduction

Searching Algorithms Introduction & Implementation

Merge Sort

We rotate an ascending order sorted array at some point unknown to user. So for instance, 3 4 5 6 7 might become 5 6 7 3 4. Modify binary search algorithm to find an element in the rotated array in O(log n) time and O(1) Space complexity.

Array consist of only 0's, 1's and 2's. Write an algorithm to sort this array in O(n) time complexity and O(1) Space complexity with only one traversal Asked in : : Amazon, Microsoft, Adobe, WalmartLabs

You are given a matrix of m x n elements (m rows, n columns), Print all elements of the matrix in spiral order in O(m*n) Time Complexity and O(1) Space Complexity Asked in: Microsoft, OLA, PayTm, Oracle

Array of length n having integers 1 to n with some elements being repeated. Count frequencies of all elements from 1 to n in Time Complexity O(n) and Space Complexity O(1) Asked in : : PayTm, VmWare, Amazon

String is given as input that contains only lowercase letters, remove duplicate letters so that every letter appears once In O(n) Time Complexity and O(1) Space Complexity

Traversal scheme is core Concept of BT. Almost all the problems of Binary tree involves the complete understanding of traversal process.

Convert BT to DLL such that the left pointer of the node should be pointing to the previous node in the doubly linked list, and the right pointer should be pointing to the next node in the doubly linked list in Time Complexity O(n) and Space O(Height) Asked in : Amazon, Microsoft, Flipkart, WalmartLabs

Print all the boundary nodes in the binary tree.Boundary includes left boundary, leaves, and right boundary in anti clockwise direction in O(n) Time Complexity Asked in : Flipkart, OLA, InMobi

The diameter of a binary tree is the length of the longest path between any two nodes in a tree. Find diameter of tree in Time Complexity O(n) Asked in : Flipkart, Amazon, Microsoft, Facebook, Intuit, Broadcom

Print all the nodes which are at k distance from the root. Root of the Binary tree and K is given as Input in Time Complexity O(n) Asked in : Uber, Flipkart, Samsung

This is a bit complex problem from previous problem. Now you need print all the nodes k distance from any random node in the tree in Time Complexity O(n) and Space Complexity O(n) Asked in : Google, Amazon, Facebook

Given a binary tree, print the values of nodes which would be present in bottom of view of binary tree Asked in : Paypal, Amazon, Paytm

Given a binary tree, print its nodes level by level in spiral order in Time and Space Complexity O(n) Asked in : Adobe, J P Morgan, Flipkart

Printing the left view of a binary tree involves printing the left-most node, at each level, in the binary tree In Time Complexity O(n) and Space Complexity O(n) Asked in : Amazon, EMC2, SAP-Labs

Algorithm to print Binary Tree nodes level by level in reverse order. It means all the nodes at the last level should be printed first followed by the nodes of second last level and so on in Time Complexity O(n) and Space Complexity O(n) and Asked in: Sap Labs, Cisco

Design an algorithm and write code to serialize and deserialize a binary tree. Writing the tree to a file is called 'serialization' and reading back from the file to reconstruct the exact same binary tree is 'deserialization' in Time and Space Complexity O(n) Asked in : Microsoft, Qualcomm, J P morgan, Sandisk

Add number linked list

Segregate even and odd nodes in a Linked List

Linked list is given also, in addition to the next reference, each node has a child pointer that can point to a separate list. With the head node, flatten the list to a single-level linked list in Time Complexity O(n) Asked in : Linkedin, Yahoo, Microsoft

Given the head of a singly linked list, return true if it is a palindrome or false otherwise.

Given Pointer/Reference to the head of the linked list, the task is to Sort the given linked list using Merge Sort.

Rearrange a Single Linked List in Time Complexity O(n) and Space Complexity O(1) such one node selected from start next node from end Asked in : Amazon, Google

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list in Time Complexity O(n) .Asked in : Cisco, Inmobi, Broadcom, OLA, Expedia

Min/Max Heap Implementation

Basic Introduction lecture of heap and heap operations

Given that integers are being read from a data stream. Find median of all the elements read so far starting from the first integer till the last integer. The data stream can be any source of data, example: a file, an array of integers etc Asked in : Google, Amazon, Flipkart, SapLabs, WalmartLabs

Given an array of strings, return all groups of strings that are anagrams Asked in : Snapdeal, MakeMyTrip

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get(key)and set(key,value) Asked in : Facebook, WalmartLabs, Yatra, Makemytrip

find an arrangement of N queens on a chess board, such that no queen can attack any other queens on the board. The chess queens can attack in any direction as horizontal, vertical, horizontal and diagonal way [Asked in : VISA, Intuit]

You are given a string and you are supposed to print all the distinct permutations of the string Asked in : Apple, Cisco, Samsung

Given a keypad as shown in the diagram, and an n digit number, list all words which are possible by pressing these numbers.

Given an integer x and a positive number n, write a efficient algorithm to computes x^n Asked in : Flipkart, WalmartLabs

Given a maze, NxN matrix.matrix[0][0] (left top corner)is the source and matrix[N-1][N-1](right bottom corner) is destination. There are few cells which are blocked, means rat cannot enter into those cells. Rat can move in direction ( forward,down). A rat has to find a path from source to destination Asked in : MakeMyTrip, Yatra, Expedia

[part-2] Given a sudoku puzzle, solve this sudoko puzzle by using backtracking algorithm

You receive a list of non-empty words from the dictionary, where words are sorted lexicographically by the rules of this new language. Derive the order of letters in this language.

There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1] Given the total number of courses and a list of prerequisite pairs, is it possible for you to finish all courses? Desired Time Complexity : O(n) Asked in : Adobe, WalmartLabs, Google

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands in Time Complexity O(Vertices + Edges) . Asked in : Citrix, Informatica, Expedia

A matrix of m*n where each cell in the matrix have Fresh,Rotten and Empty Cell. Write algorithm to find minimum time required so that all the oranges become rotten in Time Complexity O(m*n) and Space Complexity O*m*n) i.e extra matrix space Asked in : Microsoft, Amazon, Expedia

Snake and ladder board is given as matrix, find the minimum number of dice throws required to reach the last cell from source cell in Space Complexity O(n) Asked in : Amazon, Flipkart

Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all possible paths from node 0 to node n - 1 and return them in any order.

The topological sort algorithm takes a directed graph and returns an array of the nodes where each node appears before all the nodes it points to. Asked in : Accolite, Flipkart

Trie is the data structure very similar to Binary Tree. Trie data structure stores the data in particular fashion, so that retrieval of data became much faster and helps in performance Asked in : NetApp, Intuit, Oracle

As part of this community, take advantage of discounts on products and services

that can help you with your career and personal goals.

Traffic lights

Read about what's good

what should give you pause

and possible dealbreakers

Covers data structures and algorithms, which are fundamental for software development and commonly tested in technical interviews at top tech companies

Explores algorithm design techniques like divide and conquer and dynamic programming, which are essential for optimizing software performance and solving complex problems

Includes a bonus section with discounts on products and services, potentially aiding career advancement and personal development for students

Focuses on implementing data structures and algorithms in Python, which is useful for Python developers seeking to improve their problem-solving skills

Requires familiarity with arrays, which may pose a challenge for learners without prior experience in data structures or programming fundamentals

Teaches time and space complexity analysis, which is crucial for evaluating algorithm efficiency and optimizing code for performance in real-world applications

Reviews summary

Mastering data structures and algorithms in python for interviews

According to students, this course provides a solid foundation specifically geared towards technical interviews. Many learners found the explanations of complex data structures and algorithms to be clear and understandable due to the instructor's teaching style. The inclusion of coding problems relevant to top tech companies was highlighted as a major strength and extremely helpful for interview preparation. However, some learners felt that the course could benefit from more in-depth coverage on certain advanced topics and that the quantity or variety of practice problems might be limited for those seeking extensive hands-on experience beyond the provided examples. Older reviews mentioned minor technical issues like audio quality, though recent reviews suggest these may have been addressed.

Problems help solidify understanding and application.

"The coding exercises provided were essential for practicing what I learned in the lectures."

"I liked that the problems were similar to those asked in real companies."

"The hands-on examples were practical and helped me understand how to implement the algorithms."

"Solving the problems after each section really reinforced the material for me."

Concepts are generally explained with clarity.

"The way the instructor explained recursion was the best I've ever encountered. Very clear and intuitive."

"Most topics were presented clearly, making it easy to follow along even for difficult subjects."

"I appreciate how the course simplified complex ideas like dynamic programming."

"The explanations helped me finally understand time and space complexity analysis."

Highly relevant for technical interview preparation.

"This course was a game changer for my interview prep. The problems mirrored what I saw in actual interviews."

"It's clearly designed for job seekers targeting tech companies. The focus on common interview questions is invaluable."

"The instructor breaks down complex concepts in a way that makes them easy to apply to interview problems."

"I felt much more confident tackling coding challenges after completing this course, specifically for interviews."

Some report minor issues, possibly resolved.

"Some early videos had audio quality issues, which was a bit distracting."

"I noticed a few errors in the provided code snippets."

"The video production quality could be improved in certain sections."

"A few times, the code in the lecture didn't match the downloadable files."

May need supplementary study for advanced topics.

"While great for fundamentals, I felt some advanced topics weren't covered in sufficient depth."

"For someone looking for a deep dive into competitive programming, this might not be enough."

"I needed to find external resources to fully grasp some of the more complex algorithms."

"Good overview, but lacks the deep exploration needed for true mastery of all topics."

Activities

Be better prepared before your course. Deepen your understanding during and after it. Supplement your coursework and achieve mastery of the topics covered in Master Data Structures and Algorithms in Python with these activities:

Review Array Fundamentals

Show steps

Solidify your understanding of array fundamentals before diving into more complex array problems.

Browse courses on Arrays

Show steps

Review array concepts like indexing, slicing, and common operations.
Practice basic array manipulation exercises.

Grokking Algorithms

Show steps

Use a visually engaging book to reinforce your understanding of algorithms.

View Grokking Algorithms, Second Edition on Amazon

Show steps

Read chapters related to the course topics.
Focus on the illustrations and examples to understand the concepts.

Introduction to Algorithms, 3rd Edition

Show steps

Supplement your learning with a comprehensive algorithms textbook.

View Algorithms Unlocked (Mit Press) on Amazon

Show steps

Read relevant chapters on data structures and algorithms covered in the course.
Work through examples and exercises in the book.

Four other activities

Expand to see all activities and additional details

Show all seven activities

Implement Basic Data Structures

Show steps

Reinforce your understanding of data structures by implementing them from scratch.

Show steps

Implement a linked list with basic operations.
Implement a stack and a queue using arrays or linked lists.
Test your implementations thoroughly.

Pair Programming on Graph Algorithms

Show steps

Improve your understanding of graph algorithms by working collaboratively with a peer.

Show steps

Find a partner who is also taking the course.
Choose a graph algorithm (e.g., Dijkstra's, BFS, DFS).
Work together to implement the algorithm in Python.
Test your implementation on various graph examples.

Create a Blog Post on Dynamic Programming

Show steps

Solidify your understanding of dynamic programming by explaining it to others.

Show steps

Choose a specific dynamic programming problem or technique.
Research the topic thoroughly and gather examples.
Write a clear and concise blog post explaining the concept.
Include code examples in Python.

Build a Simple Search Algorithm Visualizer

Show steps

Apply your knowledge of search algorithms by creating a visual representation of their execution.

Show steps

Choose a search algorithm (e.g., binary search, linear search).
Implement the algorithm in Python.
Use a library like Pygame or Tkinter to create a visual interface.
Visualize the algorithm's steps as it searches through data.

Career center

Learners who complete Master Data Structures and Algorithms in Python will develop knowledge and skills that may be useful to these careers:

Software Engineer

A software engineer designs, develops, tests, and evaluates software applications and systems. This course helps build a foundation in data structures and algorithms, which are essential for writing efficient and scalable code. The focus on Python also aligns with the common use of Python in software development. Success as a software engineer depends on problem solving skills and efficiency, which are addressed in this course. You may be well-equipped for the technical interviews at top tech companies, as they often focus on data structures and algorithms. As a software engineer, familiarity with topics covered in this course such as searching and sorting algorithms will be incredibly useful.

See salaries and explore the career path for Software Engineer

Data Scientist

Data scientists analyze large datasets to extract meaningful insights and develop data-driven solutions. This course provides a strong foundation in data structures and algorithms, critical for efficiently processing and analyzing data. The course covers data abstraction, which leads to more effective data processing. A data scientist utilizes algorithm design techniques when creating solutions. Data scientists should take this course to advance their careers. Furthermore, the Python emphasis nicely complements the use of Python in data science.

See salaries and explore the career path for Data Scientist

Machine Learning Engineer

A machine learning engineer develops and deploys machine learning models. They require a deep understanding of algorithms and data structures to optimize model performance and scalability. The course's focus on algorithm design techniques, such as dynamic programming and greedy algorithms, is directly applicable to optimizing machine learning models. The course's discussions on time and space complexity are important for optimizing performance too. Machine learning engineers should take this course to improve and advance their careers. A machine learning engineer will want to explore the topics covered in this course like graph algorithms.

See salaries and explore the career path for Machine Learning Engineer

Algorithm Developer

Algorithm developers create and implement algorithms for various applications, such as search engines, recommendation systems, and financial modeling. The course's deep dive into algorithm design techniques, complexity analysis, and algorithmic paradigms are directly relevant to the work of an algorithm developer. This course will assist an algorithm developer in their career growth. You may find the sections on sorting, searching, and graph traversal will be useful for this role. Anyone who wishes to apply for this job may find this course will help them ace it.

See salaries and explore the career path for Algorithm Developer

Data Engineer

Data engineers are responsible for building and maintaining the infrastructure that supports data storage, processing, and analysis. This course on data structures and algorithms provides key information for optimizing data pipelines and ensuring efficient data processing. The course's coverage of data structures like trees and graphs helps improve data organization and retrieval. A data engineer will greatly benefit from the industry-relevant skills taught in this course. The topics covered in this course, such as the discussion of time and space complexity, will be very useful to the data engineer.

See salaries and explore the career path for Data Engineer

Backend Developer

Backend developers create the server-side logic and databases that power web applications. This course is relevant to backend developers because data structures and algorithms are vital for building scalable and efficient backend systems. The course covers relevant topics such as linked lists and other data structures that can improve backend performance. Backend developers often need to analyze the efficiency of their code, and so the subject of time and space complexity will be relevant, too. The problem-solving skills that this course promotes are essential.

See salaries and explore the career path for Backend Developer

Full-Stack Developer

Full stack developers work on both the front-end and back-end of web applications. This course provides valuable knowledge for optimizing the back-end, which involves data structures and algorithms. Full stack developers often need to be able to quickly solve problems, which this course helps with. A full stack developer should take this course to improve their understanding of the full tech stack. Full stack developers can use the techniques taught in this course, such as working with arrays and binary trees, to solve real-world problems.

See salaries and explore the career path for Full-Stack Developer

Quantitative Analyst

Quantitative analysts, often requiring a master's degree or Phd, use mathematical and statistical models to solve problems in finance, such as risk management and trading strategy. The use of algorithms and data structures is essential for building these models. For the quantitative analyst, the course's coverage of algorithmic paradigms such as dynamic programming may be beneficial. The problem-solving skills taught in this course will be useful to quantitative analysts as well. The focus on efficient algorithms is a particular strength.

See salaries and explore the career path for Quantitative Analyst

Game Developer

Game developers design and develop video games, which often require efficient algorithms and data structures for handling game logic, artificial intelligence, and rendering. The course's coverage of data structures like trees and graphs may be valuable for representing game worlds and relationships between game objects. A game developer should consider this course to improve their background in computer science fundamentals. The topics in this course, such as the coverage of traversal algorithms, may be useful for building sophisticated game play.

See salaries and explore the career path for Game Developer

Database Administrator

Database administrators are responsible for managing and maintaining databases, ensuring data integrity, security, and performance. A course like this may help database administrators understand how data structures and algorithms affect database performance. The coverage of data structures like trees and graphs is applicable to database indexing and optimization. A database administrator hoping to stand out from other candidates may want to take this course. This course may be useful for understanding database internals and query optimization.

See salaries and explore the career path for Database Administrator

Research Scientist

Research scientists, often requiring a master's degree or Phd, conduct research in various fields, sometimes involving the development of new algorithms and data structures. The course's coverage of data abstraction and complexity theory may aid a research scientist in their career. A research scientist should consider this course, as it helps establish a strong foundation. The topics covered in this course, such as algorithm design techniques, may be applicable to scientific problem-solving.

See salaries and explore the career path for Research Scientist

Technical Consultant

Technical consultants advise clients on technology solutions, often requiring a solid understanding of algorithms and data structures. The course's problem-solving skills and coverage of algorithmic paradigms, such as divide and conquer, are relevant to identifying and implementing effective solutions. This course may provide a consultant with a competitive edge. As a technical consultant, you may find the material on backtracking and heuristics to be especially useful.

See salaries and explore the career path for Technical Consultant

Systems Analyst

Systems analysts analyze an organization's computer systems and procedures, making recommendations for improvements. A systems analyst must have a basic knowledge of how data structures and algorithms relate to the performance of those systems. The problem-solving skills taught in this course may aid in making sound decisions. Systems analysts may find that this course will help them to advance their careers. This course may be useful for understanding system performance bottlenecks.

See salaries and explore the career path for Systems Analyst

IT Manager

IT managers oversee the technology infrastructure and projects within an organization. They may not need to implement algorithms directly, but understanding the fundamentals of data structures and algorithms helps them make informed decisions about technology investments and project management. IT managers may find this course useful for overseeing software development projects. Concepts such as complexity theory may be useful to an IT manager. An IT manager should consider this course.

See salaries and explore the career path for IT Manager

Technical Writer

Technical writers create documentation and tutorials for software and hardware products. While this role doesn't involve direct implementation of algorithms, understanding the underlying concepts of data structures and algorithms helps them explain technical concepts more clearly and accurately. A technical writer needs to be able to understand technical material as it is presented to them. A technical writer should consider this course. As a technical writer, you may find the array problems covered in this course to be especially useful.

See salaries and explore the career path for Technical Writer

Master Data Structures and Algorithms in Python

What's inside

Learning objectives

Syllabus

Traffic lights

Save this course

Reviews summary

Mastering data structures and algorithms in python for interviews

Activities

Career center

Reading list

Share

Similar courses