Bit Manipulation
Use AND, OR, XOR, and shifts to solve problems directly on the binary representation of numbers, often in O(1) space.
learn2torials.com is a free engineering field guide. Search the library, filter by discipline, and open the concept behind the interview prompt.
Use AND, OR, XOR, and shifts to solve problems directly on the binary representation of numbers, often in O(1) space.
Ordered indexable collection for O(1) access by position.
Nodes linked by pointers — insert and delete without shifting a contiguous block.
Last-in, first-out collection for undo, parsing, and nested work.
First-in, first-out collection for scheduling, BFS, and buffering.
Key-to-value lookup in average O(1) via hashing into buckets.
Hierarchical nodes with parent–child links for ordered and nested data.
Priority queue backed by a binary heap for fast min or max access.
Nodes and edges modeling networks, dependencies, and paths.
Prefix trees for fast autocomplete, dictionary lookup, and word search.
What AI is at the first layer: human decisions turned into computer rules — before machine learning enters the picture.
How a model improves from examples: labels, features, training, and the difference between fitting data and predicting on new data.
Machine learning with stacked neurons and ReLU layers: how a deep network builds a price guess from house features in TypeScript.
Package an application and its runtime so it starts the same way on every machine.
A systems language that checks ownership, types, and lifetimes before the program runs, so you get native speed without a garbage collector.
Try a different search term, or browse concepts by category.