AoC_2025.Tests/Day07Test.cs

@@ -1,47 +0,0 @@
-using AdvenOfCode.Contracts;
-
-namespace AoC_2025.Tests;
-
-public class Day07Test
-{
-    private readonly IPuzzleSolver<long> _sut;
-    private static readonly string rootPath = Environment.GetFolderPath(Environment.SpecialFolder.MyDocuments);
-    private readonly string TestInputPath = @$"{rootPath}\AoC-PuzzleInputs\2025\Test\day07.txt";
-    private readonly string ProdInputPath = @$"{rootPath}\AoC-PuzzleInputs\2025\Prod\day07.txt";
-    
-    public Day07Test()
-    {
-        _sut = new Day07();
-    }
-    [Fact]
-    public void Part01_Test_equals_21()
-    {
-        var actual = _sut.SolvePart1(TestInputPath);
-        
-        Assert.Equal(21, actual);
-    }
-    
-    [Fact]
-    public void Part01_Prod_equals_1658()
-    {
-        var actual = _sut.SolvePart1(ProdInputPath);
-        
-        Assert.Equal(1658, actual);
-    }
-    
-    [Fact]
-    public void Part02_Test_equals_40()
-    {
-        var actual = _sut.SolvePart2(TestInputPath);
-        
-        Assert.Equal(40, actual);
-    }
-    
-    [Fact]
-    public void Part02_Prod_equals_53916299384254()
-    {
-        var actual = _sut.SolvePart2(ProdInputPath);
-        
-        Assert.Equal(53916299384254, actual);
-    }
-}

AoC_2025/Day06.cs

@@ -38,14 +38,14 @@ public class Day06 : IPuzzleSolver<long>
         return results.Sum();
     }
 
-    private static long[] CalculateResults(Func<long, long, long>[] operands, long[][] numbers)
+    private static long[] CalculateResults((Func<long, long, long> operation, long opBaseValue)[] operands, long[][] numbers)
     {
         return operands
-            .Select((operand, i) => numbers[i].Aggregate((acc, next) => operand(acc, next)))
+            .Select((op, i) => numbers[i].Aggregate(op.opBaseValue, (acc, next) => op.operation(acc, next)))
             .ToArray();
     }
 
