× Successfully! Added to wish list

From 0 to 1: Data Structures & Algorithms in Java

By: Loonycorn A 4-Ppl Team;ex-Google.

  • 5
  • (9)
  • 12:38:45
  • 83
  • 29
  • Language: English

Course Summary

This is an animated, visual and spatial way to learn data structures and algorithms

  • Our brains process different types of information differently - evolutionarily we are wired to absorb information best when it is visual and spatial i.e. when we can

Read More

Target Audience

  • Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work
  • Yep! Experienced software engineers who are looking to refresh important fundamental concepts

Pre-Requisites

Basic knowledge of programming is assumed, preferably in Java

Curriculum

  • You, This course and Us
    02:09
  • Download for sec 2
  • Why are Data Structures And Algorithms important?
    15:05
  • Download for sec 3
  • Performance and Complexity
    16:02
  • The Big-O Notation
    16:47
  • What is the complexity of these pieces of code?
    19:14
  • Download for sec 4
  • The Linked List - The Most Basic Of All Data Structures
    17:17
  • Linked List Problems
    09:05
  • Linked Lists vs Arrays
    10:27
  • Download for sec 5
  • Meet The Stack - Simple But Powerful
  • Building A Stack Using Java
    16:54
  • Match Parenthesis To Check A Well Formed Expression
    11:22
  • Find The Minimum Element In A Stack In Constant Time
  • Meet The Queue - A Familiar Sight In Everyday Life
    14:11
  • The Circular Queue - Tricky But Fast
    19:45
  • Build A Queue With Two Stacks
    17:30
  • Download for sec 6
  • Sorting Trade-Offs
    10:53
  • Selection Sort
    15:25
  • Bubble Sort
    14:42
  • Insertion Sort
    14:32
  • Shell Sort
    14:25
  • Merge Sort
    19:23
  • Quick Sort
    15:30
  • Binary Search - search quickly through a sorted list
    11:35
  • Download for sec 7
  • Meet The Binary Tree - A Hierarchical Data Structure
    13:04
  • Breadth First Traversal
    18:43
  • Depth First - Pre-OrderTraversal
    14:35
  • Depth First - In-Order and Post-Order Traversal
    13:52
  • Download for sec 8
  • The Binary Search Tree - an introduction
    09:50
  • Insertion and Lookup in a Binary Search Tree
    17:00
  • Download for sec 9
    00:00
  • Minimum Value, Maximum Depth And Mirror
    12:14
  • Count Trees, Print Range and Is BST
    14:39
  • Download for sec 10
    00:00
  • The Heap Is Just The Best Way to Implement a Priority Queue
    00:00
  • Meet The Binary Heap - It's A Tree At Heart
    12:40
  • The Binary Heap - Logically A Tree Really An Array
    17:14
  • The Binary Heap - Making It Real With Code
    00:00
  • Heapify!
    19:33
  • Insert And Remove From A Heap
    16:35
  • Download for sec 11
    00:00
  • Heap Sort Phase I - Heapify
    19:32
  • Heap Sort Phase II - The Actual Sort
    17:43
  • Download for sec 12
    00:00
  • Maximum Element In A Minimum Heap and K Largest Elements In A Stream
    00:00
  • Download for sec 13
    00:00
  • Introducing The Graph
    15:41
  • Types Of Graphs
    07:21
  • The Directed And Undirected Graph
    14:30
  • Representing A Graph In Code
    08:09
  • Graph Using An Adjacency Matrix
    00:00
  • Graph Using An Adjacency List And Adjacency Set
    00:00
  • Comparison Of Graph Representations
    00:00
  • Graph Traversal - Depth First And Breadth First
    00:00
  • Download for sec 14
    00:00
  • Topological Sort In A Graph
    17:31
  • Implementation Of Topological Sort
    06:57
  • Download for sec 15
    00:00
  • Introduction To Shortest Path In An Unweighted Graph - The Distance Table
    12:39
  • The Shortest Path Algorithm Visualized
    14:15
  • Implementation Of The Shortest Path In An Unweighted Graph
    06:19
  • Introduction To The Weighted Graph
    03:29
  • Shortest Path In A Weighted Graph - A Greedy Algorithm
    18:47
  • Dijkstra's Algorithm Visualized
    14:15
  • Implementation Of Dijkstra's Algorithm
    08:15
  • Introduction To The Bellman Ford Algorithm
    08:40
  • The Bellman Ford Algorithm Visualized
    11:23
  • Dealing With Negative Cycles In The Bellman Ford Algorithm
    07:36
  • Implementation Of The Bellman Ford Algorithm
    06:54
  • Download for sec 16
    00:00
  • Prim's Algorithm For a Minimal Spanning Tree
    17:27
  • Use Cases And Implementation Of Prim's Algorithm
    09:52
  • Kruskal's Algorithm For a Minimal Spanning Tree
    08:43
  • Implementation Of Kruskal's Algorithm
    07:34
  • Download for sec 17
    00:00
  • Design A Course Schedule Considering Pre-reqs For Courses
    13:02
  • Find The Shortest Path In A Weighted Graphs - Fewer Edges Better
    00:00

