From fec0a3a9a3e9aa82ae07a08b9d9d91571e2f5f0f Mon Sep 17 00:00:00 2001
From: Fung Cheok Yin <61836418+E7-87-83@users.noreply.github.com>
Date: Wed, 19 Aug 2020 10:25:23 +0800
Subject: Rename ch-2.pl to challenge-074/cheok-yin-fung/perl/ch-2.pl

---
 ch-2.pl                                   | 48 -------------------------------
 challenge-074/cheok-yin-fung/perl/ch-2.pl | 48 +++++++++++++++++++++++++++++++
 2 files changed, 48 insertions(+), 48 deletions(-)
 delete mode 100644 ch-2.pl
 create mode 100644 challenge-074/cheok-yin-fung/perl/ch-2.pl

diff --git a/ch-2.pl b/ch-2.pl
deleted file mode 100644
index bae04b73b3..0000000000
--- a/ch-2.pl
+++ /dev/null
@@ -1,48 +0,0 @@
-#!/usr/bin/perl
-# Perl Weekly Challenge #074 Task 2 FNR character
-# task statement:
-# You are given a string $S.
-# Write a script to print the series of
-#  first non-repeating character 
-# (left -> right) for the given string. 
-#  Print # if none found.
-# Usage: ch-2.pl [string]
-
-use strict;
-use warnings;
-#use Test::More tests => 5;
-
-sub fnr {
-    my @uniquestack;
-    my %charcount;
-    my $ans = "";
-    my @characters = split //, $_[0];
-    for my $char (@characters) {
-        if (!exists $charcount{$char} ) {
-            push @uniquestack , $char;
-            $charcount{$char} = 1;
-            $ans .= $char;
-        } 
-        else {
-            $charcount{$char}++;
-            @uniquestack = grep { $charcount{$_} == 1 } @uniquestack;
-            $ans .= (scalar @uniquestack != 0) ? $uniquestack[-1]  : "#";
-        }
-    }
-    return $ans;
-
-}
-
-print fnr("$ARGV[0]");
-
-=pod
-is_deeply( fnr("ababc") , "abb#c", "example1 provided");
-is_deeply( fnr("xyzzyx") , "xyzyx#", "example2 provided");
-is_deeply( fnr("abcdef") , "abcdef", "trival");
-is_deeply( fnr("aaabbb") , "a##b##", "repeats");
-is_deeply( fnr(
-  "thequickbrownfoxjumpsoverthelazydog") , 
-  "thequickbrownffxjjmpssvvvvvvlazyddg",
-  "long sentence"
-);
-=cut
diff --git a/challenge-074/cheok-yin-fung/perl/ch-2.pl b/challenge-074/cheok-yin-fung/perl/ch-2.pl
new file mode 100644
index 0000000000..bae04b73b3
--- /dev/null
+++ b/challenge-074/cheok-yin-fung/perl/ch-2.pl
@@ -0,0 +1,48 @@
+#!/usr/bin/perl
+# Perl Weekly Challenge #074 Task 2 FNR character
+# task statement:
+# You are given a string $S.
+# Write a script to print the series of
+#  first non-repeating character 
+# (left -> right) for the given string. 
+#  Print # if none found.
+# Usage: ch-2.pl [string]
+
+use strict;
+use warnings;
+#use Test::More tests => 5;
+
+sub fnr {
+    my @uniquestack;
+    my %charcount;
+    my $ans = "";
+    my @characters = split //, $_[0];
+    for my $char (@characters) {
+        if (!exists $charcount{$char} ) {
+            push @uniquestack , $char;
+            $charcount{$char} = 1;
+            $ans .= $char;
+        } 
+        else {
+            $charcount{$char}++;
+            @uniquestack = grep { $charcount{$_} == 1 } @uniquestack;
+            $ans .= (scalar @uniquestack != 0) ? $uniquestack[-1]  : "#";
+        }
+    }
+    return $ans;
+
+}
+
+print fnr("$ARGV[0]");
+
+=pod
+is_deeply( fnr("ababc") , "abb#c", "example1 provided");
+is_deeply( fnr("xyzzyx") , "xyzyx#", "example2 provided");
+is_deeply( fnr("abcdef") , "abcdef", "trival");
+is_deeply( fnr("aaabbb") , "a##b##", "repeats");
+is_deeply( fnr(
+  "thequickbrownfoxjumpsoverthelazydog") , 
+  "thequickbrownffxjjmpssvvvvvvlazyddg",
+  "long sentence"
+);
+=cut
-- 
cgit