DEV·2yLearn Big O Notation once and for all
This post provides a comprehensive explanation of Big O Notation, which is used to classify algorithms based on their time and space complexity as the input size grows. Examples for different time complexities like O(n), O(1), O(n^2), O(n*m), O(log n), O(n log n), O(2^n), and O(n!) are provided with detailed algorithms and coding snippets. The goal is to help readers understand and recall these concepts for coding interviews.
YouTube·1yHow I Mastered Data Structures and Algorithms in 8 Weeks
Learn how to master data structures and algorithms in just 8 weeks through a practical, hands-on approach. Avoid common pitfalls like over-reliance on textbooks and tutorials. Instead, practice solving problems and seek help only when necessary. Form or join a small study group for accountability, consistency, and competitive motivation. Use techniques like the five whys to deeply understand each concept and ensure you can apply your knowledge effectively in coding interviews.
System Design Codex·1yHow Consistent Hashing Works?
Consistent hashing is a technique used for distributing keys uniformly across a cluster of nodes, minimizing the number of keys that need to be moved when nodes are added or removed. Steps include hashing keys and nodes using a hash function, placing them on a circular space or ring, and assigning keys to the nearest node in a clockwise direction. Virtual nodes help with load balancing by mapping physical nodes to multiple positions on the ring. This makes the technique scalable, load-balanced, and fault-tolerant, though it relies heavily on the quality of the hash function used.
A Java geek·2yPseudo-Random Number Generators: From the Origins to Modern Algorithms
Pseudo-Random Number Generators (PRNGs) are critical tools in software development, simulating randomness through deterministic sequences. The evolution of PRNGs has advanced from early methods like linear congruential generators to sophisticated algorithms such as xoshiro, PCG, and LXM. Each PRNG offers different trade-offs in speed, memory usage, and statistical quality. High-quality PRNGs are essential for applications in simulations, game development, and machine learning, ensuring performance, correctness, and reliability.
Kirupa·2yFinding Prime Numbers Using a Sieve of Eratosthenes
The Sieve of Eratosthenes is a highly efficient algorithm for finding all prime numbers up to a specified limit. It works by iteratively marking the multiples of each prime number starting from 2. This method quickly eliminates composite numbers and retains prime numbers. The algorithm can be easily implemented in various programming languages, such as JavaScript, and is crucial for tasks in modern cryptography and large number testing.
Medium·1yPerform outlier detection more effectively using subsets of features
Identifying outliers in data, especially in high-dimensional datasets, poses significant challenges. Using subspaces, or subsets of features, can enhance the outlier detection process by reducing the curse of dimensionality, improving accuracy, and facilitating interpretability. Techniques like KNN and LOF benefit from this approach. The post provides an overview of creating and using subspaces, and mentions tools such as PyOD, SOD, and FeatureBagging that help implement these techniques effectively.
Web Dev Cody·2yThis is how the BFS (breadth first search) algorithm works
This post explains the breadth-first search (BFS) algorithm using a zombie pathfinding scenario in a game. It covers the conceptual approach of BFS with a diagram and describes how to represent the grid as a graph with nodes and edges. The author details the traversal process, including the use of a queue to manage nodes and an array to track seen nodes, and emphasizes the importance of maintaining the order of node visits to avoid infinite loops. The post concludes with a brief mention of other graph traversal algorithms and invites readers to explore the open-source code.
Tech With Tim·2yCracking the code to land a job at Google👀
The post challenges readers to sort a list of numbers such that each number is greater than the one before it by only swapping adjacent numbers, aiming to achieve this in the fewest number of swaps possible. The example provided demonstrates the solution for a specific list, inviting readers to comment with their solutions for another given list.
