freeCodeCamp·4yHarvard CS50 – Free Computer Science University Course
Harvard CS50 is one of the most popular beginner computer science courses in the world. The course teaches students how to think algorithmically and solve problems efficiently. Topics include abstraction, algorithms, data structures, encapsulation, resource management, security, software engineering, and web programming.
Community Picks·4ySoftware Engineer Interview: The Interview Study Guide For Software Engineers
Ben Rogojan created a checklist on his last round of interviews that covers many of the popular topics. To help you keep track of your progress, we've compiled a comprehensive checklist of the same problems listed below.
Community Picks·4yleonardomso/33-js-concepts: 📜 33 JavaScript concepts every developer should know.
This repository was created with the intention of helping developers master their concepts in JavaScript. It is based on an article written by Stephen Curtis and you can read it here. Feel free to submit a PR adding a link to your own recaps or reviews. All the translations for this repo will be listed below. The Ultimate Guide to Execution Contexts, Hoisting, Scopes, and Closures in JavaScript.
Pointer·4yyangshun/tech-interview-handbook: 💯 Curated coding interview preparation materials for busy software engineers
Over 500,000 people have benefitted from this handbook. Best practice questions for coding interviews - Grind 75 - the next evolution of Blind 75, bigger and better. How to prepare for coding interview best practices.
Pointer·3yChallenging algorithms and data structures every programmer should try
A list of interesting algorithms and data structures you should try: Jeff Erickson's Algorithms ( Amazon, web) or Daniel Zingaro's Algorithmmic Thinking ( Amazon) The most known unknown data structure is the Myers diff algorithm. Splay trees are binary trees that will tend to have the more recently accessed elements closer to the root.
Community Picks·4yCoding interviews: Everything you need to prepare
Coding interviews are a form of technical interviews used to access a potential software engineer's competencies through presenting them with programming problems. AlgoMonster has the added perk of synthesizing common interview question patterns that you could apply to solve any other questions you have never encountered before.
Faun·4yTrees-Data Structure
A tree data structure is a non-linear data structure because it does not store in a sequential manner. Other data structures such as arrays, linked list, stack and queue are linear data structures that store data sequentially. Different tree data structures allow quicker and easier access.
Hacker Noon·4yExplain Complex Concepts With Minimalistic Drawings With Okso.app
Explain Complex Concepts With Minimalistic Drawings With Okso.app. The first concept I tried to explain with sketches was the Data Structures. The sketches are split into so-called Pages just to make it easier to grasp them, so the users stay focused on one concept at a time.
