Golang: Interview Bootcamp On Datastructures, Leetcode Algos

Ace the FAANG coding interviews and beyond with visual learning for quick and deeper understanding in GO.

What you'll learn

Ace the Google, Amazon, Meta, Microsoft, Netflix coding interviews with confidence.

Visual walkthrough of the Data structure and Algorithm for quick understanding and fast grasping.

Provides ground up level to gain expertise in Data Structures and Algorithms.

Improves cognitive thinking capacity and boosts problem solving efficiency.

Code with me kind of mode with step by step guidance on most frequently asked interview questions.

Provides insights and guidance into Leetcode's must do questions for interview preparation.

6 downloadable source code available.

Understand Big-O notation of algorithms.

Improve skills development.

Hands-On exercises and solutions on VScode and LeetCode.

Step-by-step walkover of the algorithmic workflow and execution on LeetCode.

Course delivered by Industry and cloud expert.

Live coding implemented so that learners get the picture of complete sequence of application workflows.

Requirements

Basic background and knowledge with any programming language.

Prior exposure or experience to Data structures and Algorithms not required.

Description

Welcome to "Golang: Interview Bootcamp on Data structures, Leetcode Algos" - The First of A Kind , one and only complete Data Structures and Algorithms with Golang on the internet.This course aims to enable problem solving, approach and cognitive thinking efficiency in learners boost. The approach that I shall dive you across for gaining the same will be by methods discussed below.Whiteboarding is most best approach adopted by learners to grasp the concept. On the same lines I have demonstrated data structures, algorithms and problems with quick visual walkthroughs. The focus and following features are adopted throughout the course.Visual representation and learning: Helps learners pick up concepts and workflows on complex ideas with flowcharts, diagrams and animations. Pictorial representation also helps memory retention of the concept.Problem solving: Simple breakdown of complex problems into tiny digestible modules are made.Iterative and step-by-step learning: For better refinement and granular grasping of the algorithmic journey, the steps involved are drawn through iterative flows as the instructions on the design flows.Algorithmic designs: Step-by-step walkover into the flow helps understanding of the design and identify potential optimizations as well.Most of the Tier#1 and fortune 500 software companies prefer to carry out the coding interviews at various levels from freshers through Principal engineers on various coding platforms including but not limited to HackerRank, AlgoExpert, LeetCode, and SPOJ. The course by itself carries more than 50+ Coding exercises some of them carried out as independent code into the VSCode editor with Go compiler. Additionally we will also focus to practice coding via Hands-On exercise using LeetCode.All of these will make you confident and prepared to walk into a coding interview.What more can you get ?I have additionally included the source code for all hands-on exercises as part of downloadable resources. You can download them , save and run them into your environment. This can help you add more features to the code, optimize, debug and learn.Wide range of topics that we will cover are as follows:Technical:Big-O notation - impact & purpose.Package Management in GODesignData structures:Hash MapsLinked ListsStacksQueuesBinary TreesIt is impossible to gain expertise into any topic discussed here unless you make your hands dirty. So I would suggest that you get started with an editor of your choice and start writing code yourself with me.What are you waiting for ? Get started and I am excited to take you along this journey of learning Data Structures with LeetCode algorithms using Go !

Overview

Section 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.

Section 2: Big O

Lecture 7 Asymptotic analysis & Big O notation of Algorithms

Lecture 8 Computation of Linear complexity | Golang Hands-On

Lecture 9 Computation of Quadratic complexity | Golang Hands-On

Lecture 10 Computation of Cubic complexity | Golang Hands-On

Lecture 11 Computation of Constant complexity | Golang Solution | Hands-On

Lecture 12 Computation of complexity on complex algorithms | Golang Solution | Hands-On

Section 3: HashMap by Example

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

Lecture 14 LeetCode#155: Isomorphic Strings | Golang Solution | Hands-On

Section 4: Linked list by Example

Lecture 15 Introduction to Linked list with essential LinkOps | Walkover

Lecture 16 Optimize the singly Linked list creation | Golang Hands-On

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

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

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

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

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

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

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

Section 5: Stacks by Example

Lecture 24 Introduction to Stack with essential StackOps | Walkover

Lecture 25 Create a stack with stack operations - Push(), Pop(), Peek() | Golang Hands-On

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

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

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

Section 6: Queues by Example

Lecture 29 Introduction to Queue with essential QueueOps | Walkover

Lecture 30 Create a queue with QueueOps - enQ(), deQ(), listQ() | Golang Hands-On

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

Section 7: Go: Package Management by Example with application based on Binary Search Tree

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

Lecture 33 Understanding Binary Tree Traversals - A walkover

Lecture 34 Understanding DFS by In-Order Traversal of Binary Tree - A walkover

Lecture 35 A demo of DFS traversal of BST by Pre-Order | Golang Solution | Hands-On

Lecture 36 A demo of DFS traversal of BST by In-Order | Golang Solution | Hands-On

Lecture 37 A demo of DFS traversal of BST by Post-Order | Golang Solution | Hands-On

Lecture 38 A demo of Level Order traversal ( BFS ) - (i) | Golang Solution | Hands-On

Lecture 39 Overview on computation of height for a binary tree - A walkover

Lecture 40 Compute Height of a binary tree | Golang Solution | Hands-On

Lecture 41 A demo of Level Order traversal ( BFS ) - (ii) | Golang Solution | Hands-On

Section 8: Binary Trees by Example

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

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

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

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

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

Lecture 47 Overview on computation of Height Balanced Tree - A walkover

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

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

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

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

Section 9: Design Solutions

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

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

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

Developers looking for job in Tier#1 and fortune 500 software companies.,Developers willing to work on Google's Golang environment.,Cloud computing developers willing to write web services.,Professionals who are willing to enhance their career.,Students and university grads willing to upskill with Go coding,University interns and pass out who are curious in learning cloud computing skills.