/explore
|
You are here 
|
www.jeremykun.com | ||
| | | | |
denvaar.dev
|
|
| | | | | ||
| | | | |
algorithmsoup.wordpress.com
In this post, I want to tell you about what I think might be the world's simplest interesting algorithm. The vertex cover problem. Given a graph $latex {G = (V, E)}&fg=000000$, we want to find the smallest set of vertices $latex {S \subseteq V}&fg=000000$ such that every edge $latex {e \in E}&fg=000000$ is covered by... |
|
| | | | | ||
| | | | |
www.nayuki.io
[AI summary] The article discusses the AA tree data structure, comparing it to red-black trees and AVL trees in terms of implementation complexity, performance, and ease of proof. |
|
| | | | | ||
| | | | |
blog.nuculabs.de
Hello, Here are my solutions for the second part of the card: Arrays 101, from LeetCode. Duplicate Zeroes Given an array of integers, remove duplicate zeroes and shift the remaining elements. 1 2 3 4 5 6 7 8 9 10 11 12 13 class Solution: def duplicateZeros(self, arr: List[int]) -> None: """ Do not return anything, modify arr in-place instead. """ index = 0 arr_length = len(arr) while index < arr_length: if arr[index] == 0: arr.insert(index, 0) arr.pop() index += 1 index += 1 Merge Sorted Array Given two sorted arrays, merge them together into nums1. |
|
| | | |||
