Merge branch 'solve' of https://github.com/Amir-16/leetcode-problem-solutions

Author: Amir-16

Easy/1.Two-sum/solution.py

@@ -0,0 +1,40 @@
+<?php
+
+class Solution
+{
+    public function checkStraightLine(array $coordinates)
+    {
+        $n = count($coordinates);
+
+        if ($n <= 2) {
+            return true;
+        }
+
+        // Calculate vectors and check cross product for collinearity
+        $vector1 = [$coordinates[1][0] - $coordinates[0][0], $coordinates[1][1] - $coordinates[0][1]];
+
+        for ($i = 2; $i < $n; $i++) {
+            $vector2 = [$coordinates[$i][0] - $coordinates[0][0], $coordinates[$i][1] - $coordinates[0][1]];
+
+            // Calculate cross product
+            $crossProduct = ($vector1[0] * $vector2[1] ) - ($vector1[1] * $vector2[0]);
+
+            // If cross product is non-zero, points are not collinear
+            if ($crossProduct !== 0) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+}
+
+$solution = new Solution();
+
+$coordinates = [[0, 0], [0, 1], [0, -1]];
+
+$result = $solution->checkStraightLine($coordinates);
+
+echo $result;
+
+?>

Easy/1232. Check If It Is a Straight Line/solution.php

@@ -1,21 +1,16 @@
 <?php
 
-class Solution{
-
-
-    /**
-     * @param String[] $strs
-     * @return String
-     */
-    function longestCommonPrefix($strs)
+class Solution
+{
+    public function longestCommonPrefix($strs)
     {
         $first = array_shift($strs);
         $check_match = str_split($first);
         $length = count($check_match);
 
-       // print_r($length);
         $prefix = '';
         for ($i = 0; $i <= $length; $i++) {
+            
             foreach ($strs as $str) {
                 if (!isset($str[$i])) {
                     break 2;
@@ -32,7 +27,9 @@ function longestCommonPrefix($strs)
 
 }
 
-
 $solution = new Solution();
 
-$solution->longestCommonPrefix(["flower", "flow", "flight"]);
+$solution->longestCommonPrefix(["flower", "flow", "flight"]);
+
+
+?>

Easy/14.Longest common prefix/sl.php

@@ -0,0 +1,27 @@
+<?php
+
+class Solution
+{
+   public  function isAnagram($s, $t)
+    {
+        if (strlen($s) != strlen($t)) {
+            return false;
+        }
+
+        $array1 = count_chars(strtolower($s));
+        $array2 = count_chars(strtolower($t));
+
+        //match check for invalid characters
+        if (!empty(array_diff_assoc($array2, $array1))) {
+            return false;
+        }
+        if (!empty(array_diff_assoc($array1, $array2))) {
+            return false;
+        }
+
+        return true;
+    }
+
+}
+
+?>

Easy/14.Longest common prefix/solution.php

@@ -0,0 +1,17 @@
+<?php
+
+class Solution
+{
+    public function strStr($haystack, $needle)
+    {
+
+        $position = strpos($haystack, $needle);
+
+        if ($position !== false) {
+            return $position;
+        } else {
+            return -1;
+        }
+
+    }
+}

Easy/242.Valid Anagram/Solution.php

@@ -0,0 +1,9 @@
+<?php
+
+class Solution
+{
+    public function findTheDifference($s, $t)
+    {
+
+    }
+}

Easy/28. Find the Index of the First Occurrence in a String/Solution.php

@@ -0,0 +1,40 @@
+<?php
+class ListNode
+{
+    public $val = 0;
+    public $next = null;
+
+    public function __construct($val = 0, $next = null)
+    {
+        $this->val = $val;
+        $this->next = $next;
+    }
+}
+
+class Solution
+{
+    public function mergeTwoLists($list1, $list2)
+    {
+        $dummy = new ListNode();
+        $current = $dummy;
+
+        while (!empty($list1) && !empty($list2)) {
+            if ($list1->val < $list2->val) {
+                $current->next = $list1;
+                $list1 = $list1->next;
+            } else {
+                $current->next = $list2;
+                $list2 = $list2->next;
+            }
+            $current = $current->next;
+        }
+
+        if (!empty($list1)) {
+            $current->next = $list1;
+        } elseif (!empty($list2)) {
+            $current->next = $list2;
+        }
+
+        return $dummy->next;
+    }
+}

Easy/389. Find the Difference/solution.php

@@ -0,0 +1,29 @@
+<?php
+class Solution
+{
+
+    public function multiply(string $num1, string $num2)
+    {
+        $m = strlen($num1);
+        $n = strlen($num2);
+        $result = array_fill(0, $m + $n, 0);
+
+        for ($i = $m - 1; $i >= 0; $i--) {
+            for ($j = $n - 1; $j >= 0; $j--) {
+                $multiply = intval($num1[$i]) * intval($num2[$j]);
+                $sum = $multiply + $result[$i + $j + 1];
+
+                $result[$i + $j] += intdiv($sum, 10);
+                $result[$i + $j + 1] = $sum % 10;
+            }
+        }
+
+        $resultString = implode('', $result);
+
+        $resultString = ltrim($resultString, '0');
+
+
+        return $resultString === '' ? '0' : $resultString;
+    }
+
+}

Medium/21. Merge Two Sorted Lists/solution.php

@@ -0,0 +1,16 @@
+var myPow = function (x, n) {
+    if (n === 0) return 1;
+    if (n > 0) return pow(x, n);
+    if (n < 0) return 1 / pow(x, -n);
+};
+
+var pow = function (x, n) {
+    if (n === 1) return x;
+    var num = pow(x, Math.floor(n / 2));
+    if (n % 2 === 0) {
+        return num * num;
+    } else {
+        return x * num * num;
+    }
+};
+