Coding Kendo (コーディングの剣道)

Explore data structures, algorithms, and complexity analysis. Plus a curated set of interview coding questions.

I. Data Structures

A data structure is a specialized format for organizing, processing, retrieving, and storing data in computer science.

Basic Data Structures

• Array ✅
• String ✅
• Linked List ✅
• Stack ✅
• Queue ✅
• Heap (PriorityQueue) ✅
• HashTable ✅
  • HashMap ✅
  • HashSet ✅
• TreeMap & TreeSet ✅

Tree

• Tree ✅
  • Binary Tree & Binary Search Tree ✅
  • AVL Tree ✅
  • B-Tree ✅
• Tree Search ✅
  • Depth First Search ✅
  • Breadth First Search ✅
• Tree Traversal (DFS) ✅
  • Pre-order Traversal ✅
  • In-order Traversal ✅
  • Post-order Traversal ✅

Graph

• Graph ✅
• Graph Search ✅
  • Breadth First Search ✅
  • Depth First Search ✅
• Topological Sort ✅
  • Kahn's Algorithm ✅
• Shortest Path ✅
  • Dijkstra's Algorithm ✅
  • Bellman-Ford Algorithm ✅
• Minimum Spanning Tree ✅
  • Prim's Algorithm ✅
  • Kruskal's Algorithm ✅

Other Data Structures

• Trie (Prefix Tree) ✅
• Disjoint-set (Union Find) ✅
• Binary Index Tree (Fenwick Tree) ✅
• Segment Tree (ZKW Tree) ✅

II. Algorithms

An algorithm is a procedure used for solving a problem or performing a computation.

Basic Algorithms

• Sort Algorithms ✅
  • Bubble Sort ✅
  • Selection Sort ✅
  • Merge Sort ✅
  • Quick Sort ✅

• Search Algorithms ✅
  • Linear Search ✅
  • Binary Search ✅

Other Algorithms

• Brute Force ✅
• Backingtracking ✅
• Recursion ✅
• Divide and Conquer ✅
• Two Pointers ✅
• Sliding Window ✅
• Greedy ✅
• Dynamic Programming (DP) ✅
• Math ✅

III. Complexity Analysis

• Big O Notation ✅
• Runtime Complexity Cheetsheet ✅