Skip to content
Data Structures and Algorithms using Golang
Introduction
Initializing search
Data Structures and Algorithms using Golang
Home
Simple
Simple
Count Digits
Palindrome Numbers
Factorial of A Number
Trailing Zeros in Factorial
Greatest Common Divisor
LCM of Two Numbers
Check for Prime
Prime Factors
All Divisors Of A Number
Sieve of Eratosthenes
Computing Power(x,n)
Iterative Power (Binary Exponentiation)
String
String
String is Palindrom
String is Pangram
Strign is Anagram
Word cound in paragraph
Max n Occurance of Word in Paragraph
All Permutation of A String
All subsequence of A string
Arrays
Arrays
Introduction
Operation in Array
Largest Element in Array
Second Largest Element in Array
Check If Array is Sorted
Reverse an Array
Remove Duplicate from Sorted Array
Remove Duplicate from Unsorted Array
Move All Zeroes to End
Left Rotate Array by One
Left Rotate Array by d
Leaders in Array
Maximum Difference
Frequency in Sorted Array
Sum of All Pair in Sorted Array is Equal to Given Number
Intersection of Two Sorted Array
Union of Two Sorted Array
Count Inversion in An Array
Searching
Searching
Binary Search
First Occurance in Sorted Array
Last Occurance in Sorted Array
Count Occurance in Sorted Array
Count 1's in Sorted Array
Square Root
Find Possition of Missing Number
Find in Sorted Rotated Array
Find a Pair With Given Sum
Sorting
Sorting
Introduction
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Linked List
Linked List
Delete Middle Element of Singly Linked List
Reverse A Singly Linked List
Add One in Lisked List Digit
Concurrency
Concurrency
Print Odd and Even Sequentially using goroutine
Tree
Tree
Traversal
Heigth Of Tree
Print Nodes a K Distance
Level Order Traversal
Binary Search Tree(BST)
Binary Search Tree(BST)
Search
Insert
Delete
Floor of Number
Ceil of Number
Second Largest Number from Given Number
Greedy Algorithms
Greedy Algorithms
Max Coin
Max Activity
Fraction Knapsack
Job Sequence
Heap
Heap
Heap
Descrease Key
Delete Element
Build Heap
Heap Sort
Sort K Sorted Array
Buy Maximum Items by Given Sum
K Largest Elements
K Closest Elements
About Author
Introduction of Array
Continuous memory allocation
Advantages
Random Access
Cache friendliness