Optimization
Everything on SkillVeris tagged Optimization — collected across the glossary, study notes, blog, and cheat sheets.
52 resources across 2 libraries
Study Notes(16)
Performance Optimization
How to diagnose and fix slow canvas apps: delegation limits, load-time strategy, formula caching, and the Monitor tool.
Performance Optimization and Virtualization
How Blazor's diffing pipeline determines render cost, and the practical techniques — Virtualize, ShouldRender, and parameter hygiene — used to keep large apps…
Performance and Cost Optimization
Techniques for reducing dbt run time and warehouse spend, including materialization strategy, incremental models, clustering, and query cost monitoring.
Gas Optimization in Solidity
How the EVM prices computation and storage, and the practical patterns, storage packing, caching, calldata, unchecked math, that reduce transaction costs witho…
Assembly Optimization Basics
Core techniques for writing faster assembly code: instruction selection, register allocation, loop unrolling, and avoiding pipeline stalls.
Wasm Module Size Optimization
Practical techniques for shrinking WebAssembly binaries, from compiler flags and Binaryen's wasm-opt to trimming runtime and standard library overhead.
Font Optimization
How next/font automatically self-hosts and optimizes web fonts to eliminate layout shift and remove external network requests.
Image Optimization with next/image
How the built-in Next.js Image component automatically resizes, lazy-loads, and serves modern image formats to improve performance.
Next.js Performance Optimization
Practical techniques for making Next.js apps fast: image and font optimization, code splitting, caching strategies, and Core Web Vitals.
Redis Memory Optimization
Techniques for minimizing Redis's RAM footprint, from choosing efficient encodings and bucketing strategies to compression, serialization, and maxmemory tuning.
Performance Optimization in CSS
Speed up page rendering with critical CSS, fewer reflows, and simpler selectors so pages paint faster and stay smooth.
React Performance Optimization
Learn how to prevent unnecessary re-renders in React using React.memo, useMemo, and useCallback.
Node.js Performance Optimization
Learn how to scale Node.js apps with the cluster module, avoid blocking the event loop, and apply caching strategies.
Query Optimization Basics
Foundational techniques for writing queries the optimizer can execute efficiently.
Cost Optimization Basics
Learn concrete cloud cost-optimization levers such as right-sizing, reserved and spot instances, storage tiering, and auto-scaling.
Image Size Optimization
Techniques for shrinking Docker images through multi-stage builds, minimal base images, and layer-aware Dockerfile authoring to speed up builds and deployments.
Interview Questions(36)
What is Dynamic Programming?
Dynamic programming is a technique for solving problems by breaking them into overlapping subproblems and storing each subproblem’s result so it is computed on…
Greedy vs Dynamic Programming: What is the Difference?
Greedy algorithms make the locally optimal choice at each step and never reconsider it, while dynamic programming explores overlapping subproblems and combines…
0/1 Knapsack Problem: How Would You Solve It?
The 0/1 knapsack problem is solved with dynamic programming: build a table dp[i][w] representing the best value achievable using the first i items within capac…
Unbounded Knapsack Problem: How Is It Different?
The unbounded knapsack problem allows each item type to be picked an unlimited number of times, so the DP recurrence becomes dp[w] = max(dp[w], value[i] + dp[w…
Coin Change Problem: How Would You Solve It?
The coin change problem (minimum coins to make an amount) is solved with dynamic programming: dp[a] holds the fewest coins needed to make amount a, computed as…
Edit Distance Problem: How Would You Solve It?
Edit distance (Levenshtein distance) is solved with dynamic programming: dp[i][j] holds the minimum number of insertions, deletions, and substitutions to turn…
How Do You Find the Longest Increasing Subsequence?
The longest increasing subsequence (LIS) is the longest subsequence of an array in which elements strictly increase, solvable in O(n^2) with straightforward dy…
How Do You Count the Number of Set Bits in an Integer Efficiently?
The fastest general technique counts set bits in O(k) time, where k is the number of set bits, using Brian Kernighan’s trick: repeatedly apply n = n & (n - 1),…
What is Ternary Search?
Ternary search finds the extremum (minimum or maximum) of a strictly unimodal function by evaluating the function at two interior points that split the range i…
What is the Traveling Salesman Problem?
The Traveling Salesman Problem (TSP) asks for the shortest possible route that visits every city exactly once and returns to the start, and it is NP-hard, mean…
How Do You Solve the Palindrome Partitioning Problem?
Palindrome partitioning — splitting a string into the minimum number of cuts so every resulting piece is a palindrome — is solved with dynamic programming in O…
How Does Matrix Chain Multiplication Work?
Matrix chain multiplication finds the cheapest order to parenthesize a chain of matrix multiplications — not the product itself — using dynamic programming in…
What is the Rod Cutting Problem?
The rod cutting problem asks for the maximum revenue obtainable by cutting a rod of length n into pieces and selling each piece at a given price, and it is sol…
What is the Egg Drop Problem?
The egg drop problem asks for the minimum number of trial drops needed, in the worst case, to find the exact floor in an n-floor building at which eggs start b…
Climbing Stairs Problem: How Do You Solve It?
The climbing stairs problem is solved with dynamic programming by recognizing that the number of ways to reach step n equals the sum of the ways to reach step…
House Robber Problem: How Do You Solve It?
The house robber problem — maximizing loot from a row of houses without robbing two adjacent ones — is solved with dynamic programming where, at each house, yo…
Jump Game Problem: How Do You Solve It?
The jump game problem — determining if you can reach the last index of an array where each element is the maximum jump length from that position — is best solv…
Word Break Problem: How Do You Solve It?
The word break problem — deciding whether a string can be segmented into a sequence of words from a given dictionary — is solved with dynamic programming where…
Decode Ways Problem: How Do You Solve It?
The decode ways problem — counting how many ways a digit string can be decoded to letters where "1" maps to "A" through "26" maps to "Z" — is solved with dynam…
What is the Container With Most Water Problem?
The container with most water problem finds two vertical lines from an array of heights that, together with the x-axis, form the container holding the most wat…
What is the Interval Scheduling Problem?
The interval scheduling problem asks for the maximum number of non-overlapping intervals you can select from a set, and it is solved optimally with a greedy st…
How Do You Solve the Merge Intervals Problem?
The merge intervals problem asks you to collapse a set of possibly-overlapping intervals into the minimal set of non-overlapping intervals that cover the same…
How Do You Solve the Insert Interval Problem?
The insert interval problem gives you an already-sorted, non-overlapping list of intervals plus one new interval to add, and asks you to insert it while mergin…
What is State Space Reduction in Dynamic Programming?
State space reduction is the technique of shrinking the number of distinct states a dynamic programming solution must track — by dropping redundant dimensions,…
Showing 24 of 36.