About the Author

Loonycorn A 4-Ppl Team;ex-Google.,

Loonycorn is us, Janani Ravi, Vitthal Srinivasan, Swetha Kolalapudi and Navdeep Singh. Between the four of us, we have studied at Stanford, IIM Ahmedabad, the IITs and have spent years (decades, actually) working in tech, in the Bay Area, New York, Singapore and Bangalore. Janani: 7 years at Google (New York, Singapore); Studied at Stanford; also worked at Flipkart and Microsoft Vitthal: Also Google (Singapore) and studied at Stanford; Flipkart, Credit Suisse and INSEAD too Swetha: Early Flipkart employee, IIM Ahmedabad and IIT Madras alum Navdeep: longtime Flipkart employee too, and IIT Guwahati alum We think we might have hit upon a neat way of teaching complicated tech courses in a funny, practical, engaging way, which is why we are so excited to be here on Unanth! We hope you will try our offerings, and think you'll like them :-)

More From Author

Reviews

Vaishnavi Shukla
5

The content was great and the explanations make it easy to understand!cou

From 0 to 1: Data Structures & Algorithms in Java

  • 12:38:45
  • 83
  • 29
  • Language: English
  • 15 days Money back Gurantee
  • Unlimited Access
  • Android, iPhone and iPad Access
  • Certificate of Completion

Course Summary

This is an animated, visual and spatial way to learn data structures and algorithms

  • Our brains process different types of information differently - evolutionarily we are wired to absorb information best when it is visual and spatial i.e. when we can

Read More

Target Audience

  • Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work
  • Yep! Experienced software engineers who are looking to refresh important fundamental concepts

Pre-Requisites

  • Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work
  • Yep! Experienced software engineers who are looking to refresh important fundamental concepts

About the Author

Loonycorn A 4-Ppl Team;ex-Google.,

Loonycorn is us, Janani Ravi, Vitthal Srinivasan, Swetha Kolalapudi and Navdeep Singh. Between the four of us, we have studied at Stanford, IIM Ahmedabad, the IITs and have spent years (decades, actually) working in tech, in the Bay Area, New York, Singapore and Bangalore. Janani: 7 years at Google (New York, Singapore); Studied at Stanford; also worked at Flipkart and Microsoft Vitthal: Also Google (Singapore) and studied at Stanford; Flipkart, Credit Suisse and INSEAD too Swetha: Early Flipkart employee, IIM Ahmedabad and IIT Madras alum Navdeep: longtime Flipkart employee too, and IIT Guwahati alum We think we might have hit upon a neat way of teaching complicated tech courses in a funny, practical, engaging way, which is why we are so excited to be here on Unanth! We hope you will try our offerings, and think you'll like them :-)

More From Author

Review & Rating

Vaishnavi Shukla 5

The content was great and the explanations make it easy to understand!cou