Day 44 of 133

CNN architectures (AlexNet → ResNet → EfficientNet) + DSA Tries

What problem each generation solved. Residuals, 1×1 convs, depthwise separable.

DSA · NeetCode Tries

Implement Trie Prefix TreeDSA · Tries
Interview questions to prep
1. Why a trie over a hash map — what queries does the trie make cheaper?
2. What's the time/space trade-off vs storing all suffixes?
3. How would you support deletion or wildcard matching efficiently?
Design Add And Search Words Data StructureDSA · Tries
Interview questions to prep
1. Why a trie over a hash map — what queries does the trie make cheaper?
2. What's the time/space trade-off vs storing all suffixes?
3. How would you support deletion or wildcard matching efficiently?

AlexNet → VGG → Inception → ResNet → DenseNet → EfficientNetDeep LearningCS231n
Interview questions to prep
1. What problem did ResNet's residual connections actually solve?
2. Why did 1×1 convs become so important (Inception, bottleneck blocks)?
Why ResNet works: identity mappingsDeep LearningHe et al.
Interview questions to prep
1. Explain why training error went UP with depth before ResNet.
2. Walk me through a residual block.
Depthwise separable convs (MobileNet, EfficientNet)Deep LearningEfficientNet
Interview questions to prep
1. How do depthwise separable convolutions reduce compute?
2. What does EfficientNet's compound scaling do that one-axis scaling doesn't?

References & further reading