Golang: Interview Bootcamp on DataStructures, LeetCode Algos

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction to Google's Golang

Lecture 2: Course overview and breakdown

Lecture 3: Applications of Go in Cloud computing world.

Lecture 4: Downloading VScode for Windows

Lecture 5: Installing VScode for Windows

Lecture 6: Course editor for Go programming.

Chapter 2: Big O

Lecture 1: Asymptotic analysis & Big O notation of Algorithms

Lecture 2: Exercise# Computation of Linear complexity | Golang Hands-On

Lecture 3: Exercise# Computation of O(m+n) Linear complexity | Golang Hands-On

Lecture 4: Exercise# Computation of Quadratic complexity | Golang Hands-On

Lecture 5: Exercise# Computation of Cubic complexity | Golang Hands-On

Lecture 6: Exercise# Computation of Constant complexity | Golang Solution | Hands-On

Lecture 7: Exercise# Computation of Complex complexity | Golang Solution | Hands-On

Chapter 3: HashMap by Example

Lecture 1: LeetCode#1832: Check if the Sentence is Pangram | Golang Solution | Hands-On

Lecture 2: LeetCode#242: Valid Anagrams | Golang Solution | Hands-On

Lecture 3: LeetCode#205: Isomorphic Strings | Golang Solution | Hands-On

Lecture 4: LeetCode#771: Jewels and Stones | Golang Solution | Hands-On

Chapter 4: Linked list by Example

Lecture 1: Introduction to Linked list with essential LinkOps | Walkover

Lecture 2: Exercise# Create a simple Singly Linked list | Golang Hands-On

Lecture 3: Exercise# Optimize the Singly Linked list creation | Golang Hands-On

Lecture 4: LeetCode#707 : Design Linked List | Golang solution | Hands-On

Lecture 5: LeetCode#876 : Middle of the Linked List | Golang solution | Hands-On

Lecture 6: LeetCode#2095 : Delete middle of the Linked List | Golang solution | Hands-On

Lecture 7: LeetCode#19 : Remove Nth node from end of list | Golang Solution | Hands-On

Lecture 8: LeetCode#141 : Linked list Cycle | Golang Solution | Hands-On

Lecture 9: LeetCode#160 : Intersection of Two Linked Lists | Golang Solution | Hands-On

Lecture 10: LeetCode#61 : Rotate List | Golang Solution | Hands-On

Lecture 11: LeetCode#237 : Delete Node in a Linked List | Golang Solution | Hands-On

Chapter 5: Stacks by Example

Lecture 1: Introduction to Stack with essential StackOps | Walkover

Lecture 2: Exercise# Build stack operations – Push(), Pop(), Peek() | Golang Hands-On

Lecture 3: LeetCode#155 : Min Stack | Golang Solution | Hands-On

Lecture 4: LeetCode#20 : Valid Parenthesis | Golang Solution | Hands-On – Method (i)

Lecture 5: LeetCode#20 : Valid Parenthesis | Golang Solution | Hands-On – Method(ii)

Lecture 6: LeetCode#1381 : Stack with an increment operator | Golang Solution | Hands-On

Chapter 6: Queues by Example

Lecture 1: Introduction to Queue with essential QueueOps | Walkover

Lecture 2: Exercise# Create a queue with QueueOps – enQ(), deQ(), listQ() | Golang Hands-On

Lecture 3: LeetCode#232 : Implement Queue using Stacks | Golang Solution | Hands-On

Chapter 7: Go: Package Management by Example

Lecture 1: Create a package with Golang and import into Binary Tree based application.

Lecture 2: Understanding Binary Tree Traversals – A walkover

Lecture 3: Understanding DFS by In-Order Traversal of Binary Tree – A walkover

Lecture 4: Exercise# DFS traversal of BST by Pre-Order | Golang Solution | Hands-On

Lecture 5: Exercise# DFS traversal of BST by In-Order | Golang Solution | Hands-On

