Update links

Author: RamyHakam

ArrayProblems/MergeIntervals.php

@@ -2,13 +2,17 @@
 
 namespace Hakam\LeetCodePhp\ArrayProblems;
 
+/**
+ * LeetCode Problem Link : https://leetcode.com/problems/merge-intervals
+ */
 class MergeIntervals
 {
     /**
      * @param Integer[][] $intervals
      * @return Integer[][]
      */
-    function merge($intervals) {
+    public function merge(array $intervals): array
+    {
         usort($intervals,function($i,$j){
             if($i[0] === $j[0])
             {

ArrayProblems/MergeSortedArray.php

@@ -4,17 +4,20 @@
 
 use SplMinHeap;
 
+/**
+ * LeetCode Problem Link : https://leetcode.com/problems/merge-sorted-array
+ */
 class MergeSortedArray
 {
     /**
      * @param Integer[] $nums1
      * @param Integer $m
      * @param Integer[] $nums2
      * @param Integer $n
-     * @return NULL
+     * @return void
      */
 
-    function mergeByHeap(&$nums1, $m, $nums2, $n)
+    public function mergeByHeap(array &$nums1, int $m, array $nums2, int $n): void
     {
         $minHeap = new SplMinHeap();
         for ($index = 0; $index < $m + $n; $index++) {
@@ -28,10 +31,9 @@ function mergeByHeap(&$nums1, $m, $nums2, $n)
         for ($index = 0; $index < $m + $n; $index++) {
             $nums1[$index] = $minHeap->extract();
         }
-        return null;
     }
 
-    function mergeByPointers(&$nums1, $m, $nums2, $n)
+    public function mergeByPointers(&$nums1, $m, $nums2, $n): void
     {
         for ($i = 0; $i < $m; $i++) {
             $nums1Copy[$i] = $nums1[$i];

ArrayProblems/MoveZeroes.php

@@ -2,13 +2,17 @@
 
 namespace Hakam\LeetCodePhp\ArrayProblems;
 
+/**
+ * LeetCode Problem Link : https://leetcode.com/problems/move-zeroes
+ */
 class MoveZeroes
 {
     /**
      * @param Integer[] $nums
-     * @return NULL
+     * @return void
      */
-    function moveZeroes(&$nums) {
+    public function moveZeroes(array &$nums): void
+    {
         foreach ($nums as $i => $iValue) {
             if ($iValue === 0) {
                 unset($nums[$i]);

ArrayProblems/RemoveElement.php

@@ -2,6 +2,9 @@
 
 namespace Hakam\LeetCodePhp\ArrayProblems;
 
+/**
+ * LeetCode Problem Link : https://leetcode.com/problems/remove-element
+ */
 class RemoveElement
 {
     /**

ArrayProblems/ThreeSum.php

@@ -2,20 +2,23 @@
 
 namespace Hakam\LeetCodePhp\ArrayProblems;
 
+/**
+ * LeetCode Problem Link: https://leetcode.com/problems/3sum
+ */
 class ThreeSum
 {
     /**
      * @param Integer[] $nums
      * @return Integer[][]
      */
-    function threeSum($nums)
+    public function threeSum(array $nums): array
     {
         sort($nums);
         $count = count($nums);
         $listOf3Sum = [];
         for ($index = 0; $index < $count; $index++) {
             $number = $nums[$index];
-            if ($index > 0 && $number == $nums[$index - 1]) {
+            if ($index > 0 && $number === $nums[$index - 1]) {
                 continue;
             }
             $leftPointer = $index + 1;
@@ -29,7 +32,7 @@ function threeSum($nums)
                 } else {
                     $listOf3Sum [] = [$number, $nums[$leftPointer], $nums[$rightPointer]];
                     ++$leftPointer;
-                    while (isset($nums[$leftPointer], $nums[$leftPointer - 1]) && $nums[$leftPointer] == $nums[$leftPointer - 1]) {
+                    while (isset($nums[$leftPointer], $nums[$leftPointer - 1]) && $nums[$leftPointer] === $nums[$leftPointer - 1]) {
                         ++$leftPointer;
                     }
                 }

ArrayProblems/TwoSum.php

@@ -2,14 +2,17 @@
 
 namespace Hakam\LeetCodePhp\ArrayProblems;
 
+/**
+ * LeetCode Problem Link: https://leetcode.com/problems/two-sum
+ */
 class TwoSum
 {
     /**
      * @param Integer[] $nums
      * @param Integer $target
      * @return Integer[]
      */
-    function twoSum($nums, $target): array
+    public function twoSum(array $nums, int $target): array
     {
        $hashList = [];
        foreach ($nums as $key => $num)

LinkedList/ReOrderList.php

@@ -2,30 +2,29 @@
 
 namespace Hakam\LeetCodePhp\LinkedList;
 
-
+/**
+ * LeetCode Problem Link: https://leetcode.com/problems/reorder-list
+ */
 class ReOrderList
 {
     /**
      * @param ListNode $head
      * @return NULL
      */
-    function reorderList(ListNode $head) {
+    public function reorderList(ListNode $head)
+    {
         $arrayList = [];
-        $order = new ListNode();
         $copyHead = $head;
-        while($copyHead != null)
-        {
+        while ($copyHead !== null) {
             $arrayList [] = $copyHead;
             $copyHead = $copyHead->next;
         }
-        $head = New ListNode();
+        $head = new ListNode();
         $order = $head;
-        while(!empty($arrayList))
-        {
+        while (!empty($arrayList)) {
             $temp = array_shift($arrayList);
             $tempNext = array_pop($arrayList);
-            if($tempNext !== null)
-            {
+            if ($tempNext !== null) {
                 $tempNext->next = null;
             }
             $temp->next = $tempNext;

LinkedList/ReverseLinkedList.php

@@ -2,14 +2,16 @@
 
 namespace Hakam\LeetCodePhp\LinkedList;
 
+/**
+ * LeetCode Problem Link : https://leetcode.com/problems/reverse-linked-list
+ */
 class ReverseLinkedList
 {
-    public function reverseList(ListNode $node)
+    public function reverseList(ListNode $node): ?ListNode
     {
         $current = $node;
         $prev = null;
-        while($current!==null)
-        {
+        while ($current !== null) {
             $tempNode = $current->next;
             $current->next = $prev;
             $prev = $current;

String/FindAllAnagramsInAString.php

@@ -2,6 +2,9 @@
 
 namespace Hakam\LeetCodePhp\String;
 
+/**
+ * LeetCode Problem Link : https://leetcode.com/problems/find-all-anagrams-in-a-string
+ */
 class FindAllAnagramsInAString
 {
 

String/RemoveAllAdjacentDuplicatesInString.php

@@ -2,6 +2,9 @@
 
 namespace Hakam\LeetCodePhp\String;
 
+/**
+ * LeetCode Problem Link: https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string
+ */
 class RemoveAllAdjacentDuplicatesInString
 {
 

Tree/BinaryTreeLevelOrderTraversal.php

@@ -2,16 +2,17 @@
 
 namespace Hakam\LeetCodePhp\Tree;
 
-use SplQueue;
-
+/**
+ * LeetCode Problem Link : https://leetcode.com/problems/binary-tree-level-order-traversal
+ */
 class BinaryTreeLevelOrderTraversal
 {
     /**
-     * @param TreeNode $root
+     * @param TreeNode|null $root
      * @return Integer[][]
      */
 
-    public function levelOrder($root): array
+    public function levelOrder(?TreeNode $root): array
     {
         if($root === null)
         {
@@ -20,17 +21,13 @@ public function levelOrder($root): array
         $bFT = [];
         $tQ = [];
         $tQ [] = [$root,0];
-        $level = 0;
 
         while(count($tQ) !== 0)
         {
             [$node,$nodeLevel] = array_shift($tQ); //level 0
             $bFT[$nodeLevel][] = $node->val;
-            $level = $nodeLevel;
-            ++$level;
-            if($node->left !== null) {$tQ[] = [$node->left,$level];}
-            if($node->right !== null) {$tQ[] = [$node->right,$level];}
-
+            if($node->left !== null) {$tQ[] = [$node->left,$nodeLevel+1];}
+            if($node->right !== null) {$tQ[] = [$node->right,$nodeLevel+1];}
         }
         return $bFT;
     }