Community Picks·2yBuild Redis from scratch
This series guides you through building an in-memory database similar to Redis using Go. It focuses on low-level details involving databases, data structures, and algorithms. The project highlights include understanding RESP for command parsing, using goroutines for multiple connections, and implementing data persistence with the Append Only File (AOF) method. Suitable for developers familiar with Go and Redis commands.
YouTube·2yLeetCode was HARD until I Learned these 15 Patterns
Understanding patterns is more critical than solving numerous problems to excel in competitive coding and coding interviews. This post covers 15 key patterns like prefix sum, two-pointers, sliding window, fast and slow pointers, and dynamic programming among others. These patterns not only make solving problems easier but are commonly tested by major companies like Amazon and Google. Each pattern is explained with examples and related practice problems.
Javarevisited·2yWhich Programming Books Would You Buy If you got 100$ to Spend?
A community discussion on which programming books to buy with a $100 budget, highlighting popular and timeless recommendations like 'Clean Code', 'Effective Java', and 'Algorithm Design Manual'. The post encourages sharing personal choices and provides a rundown of frequently suggested books, including those on algorithms, design patterns, and system design.
Kirupa·2yBubble Sort: A Detailed Deep-Dive 🛁
Bubble sort is one of the simplest and least efficient sorting algorithms. It sorts a list by repeatedly stepping through and comparing adjacent elements, swapping them if they're in the wrong order. This process is repeated until the list is sorted. Despite its inefficiency (O(n^2) time complexity in average and worst cases), bubble sort is essential for understanding basic sorting concepts and why more efficient algorithms are preferred. The algorithm's primary merit is its simplicity and ease of implementation.
YouTube·2yFastest way to learn Data Structures and Algorithms
Many programmers struggle with mastering data structures and algorithms (DSA) for coding interviews, despite completing numerous courses. It's crucial to focus on core concepts and use languages like Python, which simplifies writing and enhances problem-solving efficiency. Employing 'just-in-time' learning helps acquire knowledge as needed, avoiding overwhelm. Priority should be given to essential data structures like arrays, linked lists, stacks, queues, binary trees, and hash tables. Understanding Big O notation for algorithm efficiency is critical. Practice focused on the most common interview problems is vital for success.
Real Python·2ySorting Dictionaries in Python: Keys, Values, and More – Real Python
Learn how to sort dictionaries in Python using the `sorted()` function, dictionary views, and specifying sort keys. The video course covers dictionary comprehensions, how lists are used during sorting, alternative data structures, and includes videos, transcripts, downloadable resources, a text-based tutorial, expert Q&A, and a completion certificate.
Collections·2yMastering Data Structures and Algorithms: A Comprehensive Guide for Students
A new Data Structures and Algorithms (DSA) series by Shradha Khapra is aimed at students preparing for placements and internships. The course will cover essentials from basic programming and mathematical foundations to advanced topics like hash maps, heaps, and dynamic programming. Practical implementations and continuous practice on platforms like LeetCode are emphasized to solidify learning.