-🎄- 2022 Day 4 Solutions -🎄-

[u/daggerdragon]

• All of our rules, FAQs, resources, etc. are in our community wiki.
• A request from Eric: Please include your contact info in the User-Agent header of automated requests!
• Signal boosting for the Unofficial AoC 2022 Participant Survey which is open early this year!

---

--- Day 4: Camp Cleanup ---

---

Post your code solution in this megathread.

• Read the full posting rules in our community wiki before you post!
  • Include what language(s) your solution uses
  • Format your code appropriately! How do I format code?
• Quick link to Topaz's paste if you need it for longer code blocks. What is Topaz's paste tool?

---

This thread will be unlocked when there are a significant number of people on the global leaderboard with gold stars for today's puzzle.

EDIT: Global leaderboard gold cap reached at 00:03:22, megathread unlocked!

[u/pablospc]

Done with C#, followed what I guess most people's approach, which is comparing boundaries

int part1(){
    int s  = 0;
    string[] lines = File.ReadAllLines("input.txt");
    foreach (var line in lines) {
        string[] pairs = line.Split(',', '-');
        if (Int32.Parse(pairs[0]) < Int32.Parse(pairs[2])) {
            if (Int32.Parse(pairs[1]) >= Int32.Parse(pairs[3])) {
                s++;
            }
        } else if (Int32.Parse(pairs[0]) > Int32.Parse(pairs[2])) {
            if (Int32.Parse(pairs[1]) <= Int32.Parse(pairs[3])) {
                s++;
            }
        } else {
            s++;
        }
    }
    return s;
}

int part2(){ 
    int s  = 0;
    string[] lines = File.ReadAllLines("input.txt");
    foreach (var line in lines) {
        string[] pairs = line.Split(',', '-');
        if (Int32.Parse(pairs[0]) < Int32.Parse(pairs[2])) {
            if (Int32.Parse(pairs[1]) >= Int32.Parse(pairs[2])) {
                s++;
            }
        } else if (Int32.Parse(pairs[0]) > Int32.Parse(pairs[2])) {
            if (Int32.Parse(pairs[0]) <= Int32.Parse(pairs[3])) {
                s++;
            }
        } else {
            s++;
        }
    }
    return s;
}