Master technical interviews with interactive diagrams and comprehensive guides for cloud computing, containerization, and distributed systems.
Visit prepguides.dev to explore interactive diagrams and interview resources.
- Algorithm Visualizations - 6 interactive algorithm visualizations with real-time performance metrics
- Sorting Algorithms - 6 sorting algorithms (Bubble, Selection, Insertion, Merge, Quick, Heap)
- Binary Search Tree - Insert, delete, search, and traversal operations
- BFS/DFS Graph Traversal - Breadth-first and depth-first search algorithms
- Trie Operations - Prefix tree with insert, search, and delete operations
- Dijkstra's Algorithm - Shortest path finding in weighted graphs
- Dynamic Programming - Knapsack and Longest Common Subsequence problems
- Kubernetes Request Flow - Complete bidirectional network flow with step-by-step explanations
- OSI 7-Layer Model - Fundamental networking concepts with detailed layer information
- Interview Questions - Curated questions for each diagram topic
- Algorithms - Sorting, searching, and data structures with live visualizations
- Kubernetes - Container orchestration, microservices, and cluster architecture
- Networking - OSI model, TCP/IP, protocols, and network troubleshooting
- System Design - Scalability patterns, caching strategies, and architecture design
- Databases - Replication, sharding, ACID properties, and CAP theorem
- Microservices - Service mesh, API gateways, and distributed systems
- System Design Interviews - Visual explanations of complex architectures
- Coding Interviews - Interactive algorithm visualizations
- DevOps Interviews - Kubernetes and networking concepts
- Architecture Discussions - Scalability and design patterns
- Visual Learning - Complex concepts made simple through diagrams
- Step-by-Step Explanations - Break down complex processes
- Real-World Examples - Practical scenarios and use cases
- Interview Practice - Common questions and answers
- 6 Algorithms: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Heap Sort
- Real-time Metrics: Comparisons, swaps, and execution time
- Adjustable Parameters: Array size and animation speed
- Performance Analysis: Time and space complexity for each algorithm
- Complete Flow: External client โ Load balancer โ Ingress โ Service โ Pod
- Component Explanations: What each component does and why it's needed
- Troubleshooting Guide: Common issues and debugging strategies
- Interview Questions: System design and technical deep-dive questions
- Layer-by-Layer Breakdown: Detailed explanation of each layer
- Protocol Examples: HTTP, TCP, IP, Ethernet, and more
- Data Flow Process: How data moves through the layers
- Troubleshooting Approach: Systematic debugging methodology
# Clone the repository
git clone https://github.com/prepguides/prepguides.dev.git
cd prepguides.dev
# Start local server
./serve.sh
# Open http://localhost:8000 in your browser- Add HTML files to the
public/diagrams/directory - Create new pages following the existing structure
- Update navigation in
index.html - Deploy to Vercel - automatic deployment on push
- Documentation: All project docs are organized in the
docs/directory - Testing: Test files and resources are in the
tests/directory - Development: Follow the workflow in
docs/development/DEVELOPMENT_WORKFLOW.md - Algorithm Development: Use the template in
docs/algorithm/ALGORITHM_TEMPLATE.html
โโโ index.html # Main navigation hub
โโโ algorithms.html # Algorithm visualizations index
โโโ kubernetes.html # K8s request flow diagram
โโโ networking.html # OSI model diagram
โโโ databases.html # Database concepts (coming soon)
โโโ microservices.html # Service architecture (coming soon)
โโโ system-design.html # Scalability patterns (coming soon)
โโโ algorithms/ # Interactive algorithm visualizations
โ โโโ sorting.html # 6 sorting algorithms
โ โโโ binary-search-tree.html # BST operations with explicit positioning
โ โโโ bfs-dfs-graph-traversal.html # Graph traversal
โ โโโ trie-operations.html # Trie data structure
โ โโโ binary-heap.html # Min/Max heap operations
โ โโโ dijkstra-algorithm.html # Shortest path algorithm
โ โโโ segment-tree.html # Range queries and tree construction
โ โโโ dynamic-programming.html # DP concepts and examples
โ โโโ code/ # Shared code and styles
โ โโโ algorithm-layout.css # Generic layout styles
โ โโโ code-highlighting.css # Syntax highlighting
โ โโโ code-execution-sync.js # Code synchronization
โโโ docs/ # Project documentation
โ โโโ algorithm/ # Algorithm development docs
โ โโโ development/ # Development workflow docs
โ โโโ testing/ # Testing documentation
โ โโโ reports/ # Issue reports and fixes
โโโ tests/ # Testing files and resources
โ โโโ core/ # Core algorithm tests
โ โโโ visualization/ # UI and visualization tests
โโโ public/diagrams/ # Static diagrams and resources
โโโ algorithms/
โโโ kubernetes/
โโโ networking/
โโโ ...
- Push code to GitHub
- Connect repository to Vercel
- Automatic deployment on every push
- Custom domain support
- Netlify: Drag and drop the folder
- GitHub Pages: Enable in repository settings
- Any Static Host: Upload the files directly
We welcome contributions! Here's how you can help:
- Add New Diagrams - Create interactive visualizations
- Improve Explanations - Make concepts clearer
- Add Interview Questions - Expand question banks
- Fix Issues - Report bugs or submit fixes
- Suggest Topics - What would you like to see?
- โ Sorting Algorithms - 6 sorting algorithms with performance metrics
- โ Binary Search Tree - Complete BST operations with explicit left/right positioning
- โ BFS/DFS Graph Traversal - Graph traversal algorithms
- โ Trie Operations - Prefix tree with D3.js visualization
- โ Binary Heap Operations - Min/Max heap with insert, extract, and heapify
- โ Dijkstra's Algorithm - Shortest path finding in weighted graphs
- โ Segment Tree - Range queries and tree construction with sum/min/max operations
- KMP String Matching - Pattern matching with failure function
- Topological Sort - DAG ordering and dependency resolution
- Union-Find - Disjoint sets with path compression
- A Pathfinding* - Heuristic search with grid visualization
- Red-Black Tree - Self-balancing tree with color properties
- Maximum Flow - Network flow with capacity constraints
- Convex Hull - Computational geometry algorithms
- B-Tree Operations - Multi-way trees for database indexing
- Database Diagrams - Replication, sharding, and indexing
- Microservices Architecture - Service mesh and API gateways
- System Design Patterns - Caching, load balancing, and scaling
- Interactive Quizzes - Test your knowledge
- Dark Mode - Toggle between light and dark themes
- Search Functionality - Find content quickly
- User Progress - Track learning progress
- Mobile App - Native mobile experience
- Study the Complete Flow - Don't just memorize individual components
- Practice Explaining - Use the diagrams to practice verbal explanations
- Understand Failures - Know what happens when each component fails
- Scale Considerations - Think about how systems behave under load
- Security Implications - Understand security at each layer
This project is open source and available under the MIT License.
Built with โค๏ธ for the developer community
Helping developers excel in technical interviews through visual learning and comprehensive guides.