PHP and Javascript solutions to moderate challenge #11 - Lowest common ancestor

Author: pascal-bourut

moderate/11 - Lowest Common Ancestor/11.js

@@ -0,0 +1,43 @@
+// https://www.codeeval.com/open_challenges/11/
+
+/*   30
+    |
+  ____
+  |   |
+  8   52
+  |
+____
+|   |
+3  20
+    |
+   ____
+  |   |
+  10 29
+*/
+
+var ancestors = {
+    '29': ['29','20','8','30'],
+    '10': ['10','20','8','30'],
+    '20': ['20','8','30'],
+    '3': ['3','8','30'],
+    '8': ['8','30'],
+    '52': ['52','30'],
+    '30': ['30']
+};
+
+var fs = require("fs");
+fs.readFileSync(process.argv[2]).toString().split('\n').forEach(function (line) {
+    line = line.trim();
+    if( line !== '' ){
+        var tmp = line.split(' ');
+        var a_ancestors = ancestors[tmp[0]];
+        var b_ancestors = ancestors[tmp[1]];
+        for(var i = 0, cnt = a_ancestors.length ; i < cnt ; i++){
+            var a_ancestor = a_ancestors[i];
+            if( -1 !== b_ancestors.indexOf(a_ancestor) ){
+                console.log( a_ancestor );
+                break;
+            }
+        }
+    }
+});

moderate/11 - Lowest Common Ancestor/11.php

@@ -0,0 +1,62 @@
+<?php
+header('Content-Type: text/plain; charset=utf-8');
+
+// https://www.codeeval.com/open_challenges/11/
+
+if( isset($_GET['f_i_l_e']) && $_GET['f_i_l_e'] ) $argv[1] = $_GET['f_i_l_e'];
+
+if( isset($argv[1]) && $argv[1] ){
+    $filename = $argv[1];
+    if( file_exists($filename) ){
+        if( is_readable($filename) ){
+            $fp = fopen($filename, 'r');
+            if( $fp ){
+                
+                $ancestors = array(
+                    '29' => array('29','20','8','30'),
+                    '10' => array('10','20','8','30'),
+                    '20' => array('20','8','30'),
+                    '3' => array('3','8','30'),
+                    '8' => array('8','30'),
+                    '52' => array('52','30'),
+                    '30' => array('30')
+                );
+                
+                while ( $fp && !feof( $fp ) ) {
+                    $line = trim(fgets($fp));
+                    if( $line ){
+                        list($a,$b) = explode(' ',$line);
+                        $a_ancestors = $ancestors[$a];
+                        $b_ancestors = $ancestors[$b];
+                        
+                        for($i = 0, $cnt = count($a_ancestors) ; $i < $cnt ; $i++){
+                            $a_ancestor = $a_ancestors[$i];
+                            if( false !== array_search($a_ancestor,$b_ancestors) ){
+                                echo $a_ancestor."\n";
+                                break;
+                            }
+                        }
+                    }
+                    
+                }//
+                fclose( $fp );
+            }
+            else{
+                echo '!fp'."\n";
+            }
+        }
+        else{
+            echo '!readable'."\n";
+        }
+    }
+    else{
+        echo '!file_exists'."\n";
+    }
+}
+else{
+    echo '!argv[1]'."\n";
+}
+
+exit(0);
+
+?>

moderate/11 - Lowest Common Ancestor/test.txt

@@ -0,0 +1,20 @@
+30 8
+52 30
+20 10
+10 29
+3 10
+29 52
+52 20
+30 29
+20 29
+8 20
+8 52
+8 52
+29 30
+30 29
+52 8
+3 52
+29 8
+30 29
+29 3
+52 29