UTMT Learn to Build AI Products

Home Projects Learning Curiosity Park

Data Structures & Algorithms

Before starting to learn Algorithms, make sure you have a good hold of basic Python Programming.

What is binary search?

Intro to Sorting Algos Bubble Sort Insertion Sort Selection Sort

Recursion Basics

Dynamic Programming Playlist

Asymptotic Notation Time Complexity Example Time Complexity Playlist Space Complexity

Stack Concept and Example Queue Basics Queue and its Python Implementation

Linked List Concept Linked List Python Implementation

Heaps & Priority Queues in Python Heaps Basics Stacks & Heaps in Memory

Merge Sort How can we multiply large integers quickly? (Karatsuba algorithm) Strassen algorithm for matrix multiplication

Intro to Trees Binary Tree Find Height of a Binary Tree Intro to Graphs

Binary Search Trees Understanding B-Trees Red Black Trees

Implementing Hash Tables using Dictionary HashMaps in Python

Breadth First Search (BFS): Visualized and Explained Depth First Search (DFS) Explained BFS and DFS for Binary Tree

Dijkstra's Algo

Heaps & Priority Queues in Python

Resources

No additional resources for this lesson.

"Empowering builders to architect the neural future."

UTMT

An institution dedicated to the fusion of ancient wisdom and modern artificial intelligence, empowering the next generation of builders.

Contact Us

© 2024 UTMT SYSTEMS. ALL RIGHTS RESERVED.

Built for the Neural Age Version 4.0.2