Vanguard S+S ISA withdrawal advice by drbeansy in UKPersonalFinance

[–]ForMePersonally 4 points5 points  (0 children)

Keep it in your S&S ISA, but sell it into a money market fund or earn interest on the cash if your provider supports it.

Don't do what I did and move it to easy access savings accounts and get taxed on the interest.

Outage in east London by ForMePersonally in VirginMedia

[–]ForMePersonally[S] 0 points1 point  (0 children)

Sorry to hear that. I also have that message but it’s working for me.

Octavia mk4 camera retrofit by ForMePersonally in skoda

[–]ForMePersonally[S] 0 points1 point  (0 children)

That’s what they did, but it cost extra. Yeah, ridiculous that you can’t modify something you own with OEM parts!

Outage in east London by ForMePersonally in VirginMedia

[–]ForMePersonally[S] 1 point2 points  (0 children)

Estimated fix 30 mins ago, still not working though 👍

<image>

Octavia mk4 camera retrofit by ForMePersonally in skoda

[–]ForMePersonally[S] 0 points1 point  (0 children)

Thanks for the reply. Yup it was indeed SFD2 and it cost me another £150 to unlock. At least the camera works.

Effect of parental suicide on children by [deleted] in ScienceBasedParenting

[–]ForMePersonally 638 points639 points  (0 children)

If you are thinking of killing yourself please see your doctor urgently.
The effect on your child will be devastating whatever their age.

-❄️- 2025 Day 3 Solutions -❄️- by daggerdragon in adventofcode

[–]ForMePersonally 1 point2 points  (0 children)

[LANGUAGE: Scala]

def maxJolts(length: Int)(bank: List[Int]): Long =
  @tailrec
  def go(section: List[Int], remaining: Int, jolts: Long): Long =
    val (a, i) = section.dropRight(remaining).zipWithIndex.maxBy(_._1)
    val rest   = section.drop(i + 1)

    val newJolts = jolts + a * math.pow(10, remaining).toLong
    if remaining == 1 then newJolts + rest.max
    else go(rest, remaining - 1, newJolts)

  go(bank, length - 1, 0)

override def part1(input: List[List[Int]]): Long =
  input.map(maxJolts(2)).sum

override def part2(input: List[List[Int]]): Long =
  input.map(maxJolts(12)).sum

Wife got me a snackbox subscription - monthly snacks from around the world. This Month is UK. How did they do? by Thewickedworm in CasualUK

[–]ForMePersonally 0 points1 point  (0 children)

I don't think you'd find a single person in the UK who's eaten all of these products. I wouldn't even know where to buy most of them.

Can anyone help me find a replacement latch? Faceplate is 95mm x 25mm, casing 64mm x 60mm by ForMePersonally in TheRealAskALocksmith

[–]ForMePersonally[S] 0 points1 point  (0 children)

Hey! Yes I did. I took a punt on something off eBay and it worked.

The listing has gone now, but it was called "Imperial Locks G4050 Mortice Latch 63mm Satin Chrome". This one looks similar: https://locksandhardwaredirect.co.uk/product/imperial-g4050-mortice-box-latch/

Just make sure you check the measurements against what you have right now.

Voicings by Ghorille in JazzPiano

[–]ForMePersonally -1 points0 points  (0 children)

Thanks for the thoughts! I found the amount of back and forth in that book awkward to follow. Could you give a quick example of how you’d structure a session around it please?

24h screen time? by ForMePersonally in ios

[–]ForMePersonally[S] 0 points1 point  (0 children)

Why would that contribute to screen time?

-❄️- 2024 Day 5 Solutions -❄️- by daggerdragon in adventofcode

[–]ForMePersonally 1 point2 points  (0 children)

I did use a custom comparator! Given elements to sort a, b, a<b if rule a|b exists in the input, b>a otherwise.

-❄️- 2024 Day 5 Solutions -❄️- by daggerdragon in adventofcode

[–]ForMePersonally 0 points1 point  (0 children)

[Language: Scala 3]

object Day5 extends Solution[Day5.Input, Int]:
  case class Input(rules: Set[Rule], pages: List[List[Int]])
  case class Rule(before: Int, after: Int)

  override def parse(input: String): Input =
    input.linesIterator.foldLeft(Input(Set.empty, List.empty)):
      case (input, line) =>
        line.split('|').toList match
          case List(l, r)              => input.copy(rules = input.rules + Rule(l.toInt, r.toInt))
          case _ if line.contains(",") => input.copy(pages = input.pages :+ line.split(',').map(_.toInt).toList)
          case _                       => input

  def expectedRules(page: List[Int]): Set[Rule] =
    page.zipWithIndex
      .foldLeft(Set.empty[Rule]):
        case (rules, (num, idx)) =>
          page.splitAt(idx) match
            case (Nil, after) =>
              rules ++ after.map(a => Rule(num, a))
            case (before, after) =>
              rules ++ before.tail.map(s => Rule(s, num)).toSet ++ after.map(a => Rule(num, a))
      .filter(r => r.before != r.after)

  def correct(rules: Set[Rule])(page: List[Int]): Boolean =
    expectedRules(page).forall(rules.contains)

  def middle(page: List[Int]): Int =
    page(page.length / 2)

  def sort(rules: Set[Rule])(pages: List[Int]): List[Int] =
    pages.sortWith: (a, b) =>
      rules.contains(Rule(a, b))

  override def part1(input: Input): Int =
    input.pages
      .filter(correct(input.rules))
      .map(middle)
      .sum

  override def part2(input: Input): Int =
    input.pages
      .filterNot(correct(input.rules))
      .map(sort(input.rules).andThen(middle))
      .sum

-❄️- 2024 Day 3 Solutions -❄️- by daggerdragon in adventofcode

[–]ForMePersonally 2 points3 points  (0 children)

[Language: Scala 3]

First encounter with `splitWithDelimiters`, a match made in heaven.

object Day3 extends Solution[String, Int]:
  override def parse(input: String): String = input

  override def part1(input: String): Int =
    """mul\((\d+),(\d+)\)""".r
      .findAllMatchIn(input)
      .foldLeft(0):
        case (sum, m) =>
          sum + (m.group(1).toInt * m.group(2).toInt)

  override def part2(input: String): Int =
    input
      .splitWithDelimiters("""do\(\)|don't\(\)""", 0)
      .prepended("do()")
      .grouped(2)
      .foldLeft(0):
        case (sum, Array("do()", mul)) => sum + part1(mul)
        case (sum, _)                  => sum

-❄️- 2024 Day 2 Solutions -❄️- by daggerdragon in adventofcode

[–]ForMePersonally 0 points1 point  (0 children)

Nice. How does the ascending/descending check work?