Commonly asked theories

Balanced Binary Tree Implementation (AVL Tree)

Complete Binary Tree

• Implement a tree with 3 children using Go.
• Reverse a string using a stack in Go.
• What is a singly linked list? How does it differ from a doubly linked list?
• Implement linear search and binary search in Go.
• Check if parentheses are valid in a given string.
• Reverse a string in Go.
• Implement a stack and queue in Go.
• Implement a priority queue in Go.
• Implement a circular queue in Go.
• Find permutations of a string in Go.
• Implement BFS and DFS for a graph in Go.
• Implement a balanced tree (e.g., AVL or Red-Black Tree) in Go.
• Implement Dijkstra's shortest path algorithm in Go.
• Implement a hash table with collision resolution using linear probing.
• Solve the "Koko Eating Bananas" problem from LeetCode in Go.
• Find cycles in a graph using Go.
• Explain the jagged array concept.