Breadth-First Search in Python: BFS with deque
Implement breadth-first search in Python with collections.deque, visited sets, shortest unweighted paths, levels, and reconstruction.
Algorithm
Study Python algorithms with sorting, searching, recursion, graph methods, complexity notes, dry runs, and tested code examples.
RSA Encryption in Python: Safe Keys, Encryption, and Signatures
Understand RSA encryption in Python with cryptography, including key generation, OAEP encryption, PSS signatures, serialization, and limits.
A* Algorithm in Python: Heuristics and Shortest Paths
Implement A* pathfinding in Python with a priority queue, g and f scores, admissible heuristics, obstacles, and path reconstruction.
Gaussian Elimination in Python: Solve Linear Systems Clearly
Implement Gaussian elimination in Python with pivoting, row operations, numerical stability, singular matrices, and NumPy alternatives.
Python MD5 with hashlib: Checksums, Compatibility, and Security
MD5 can identify accidental changes or legacy formats, but it is not safe for passwords, signatures, or adversarial integrity checks.
Bitonic Sort in Python: Algorithm, Padding, and Complexity
Implement bitonic sort in Python, understand its power-of-two constraint, validate ascending and descending phases, and choose it for parallel sorting networks when appropriate.
Python Timsort: Stable Sorting with sorted() and sort()
Understand Python Timsort, stable sorting, key functions, reverse order, and when sorted or list.sort is the right choice for real data.
Kruskal’s Algorithm in Python: Minimum Spanning Trees with Union-Find
Implement Kruskal’s algorithm in Python with sorted edges, disjoint-set union-find, cycle checks, disconnected graphs, and complexity analysis.
Dijkstra’s Algorithm in Python: Shortest Paths With heapq
Implement Dijkstra’s shortest-path algorithm in Python with heapq, adjacency lists, distance updates, stale-entry checks, and non-negative edge weights.