Update articles

[Srihari2222]

Add TypeScript and C# implementations to six algorithm articles

Adds TypeScript code snippets to six articles covering array and string problems, and adds C# snippets to the time-needed-to-buy-tickets article. Each new snippet mirrors the existing Rust implementations for the same approach (brute force, prefix sum, two pointers, etc.), using idiomatic JS/TS or C# data structures.

^{Macroscope summarized 9a9c53b.}

[macroscopeapp]

🟢 Low articles/remove-duplicates-from-sorted-array-ii.md:599

The second count.set(num, cnt - 1) on line 603 uses the original destructured cnt instead of decrementing the already-decremented value, so it sets the count back to cnt - 1 instead of cnt - 2. This contradicts the Rust version which correctly decrements twice, and misrepresents the algorithm's logic in an educational article. Consider changing to count.set(num, cnt - 2) to correctly reflect the double-decrement.

Suggested change

	nums[i++] = num;
	count.set(num, cnt - 1);
	if (count.get(num)! >= 1) {
	nums[i++] = num;
	count.set(num, cnt - 1);
	}
	count.set(num, cnt - 1);
	if (count.get(num)! >= 1) {
	nums[i++] = num;
	count.set(num, cnt - 2);
	}

🚀 Reply "fix it for me" or copy this AI Prompt for your agent:

In file articles/remove-duplicates-from-sorted-array-ii.md around lines 599-604:

The second `count.set(num, cnt - 1)` on line 603 uses the original destructured `cnt` instead of decrementing the already-decremented value, so it sets the count back to `cnt - 1` instead of `cnt - 2`. This contradicts the Rust version which correctly decrements twice, and misrepresents the algorithm's logic in an educational article. Consider changing to `count.set(num, cnt - 2)` to correctly reflect the double-decrement.