-    private Func<long, long, long>[] ParseOperands(string[] operands)
+    private (Func<long, long, long> operation, long opBaseValue)[] ParseOperands(string[] operands)
     {
         var parsedOperands = operands
             .Select(ParseOperand)
@@ -55,45 +55,30 @@ public class Day06 : IPuzzleSolver<long>
 
     private static long[][] ParseNumbersByWhitespace(string[] numbers)
     {
-        var splittedNUmbers = numbers
+        var parsedNumbers = numbers
-            .Select(line => ParseLineByWhitespace(line))
+            .Select(line => line.Split(' ', StringSplitOptions.RemoveEmptyEntries))
-            .ToArray();
+            .SelectMany(line => line.Select(long.Parse).Index())
-        var parsedNumbers = splittedNUmbers
+            .GroupBy(indexedNumber => indexedNumber.Index)
-            .Aggregate(Enumerable.Repeat(Array.Empty<long>(), splittedNUmbers[0].Length), 
+            .Select(group => group.Select(indexedNumber => indexedNumber.Item).ToArray())
-                (acc, line) => CombineLists(acc, line))
             .ToArray();
         return parsedNumbers;
     }
 
-    private static long[] ParseLineByWhitespace(string line)
-    {
-        return line.Split(' ', StringSplitOptions.RemoveEmptyEntries)
-            .Select(str => long.Parse(str))
-            .ToArray();
-    }
-
-    private static IEnumerable<long[]> CombineLists(IEnumerable<IEnumerable<long>> acc, IEnumerable<long> line)
-    {
-        return acc.Zip(line, (left, right) => (long[])[..left, right]);
-    }
-
     private static long[][] ParseNumbersByColumn(string[] numberLines)
     {
-        var combinedNumbers = numberLines
+        var (numberColumns, lastColumn) = Enumerable.Range(1, numberLines[0].Length)
-            .Aggregate(Enumerable.Repeat(string.Empty, numberLines[0].Length),
+            .Select(i => numberLines.Aggregate("", (acc, numberLine) => acc + numberLine[^i]))
-                (acc, line) => acc.Zip(line, (left, right) => left + right));
+            .Aggregate((columns: (List<long[]>)[[]], column: (long[])[]),
-        var (numberColumns, lastColumn) = combinedNumbers
-            .Aggregate((columns: new List<long[]>(), column: Array.Empty<long>()),
                 (acc, number) => string.IsNullOrWhiteSpace(number) 
                     ? ([..acc.columns, acc.column], []) 
                     : (acc.columns, [..acc.column, long.Parse(number)]));
-        return [..numberColumns, lastColumn];
+        return [lastColumn, ..Enumerable.Reverse(numberColumns)];
     }
 
-    private Func<long, long, long> ParseOperand(string operand) => operand switch
+    private (Func<long, long, long> operation, long opBaseValue) ParseOperand(string operand) => operand switch
     {
-        "+" => (long a, long b) => a + b,
+        "+" => ((long a, long b) => a + b, 0),
-        "*" => (long a, long b) => a * b,
+        "*" => ((long a, long b) => a * b, 1),
         _ => throw new ArgumentOutOfRangeException(nameof(operand))
     };
 }

AoC_2025/Day07.cs

@@ -1,98 +0,0 @@
-using System.Collections.Generic;
-using System.Data.Common;
-using System.IO;
-using System.Linq;
-using AdvenOfCode.Contracts;
-using Coordinate = (int x, int y);
-
-namespace AoC_2025;
-
-public class Day07 : IPuzzleSolver<long>
-{
-    private string[] ParsePuzzleInput(string path)
-    {
-        var puzzleInput = File.ReadAllLines(path)
-            .Where(line => !string.IsNullOrWhiteSpace(line))
-            .ToArray();
-        return puzzleInput;
-    }
-
-    public long SolvePart1(string pathToPuzzleInput)
-    {
-        var grid = ParsePuzzleInput(pathToPuzzleInput);
-        var start = GetStart(grid);
-        var count = TraverseGridAndCountSplitters(grid, start);
-        return count;
-    }
-    
-    public long SolvePart2(string pathToPuzzleInput)
-    {
-        var grid = ParsePuzzleInput(pathToPuzzleInput);
-        var start = GetStart(grid);
-        var count = GetNodesTraversedWitTimelineCount(grid, start, [], []);
-        return count[start];
-    }
-
-    private Coordinate GetStart(string[] grid)
-    {
-        return (0, grid[0].IndexOf('S'));
-    }
-
-    private long TraverseGridAndCountSplitters(string[] grid, Coordinate start)
-    {
-        HashSet<Coordinate> visited = [start];
-        var seen = new Queue<Coordinate>();
-        seen.Enqueue(start);
-        var splittersHit = 0L;
-        while (seen.TryDequeue(out var current))
-        {
-            if (current.x >= grid.Length) continue;
-            if (current.y >= grid[0].Length || current.y < 0) continue;
-
-            if (grid[current.x][current.y] == '^')
-            {
-                splittersHit++;
-                var nextLeft = (current.x, current.y - 1);
-                var nextRight = (current.x, current.y + 1);
-                if (visited.Add(nextLeft)) seen.Enqueue(nextLeft);
-                if (visited.Add(nextRight)) seen.Enqueue(nextRight);
-            }
-            else
-            {
-                var next = (current.x + 1, current.y);
-                if (visited.Add(next)) seen.Enqueue(next);
-            }
-        }
-
-        return splittersHit;
-    }
-    
-    private Dictionary<Coordinate, long> GetNodesTraversedWitTimelineCount(string[] grid, Coordinate current, HashSet<Coordinate> path, Dictionary<Coordinate, long> nodeCountVisited)
-    {
-        if (current.x >= grid.Length || nodeCountVisited.ContainsKey(current))
-        {
-            var addAmount = nodeCountVisited.GetValueOrDefault(current, 1);
-            foreach (var node in path)
-            {
-                nodeCountVisited[node] += addAmount;
-            }
-
-            return nodeCountVisited;
-        }
-
-        nodeCountVisited[current] = 0;
-        path.Add(current);
-
-        if (grid[current.x][current.y] == '^')
-        {
-            var resLeft = GetNodesTraversedWitTimelineCount(grid, (current.x, current.y - 1), [..path], nodeCountVisited);
-            var resRight = GetNodesTraversedWitTimelineCount(grid, (current.x, current.y + 1), [..path], resLeft);
-            return resRight;
-        }
-        else
-        {
-            var res = GetNodesTraversedWitTimelineCount(grid, (current.x + 1, current.y), [..path], nodeCountVisited);
-            return res;
-        }
-    }
-}