Challenge 057 059 LK Perl Python

4 files changed, 216 insertions, 0 deletions

diff --git a/challenge-059/lubos-kolouch/perl/ch-1.pl b/challenge-059/lubos-kolouch/perl/ch-1.pl
new file mode 100644
index 0000000000..66d5a1b60d
--- /dev/null
+++ b/challenge-059/lubos-kolouch/perl/ch-1.pl
@@ -0,0 +1,94 @@
+#!/usr/bin/perl
+use strict;
+use warnings;
+
+package LinkedList;
+
+sub new {
+    my ( $class, $value ) = @_;
+    my $self = {
+        value => $value,
+        next  => undef,
+    };
+    bless $self, $class;
+    return $self;
+}
+
+sub append {
+    my ( $self, $value ) = @_;
+    my $current = $self;
+    while ( defined $current->{next} ) {
+        $current = $current->{next};
+    }
+    $current->{next} = LinkedList->new($value);
+}
+
+sub partition {
+    my ( $self, $k ) = @_;
+    my $less_head;
+    my $greater_head;
+    my $less_tail;
+    my $greater_tail;
+
+    my $current = $self;
+    while ( defined $current ) {
+        if ( $current->{value} < $k ) {
+            if ( defined $less_tail ) {
+                $less_tail->{next} = $current;
+            }
+            else {
+                $less_head = $current;
+            }
+            $less_tail = $current;
+        }
+        else {
+            if ( defined $greater_tail ) {
+                $greater_tail->{next} = $current;
+            }
+            else {
+                $greater_head = $current;
+            }
+            $greater_tail = $current;
+        }
+        $current = $current->{next};
+    }
+
+    if ( defined $less_tail ) {
+        $less_tail->{next} = $greater_head;
+    }
+    else {
+        $less_head = $greater_head;
+    }
+
+    if ( defined $greater_tail ) {
+        $greater_tail->{next} = undef;
+    }
+
+    return $less_head;
+}
+
+sub to_string {
+    my $self    = shift;
+    my $str     = '';
+    my $current = $self;
+    while ( defined $current ) {
+        $str .= $current->{value} . ' → ';
+        $current = $current->{next};
+    }
+    $str .= 'END';
+    return $str;
+}
+
+package main;
+
+my $list = LinkedList->new(1);
+$list->append(4);
+$list->append(3);
+$list->append(2);
+$list->append(5);
+$list->append(2);
+
+print "Original list: ", $list->to_string(), "\n";
+my $k                = 3;
+my $partitioned_list = $list->partition($k);
+print "Partitioned list with k=$k: ", $partitioned_list->to_string(), "\n";
diff --git a/challenge-059/lubos-kolouch/perl/ch-2.pl b/challenge-059/lubos-kolouch/perl/ch-2.pl
new file mode 100644
index 0000000000..70f82c4355
--- /dev/null
+++ b/challenge-059/lubos-kolouch/perl/ch-2.pl
@@ -0,0 +1,28 @@
+#!/usr/bin/perl
+use strict;
+use warnings;
+
+sub count_different_bits {
+    my ( $a, $b ) = @_;
+    my $count = 0;
+    while ( $a > 0 or $b > 0 ) {
+        $count += ( $a % 2 ) ^ ( $b % 2 );
+        $a >>= 1;
+        $b >>= 1;
+    }
+    return $count;
+}
+
+sub sum_different_bits {
+    my @numbers = @_;
+    my $sum     = 0;
+    for my $i ( 0 .. $#numbers ) {
+        for my $j ( $i + 1 .. $#numbers ) {
+            $sum += count_different_bits( $numbers[$i], $numbers[$j] );
+        }
+    }
+    return $sum;
+}
+
+my @input = ( 2, 3, 4 );
+print sum_different_bits(@input), "\n";
diff --git a/challenge-059/lubos-kolouch/python/ch-1.py b/challenge-059/lubos-kolouch/python/ch-1.py
new file mode 100644
index 0000000000..e463f94a8a
--- /dev/null
+++ b/challenge-059/lubos-kolouch/python/ch-1.py
@@ -0,0 +1,69 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+class LinkedList:
+    def __init__(self, value):
+        self.value = value
+        self.next = None
+
+    def append(self, value):
+        current = self
+        while current.next:
+            current = current.next
+        current.next = LinkedList(value)
+
+    def partition(self, k):
+        less_head = None
+        greater_head = None
+        less_tail = None
+        greater_tail = None
+
+        current = self
+        while current:
+            if current.value < k:
+                if less_tail:
+                    less_tail.next = current
+                else:
+                    less_head = current
+                less_tail = current
+            else:
+                if greater_tail:
+                    greater_tail.next = current
+                else:
+                    greater_head = current
+                greater_tail = current
+            current = current.next
+
+        if less_tail:
+            less_tail.next = greater_head
+        else:
+            less_head = greater_head
+
+        if greater_tail:
+            greater_tail.next = None
+
+        return less_head
+
+    def __str__(self):
+        current = self
+        result = []
+        while current:
+            result.append(str(current.value) + " → ")
+            current = current.next
+        result.append("END")
+        return "".join(result)
+
+
+if __name__ == "__main__":
+    linked_list = LinkedList(1)
+    linked_list.append(4)
+    linked_list.append(3)
+    linked_list.append(2)
+    linked_list.append(5)
+    linked_list.append(2)
+
+    print("Original list:", linked_list)
+    k_val = 3
+    partitioned_list = linked_list.partition(k_val)
+    print(f"Partitioned list with k={k_val}:", partitioned_list)
+       
diff --git a/challenge-059/lubos-kolouch/python/ch-2.py b/challenge-059/lubos-kolouch/python/ch-2.py
new file mode 100644
index 0000000000..f482a546d6
--- /dev/null
+++ b/challenge-059/lubos-kolouch/python/ch-2.py
@@ -0,0 +1,25 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+from typing import List
+
+
+def count_different_bits(a: int, b: int) -> int:
+    count = 0
+    while a > 0 or b > 0:
+        count += (a % 2) ^ (b % 2)
+        a >>= 1
+        b >>= 1
+    return count
+
+def sum_different_bits(numbers: List[int]) -> int:
+    total = 0
+    for i in range(len(numbers)):
+        for j in range(i+1, len(numbers)):
+            total += count_different_bits(numbers[i], numbers[j])
+    return total
+
+if __name__ == "__main__":
+    input_list = [2, 3, 4]
+    result = sum_different_bits(input_list)
+    print(result)