Golang: Interview Bootcamp on HackerRank, LeetCode Algos

Explore linear time complexity in Golang by searching for an element in an array, mapping to O(n) and comparing best, worst, and average cases.

Practice computing O(m+n) linear time complexity by searching an element across two arrays in Golang, and analyze how big O ignores constants and lower-order terms.

Explore a Golang hands-on demonstration of a two-sum problem using nested loops to show quadratic time complexity, with m and n array sizes resulting in n squared.

Demonstrates computation of complexity in a conditional two-loop structure in Go, analyzing time complexity and big-O notation for worst-case growth in a hands-on Golang example.

Learn to solve LeetCode 1832 in Go by using a hash map to count lowercase letters, iterating through the string, and checking for 26 alphabets to determine pangram status.

Implement a Golang solution to LeetCode 242 valid anagrams by using a hash map to compare character frequencies and ensure equal lengths in a hands-on approach.

Solve LeetCode 205 isomorphic strings in Golang using two hash maps to track character mappings between two strings, validate length and mapping consistency, and determine isomorphism.

Solve LeetCode 771 jewels and stones in golang by building a hash map of jewels and counting stones that match, with case-sensitive keys and an efficient linear pass.

Explore the design of a key-value store, a non-relational database that uses unique keys for key-value pairs, supports various data types, and handles collisions with get and insert operations.

Explore linked lists as dynamic data structures, covering singly and doubly variants with head and tail, next and previous pointers, and core operations: insert, delete, search, and display.

Create a simple singly linked list in Go by defining package main, building a five-node integer list with next pointers, and printing the sequence from head to tail.

Optimize the Golang singly linked list by creating a separate display function and using the head pointer directly, preserving the 11 22 33 44 55 output.

Design a linked list from scratch in Golang for LeetCode 707, implementing a singly or doubly linked list with operations: constructor, add at head/tail, add/delete/get at index.

Delete the middle node of a singly linked list in Go using the tortoise and hare method, handling edge cases and returning the modified head.

Learn to remove the nth node from the end of a linked list using Golang, applying a two-pointer approach and handling edge cases in LeetCode problem 19.

Explore LeetCode 141: detect a linked list cycle in Golang using Floyd's algorithm with slow and fast pointers, returning true if a cycle exists and false otherwise.

Solve LeetCode problem 160: intersection of two linked lists with a Golang hands-on approach, computing lengths, aligning by difference, and tracing pointers to the intersection node.

Explore rotating a linked list to the right for LeetCode problem 61 using Golang, including length calculation, forming a circular list, and identifying the new head and tail.

Understand LeetCode 237: delete a node in a singly linked list by copying the next node's value into the current node and bypassing the next pointer, in Golang.

Explore the stack data structure, a last-in, first-out structure with the top node. Learn push, pop, and peek operations and how stacks support browser navigation and editor undo.

Define a stack as a linked list in Go, implement push, pop, and peek, provide a constructor and an empty check to manage top elements through a head pointer.

Explore solving LeetCode 155 min stack using Go, implementing push, pop, top, and getMin in constant time with two stacks: a primary stack and a min-tracking auxiliary stack.

Explore the queue data structure and its first-in-first-out behavior, using front and rear pointers to enqueue at the rear and dequeue from the front, with integer or generic data.

Learn to implement a queue using two stacks in Go by supporting push, pop, peek, and empty operations, preserving FIFO order with stack one and stack two.

Explore binary tree traversals, including depth-first options—preorder, inorder, and postorder—and breadth-first level order traversal, with root-first visits and left-right subtree processing.

demonstrates in-order traversal of a binary search tree, visiting left subtree, then root, then right, printing nodes to produce ascending values.

Implement a preorder depth-first traversal of a BST in Golang, visiting each node and traversing the left and right subtrees in a hands-on solution.

Explore the computation of max depth, or height, of a binary tree, including node-count versus edge-count conventions, by walking through left and right subtrees and base cases.

Compute the height of a binary tree in Go by implementing a height function using left and right heights and a max helper, then test in main.

Solve the LeetCode binary tree inorder traversal in Golang by using a helper to traverse left, visit root, and traverse right, collecting values in a result array.

Explore binary tree postorder traversal in Golang by recursively traversing left, then right, and visiting the node, collecting results in an array in this hands-on LeetCode lesson.

Solve LeetCode problem 100 in Golang to determine if two binary trees P and Q are structurally identical and have the same node values.

Flatten the binary tree to a right-skewed linked list in Go, preserving preorder order by linking right children and nulling the left.

Explore a Golang solution to determine if a binary tree is height balanced by the left-right height difference at each node, using a recursive isBalanced check and height function.

Implement a Golang solution for LeetCode 103 zigzag level order traversal of a binary tree, toggling traversal direction each level to output left-to-right then right-to-left level values.

Learn to invert a binary tree in Go for LeetCode 226 with a hands-on postorder recursive solution that swaps left and right subtrees, producing a mirror image.

Learn a Golang solution for LeetCode 101 symmetry by inverting the right subtree and comparing it to the left, with a boolean result and recursive checks.

Design a simplified twitter in Golang that supports posting tweets, following and unfollowing, and viewing the ten most recent tweets in a user news feed.

Design and implement an LRU cache in Go from scratch for the LeetCode problem, using a map and a doubly linked list with a constructor, get, put, and eviction.

Learn how to build your first Go string app by using string literals, escape sequences like newline and tab, and the length function to measure string length.

Explore a Go range-loop solution that counts pearls in Rosie’s necklace by iterating the string as runes and incrementing the count for non-hyphen characters.

Learn to find the pendant position in a necklace by iterating the string with a range loop in Go, capturing the index, and printing the pendant's position with fmt.

Solve LeetCode 709 by converting every uppercase letter to lowercase using Go's strings.ToLower, with examples such as hello and lovely; input length is 1–100 and ASCII printable.

Demonstrates string concatenation by merging two strings into a new string, showing that strings are immutable, with Tom and Jerry combined in a Go example.

Explore a hands-on Golang solution to isolating flowers in a garland by splitting a string, iterating with a range loop, and printing each flower.

Break a sentence into words by whitespace in Go using the strings package, printing each word with fmt while iterating over the split results.

Implement a solution for LeetCode 28 by using Go's strings.Index to find the first occurrence of the needle in the haystack, returning the index or -1 when not found.

Deliver a Golang solution for LeetCode 58: length of last word, handling multiple spaces and returning last word's length using the strings package to trim and identify the last word.

Develop a Go solution for the longest common prefix by using the first string as the initial prefix and trimming it against each subsequent string, returning empty if none.

Learn to compute the final value of x after performing operations for LeetCode problem 2011, using a Golang solution with ++x, x++, --x, and x--.

Reverse a string in place for LeetCode problem 344 using a two-pointer approach in Go, swapping characters with only one extra memory until start meets end.