Data Structures & Algorithms in Go

This repository provides solutions for the Data Structures & Algorithms In Go course.

Table of Contents

• Arrays
• Recursive Functions
• Sorting
• Stacks
• Queues
• Trees
• Binary Search Trees

Arrays

• Sum Array: Calculate sum of array elements
• Sequential Search: Linear search implementation
• Binary Search: Search in sorted array
• Largest Sum Subarray: Find subarray with maximum sum (Kadane's Algorithm)
• Rotating an Array: Rotate array by k positions
• Array Waveform: Rearrange array in wave pattern
• Index Array: Map elements to corresponding indices
• Sort 1 to N: Sort array containing numbers from 1 to N
• Smallest Positive Missing: Find smallest missing positive integer
• Max Min Array: Rearrange array in max/min pattern
• Array Index Max Difference: Find maximum index difference satisfying given conditions
• Tower of Hanoi: Solve Tower of Hanoi puzzle

Recursive Functions

All recursive functions are implemented in a single file:

• Factorial: Calculate factorial recursively
• Print Base 16: Convert and print integers in hexadecimal
• GCD: Greatest Common Divisor using Euclidean algorithm
• Fibonacci: Generate Fibonacci numbers
• Permutation: Generate all permutations

Sorting

All sorting algorithms are implemented in a single file:

• Partition 0/1: Segregate 0s and 1s
• Partition 0/1/2: Dutch National Flag problem

Stacks

• Array Implementation
• Linked List Implementation
• Stack Problems
  • Balanced Parentheses
  • Sorted Insert
  • Sort Stack
  • Bottom Insert
  • Reverse Stack
  • Min Stack
  • Parenthesis Problems
    • Print Numbers
    • Duplicate Check
    • Max Depth
    • Longest Valid

Queues

• Queue using Stacks
• Queue Operations
  • Reverse Queue
  • Reverse K Elements

Trees

All tree operations are implemented in a single file:

• Binary Tree Construction: Level order construction
• Tree Properties and Operations
• Various Traversals
• Special Operations

Binary Search Trees

• Tree Structure: Basic BST structure and creation
• Find Value: Search for a value
• Insertion: Add new values
• Delete Node: Remove nodes
• Find Min/Max: Find extreme values
• Floor: Find floor value
• Ceil: Find ceiling value
• Trim Tree: Remove nodes outside range
• Print Range: Print values within range
• LCA BST: Find Lowest Common Ancestor
• Is BST: Validate BST property