Complete Java Programming Bootcamp

7 Reviews
3558 Enrolled
10 Courses & 82 Hours
Price Drop - Extra 26% off
Save 96% -

What's Included

From 0 to 1: Data Structures & Algorithms in Java
  • Experience level required: All levels
  • Access 66 lectures & 11 hours of content 24/7
  • Length of time users can access this course: Lifetime

Course Curriculum

66 Lessons (11h)

  • What this course is about
    You, This course and Us
  • Data Structures And Algorithms - A Symbiotic Relationship
    Why are Data Structures And Algorithms important?
  • Complexity Analysis and the Big-O Notation
    Performance and Complexity
    The Big-O Notation
    What is the complexity of these pieces of code?
  • Linked Lists
    Linked Lists - The most basic of all data structures
    Linked List Problems
    Linked Lists vs Arrays
  • Stacks And Queues
    Meet The Stack - Simple But Powerful
    Building A Stack Using Java
    Match Parenthesis To Check A Well Formed Expression
    Find The Minimum Element In A Stack In Constant Time
    Meet The Queue - A Familiar Sight In Everyday Life
    The Circular Queue - Tricky But Fast
    Build A Queue With Two Stacks
  • Sorting and Searching
    Sorting Trade-Offs
    Selection Sort
    Bubble Sort
    Insertion Sort
    Shell Sort
    Merge Sort
    Quick Sort
    Binary Search - search quickly through a sorted list
  • Binary Trees
    Meet The Binary Tree - A Hierarchical Data Structure
    Breadth First Traversal
    Depth First - Pre-OrderTraversal
    Depth First - In-Order and Post-Order Traversal
  • Binary Search Trees
    The Binary Search Tree - an introduction
    Insertion and Lookup in a Binary Search Tree
  • Binary Tree Problems
    Minimum Value, Maximum Depth and Mirror
    Count Trees, Print Range and Is BST
  • Heaps
    The Heap Is Just The Best Way to Implement a Priority Queue
    Meet The Binary Heap - It's A Tree At Heart
    The Binary Heap - Logically A Tree Really An Array
    The Binary Heap - Making It Real With Code
    Insert And Remove From A Heap
  • Revisiting Sorting - The Heap Sort
    Heap Sort Phase I - Heapify
    Heap Sort Phase II - The Actual Sort
  • Heap Problems
    Maximum Element In A Minimum Heap and K Largest Elements In A Stream
  • Graphs
    Introducing The Graph
    Types Of Graphs
    The Directed And Undirected Graph
    Representing A Graph In Code
    Graph Using An Adjacency Matrix
    Graph Using An Adjacency List And Adjacency Set
    Comparison Of Graph Representations
    Graph Traversal - Depth First And Breadth First
  • Graph Algorithms
    Topological Sort In A Graph
    Implementation Of Topological Sort
  • Shortest Path Algorithms
    Introduction To Shortest Path In An Unweighted Graph - The Distance Table
    The Shortest Path Algorithm Visualized
    Implementation Of The Shortest Path In An Unweighted Graph
    Introduction To The Weighted Graph
    Shortest Path In A Weighted Graph - A Greedy Algorithm
    Dijkstra's Algorithm Visualized
    Implementation Of Dijkstra's Algorithm
    Introduction To The Bellman Ford Algorithm
    The Bellman Ford Algorithm Visualized
    Dealing With Negative Cycles In The Bellman Ford Algorithm
    Implementation Of The Bellman Ford Algorithm
  • Spanning Tree Algorithms
    Prim's Algorithm For a Minimal Spanning Tree
    Kruskal's Algorithm For a Minimal Spanning Tree
    Implementation Of Kruskal's Algorithm
  • Graph Problems
    Design A Course Schedule Considering Pre-reqs For Courses
    Find The Shortest Path In A Weighted Graphs - Fewer Edges Better

From 0 to 1: Data Structures & Algorithms in Java


Loonycorn is comprised of four individuals—Janani Ravi, Vitthal Srinivasan, Swetha Kolalapudi and Navdeep Singh—who have honed their tech expertises at Google and Flipkart. The team believes it has distilled the instruction of complicated tech concepts into funny, practical, engaging courses, and is excited to be sharing its content with eager students. For more details on the course and instructor, click here. This course is hosted by StackSkills, the premier eLearning destination for discovering top-shelf courses on everything from coding—to business—to fitness, and beyond!


Data structures and algorithms? They're standard Computer Science 101 topics, and ones you'll master in this course. You'll learn how common data structures organize information so it can be used efficiently, how algorithms work to manipulate this data, and more. Though this course is tailored to the Java programming language, you'll emerge from it with a deep understanding of how any computer program works.
  • Master data structures & algorithms w/ 11 hours of content
  • Visualize common data structures & the algorithms applied to them
  • Identify & apply which data structure or algorithm is optimal for a particular situation
  • Calculate the time & space complexity of code
  • Use the Big-O notation to perform complexity analyses on algorithms
  • Understand how linked lists work
  • Build a stack w/ Java, construct a queue, etc.


Details & Requirements

  • Length of time users can access this course: lifetime access
  • Access options: web streaming, mobile streaming
  • Certification of completion not included
  • Redemption deadline: redeem your code within 30 days of purchase
  • Experience level required: all levels


  • Internet required


  • Unredeemed licenses can be returned for store credit within 30 days of purchase. Once your license is redeemed, all sales are final.