Data Science Spotlight: Selected Problems from Advent of Code 2025

Selected problems from the 'Advent of Code 2025' programming event are used to demonstrate data science applications. One problem involving beam splitters is solved using set algebra for tracking paths and dynamic programming with memoization to count possible timelines. Another problem about connecting junction boxes in 3D space is solved by finding nearest neighbors with a min-heap and building a minimum spanning tree with Kruskal's algorithm. The walkthroughs illustrate how these fundamental algorithms and data structures can be applied to solve complex computational problems relevant to data scientists.