Blockchain

• Multi-Chain
• CryptoZombies - Learn Ethereum by coding games

Command Line

• Command Line Tutorial

Competitive Programming

• Reddit - Daily or weekly problems on computer science and competitve coding
• List of all past, on-going and upcomming contests from all around the world
• Visualize Data Structures & Algorithms
• Segment Trees concept - beginner to advanced
• Collections of algorithms by William Fiset
• Interactive Coding challenges (By Donne Martin on Github)
• Competitive Programming Tutorials on TopCoder
• Article on how to solve interactive problems
• Algorithms with Rachit (Youtube Channel)

Computer Networks

• Multicast basics and multicast routing

Computer Vision and Deep Learning

• GAN Labs - Awesome animations on GANs
• GAN Zoo - List of all the available GANs

cpp

• Friend function and classes in C++
• Race condition vs data race
• Memory ordering at compile time
• rvalue and move semantics
• Difference in OOP concepts Java vs C++
• Understanding Memory consumptions

Cryptography and Cyber Security

• Awesome videos related to Cryptography
• Online password cracking time checker

DevOps

• Katacoda - Useful Tutorials on Docker & Kubernetes with built in Cloud Environment

General Stuff

• Exploring the basics of computer science
• Basecs Podcasts
• Good blog series on design patterns
• YouTube playlist on design patterns present in "Head First Design Patterns" book
• General CS Books, Images and Resources

Internships and Summer Programs

• Summer Internships Tracker
• GSoC 2019 Application experience and guide by Pujan Mehta
• GSoC 2019 Application experience - Ruturaj Gujar
• Winter Internship Experience at a HFT firm - Dhruv Bhagadia
• Google Summer of Code

Interview preparation

• Programming Camp Syllabus
• Software Engineering Prep Doc by Google
• How can building a heap be O(n) time complexity? When inserting a node into a heap is O(logn) time, shouldn't building a heap be O(nlogn) time in worst case?
• heap data structure vs heap memory
• Interview process course by Sunny Patel
• List of questions for different topics by Yang Shun
• Firecode.io - Online coding interview preparation platform
• 12 Week Interview Preparation Curriculum: Leetcode post
• O(sqrt(n)) time complexity
• Programming interview questions list by Arden Dertat
• Java interview questions
• Why use heap for a priority queue and not a self balancing BST?

Machine Learning and Deep Learning

• d2l.ai - Course on Intro to Deep Learning
• mlcourse.ai - A good course on Machine Learning
• Guide on Back Propogation in Neural Networks (Medium)
• Dynamic Evaluation for PyTorch Models
• Nice tutorials on PyTorch
• Data Science iPython Notebooks by Donne Martin
• CSS229: Machine Learning by Stanford
• Playground for Building Neural Networks

Natural Language Processing and Deep Learning

• Stanford CS 224N NLP course
• Speaker Diarization
• FastBert
• Word2Vec
• spaCy Universe - Collection of many great resources developed with or for spaCy
• Awesome NLP
• Language Sentence Pair Datasets which can be used for Neural Machine Translation
• Open Parallel Corpus

Other Useful Stuff

• Secure tunnels to localhost (ngrok)
• devSwag.io - Swag Opportunities for Developers
• [yapf
• This is awesome if you listen songs on spotify - Open Source
• Levels to a software engineer's progress
• Testing a GitHub Pull Request (StackOverflow)
• Using Virtual Environment with Jupyter Notebook (StackOverflow)

System Design

• Lock Free Queues - pros/cons and how to implement one
• System design concepts explanation for interview preparation (By Donne Martin on Github)