Lecture 6: Exercise# DFS traversal of BST by Post-Order | Golang Solution | Hands-On

Lecture 7: Exercise# Level Order traversal ( BFS ) – (i) | Golang Solution | Hands-On

Lecture 8: Overview on computation of height for a binary tree – A walkover

Lecture 9: Exercise# Compute Height of a binary tree | Golang Solution | Hands-On

Lecture 10: Exercise# Level Order traversal ( BFS ) – (ii) | Golang Solution | Hands-On

Chapter 8: Binary Trees by Example

Lecture 1: LeetCode#94 : Binary Tree InOrder traversal | Golang Solution | Hands-On

Lecture 2: LeetCode#94 : Binary Tree PostOrder traversal | Golang Solution | Hands-On

Lecture 3: LeetCode#100 : Same Tree | Golang Solution | Hands-On

Lecture 4: LeetCode#114 : Flatten Binary Tree to Linked List | Golang Solution | Hands-On

Lecture 5: LeetCode#104 : Maximum depth of a Binary tree | Golang Solution | Hands-On

Lecture 6: Overview on computation of Height Balanced Tree – A walkover

Lecture 7: LeetCode#110 : Balanced Binary Tree | Golang Solution | Hands-On

Lecture 8: LeetCode#102 : Binary tree Level order traversal | Golang Solution | Hands-On

Lecture 9: LeetCode#637 : Average Level Binary Tree | Golang Solution | Hands-On

Lecture 10: LeetCode#103 : Zigzag Level Binary Tree | Golang Solution | Hands-On

Lecture 11: LeetCode#617: Merge two Binary Trees | Golang Solution | Hands-On

Lecture 12: LeetCode#226 : Invert Binary Tree | Golang Solution | Hands-On

Lecture 13: LeetCode#101: Symmetric Tree | Golang Solution | Hands-On

Chapter 9: Design Solutions

Lecture 1: LeetCode#355 : Design Twitter | Golang solution | Hands-On

Lecture 2: LeetCode#535 : Encode and Decode TinyURL | Golang solution | Hands-On

Lecture 3: LeetCode#146 : LRU Cache | Golang Solution | Hands-On

Chapter 10: String by Example

Lecture 1: Overview of String in Golang

Lecture 2: Exercise# My first String App | Golang Solution | Hands-On

Lecture 3: Exercise# Stars in the night sky | Golang Solution | Hands-On

Lecture 4: Exercise# March over the road | Golang Solution | Hands-On

Lecture 5: Exercise# How many pearls does Rosy have ..? | Golang Solution | Hands-On

Lecture 6: Exercise# Find the pendant | Golang Solution | Hands-On

Lecture 7: Exercise# Honey , I shrunk the kids | Golang Solution | Hands-On

Lecture 8: LeetCode#709 : To Lower | Golang Solution | Hands-On

Lecture 9: Exercise# : Tom and Jerry in the same cage | Golang Solution | Hands-On

Lecture 10: Exercise# Isolate flowers in a garland | Golang Solution | Hands-On

Lecture 11: Exercise# Break the chain | Golang Solution | Hands-On

Lecture 12: LeetCode#1108 : Defanging an IP address | Golang Solution | Hands-On

Lecture 13: LeetCode#1108 : Defanging an IP address – ii | Golang Solution | Hands-On

Lecture 14: LeetCode#28 : Index of First Occurrence in a String | Golang Solution | Hands-On

Lecture 15: LeetCode#58 : Length of last word | Golang Solution | Hands-On

Lecture 16: LeetCode#15 : Longest Common Prefix | Golang Solution | Hands-On

Lecture 17: LeetCode#2011 : Value of variable after operations | Golang Solution | Hands-On

Lecture 18: Exercise# Find special citizens | Golang Solution | Hands-On

Lecture 19: Exercise# Find special citizens (Method ii) | Golang Solution | Hands-On