Freaks City

Weighted Path Distribution via Greedy DFS When distributing a fixed number of routes across a rooted tree, an optimal strategy balances load evenly before allocating surplus paths based on subtree potential. The algorithm performs a depth-first traversal where each node divides incoming routes equally among its children. The remainder is assign ...

Problem 1: Unique Snowflake Collection Problem Statement: At n different times, snowflakes of various shapes fall (represented by distinct integers). We want to collect snowflakes from time a to time b such that no duplicate shapes are collected, and the total number of snowflakes collected is maximized. Solution Approach: Two Pointers Techniqu ...

Minimum Spanning Tree with Modular Edge Weights Prim's Algorithm Adaptation The classic Prim's algorithm builds a minimum spanning tree by starting from an initial vertex and repeatedly adding the minimum-weight edge connecting the tree to vertices outside it. For this problem, we adapt Prim's algorithm to handle edge weights computed as (a[i] ...