Introduction

Algorithms

Sieve of Eratosthenes

Database

ACID Principles Database Indexes Database Replication SQL and NoSQL Databases Transaction Isolation Levels & Concurrency Anomalies

DevOps

Deployment Strategies

Frontend

Meta Tags Responsive and Mobile-Friendly Web Design Semantic HTML

JavaScript

Closures Decorators Higher-Order Functions Mutable and Immutable Objects Promisify with Recursion Shallow and Deep Comparison Web Workers and Service Workers

Networking

CORS HTTP Caching HTTP Methods HTTP Responses JSONP

Next.js

Guide to Firebase Hosting Server-Side Rendering (SSR) and Client-Side Rendering (CSR)

Programming

Object-Oriented Programming (OOP)

React

API Integration Avoiding Unnecessary Re-Renders Controlled and Uncontrolled Components Diffing Algorithm Error Boundaries Hooks Memoization Routers State Management Virtual DOM

React Native

SSL Pinning in React Native

Security

API Idempotency Cross-Site Scripting (XSS)Cross-Site Request Forgery (CSRF)Encryption Hashing: One-Way Data Security Rate Limiting

Software Engineering

API Versioning Caching Strategies Semantic Versioning and Changelogs Technical Debt

Welcome

Docs by Tan Chia Chun

Welcome to the docs!

Sieve of Eratosthenes

An explanation of the Sieve of Eratosthenes algorithm, a fast and efficient method for finding all prime numbers up to a given number.