@vikash2162

<?php //Find the 'SUM' of a 'contiguous' subarray within an array of numbers that has the LARGEST sum. Array is [-2, -3, 4, -1, -2, 1, 5, -3]. //Meaning of 'Contiguous Subarray': Any sub series of elements in a given array that are contiguous ie //their indices are continuous. //So given [1,2,3,4,5,6]:[1,2,3], [3,4], [3,4,5,6] are all valid contiguous subarrays

<?php //There is a sorted array with unique elements of length n. //Return all the PAIRS possible that when added gives you Y. //Sample Array: [10, 20, 30, 40, 50, 60, 70, 80, 90, 100] . (Y=110) // 0 , 1, 2, 3, 4, 5, 6, 7, 8, 9 //$arr = [10, 20, 30, 40, 50, 60, 70, 80, 90, 100]; $arr = [-10, -5,0,10, 15, 30, 35, 45, 60, 70, 80, 90, 100]; $sumofPair = 20;

<?php $arr = [7,10,15, 23, 25,40,55,78,98]; $search_element = 1; $end = count($arr) -1;//6 $start = 0; //If mid > element, traverse left OR mid < element, traverse right $found = 0; //echo count($arr)." ".$start; while($end >= $start){

<?php $string = 'geeks quiz practice code'; //MEthod 1 $new_str = ''; $str_arr = explode(' ',$string); for($i=count($str_arr)-1;$i >= 0; $i--){ $new_str .= $str_arr[$i]." ";

<?php $string = 'ONCE UPON A TIME IN MUMBAI'; $count_str = strlen($string); $str = ''; for($i=$count_str-1;$i>= 0;$i--){ $str.= $string[$i]; }

<?php //METHOD 1 $string1 = 'JOHN'; $string2 = 'SMITH'; $count_str1 = strlen($string1); $count_str2 = strlen($string2); if($count_str1 > $count_str2){

<?php $arr = [66,4,26,8,0,3,6]; $total = count($arr); //Version 1 for($j=0; $j<$total;$j++){ for($i=$j+1;$i<$total;$i++){ echo $i." ".$j." dfd ";

<?php class ABC{ function __construct(){ echo 'constructor invoked'; } public function __call($name,$args){

<?php interface paymentMethod{ const DEFAULTPAYMENT = 'visa'; function pay(); } interface paymentMethodNew{

<?php class Person{ private $name; private $age; private static $ourspecies; public function __construct(){ $this->name = 'Aakash';

<?php trait ABC{ public function test(){ echo 'inside ABC trait'; } } trait XYZ{

<?php $arr1 = [2,2,3,4,7]; $arr2 = [-1,1,2,8,10]; $merged_arr = []; $i = 0; $j = 0; $count_arr1 = count($arr1); $count_arr2 = count($arr2);

let arr = [1,9,5,7,8,5,0]; arr.forEach((currvalue,index,arr)=>{ //console.log(currvalue); }) //console.log('Array.forEach') //console.log(arr) let newarr = arr.map((currvalue,index,arr)=> currvalue * 2)

<?php //Eg- Panagram - The quick brown fox jumps over the lazy dog $str = "The quick brown fox jumps over the lazy dog"; $wordarr = array(); for($i=0;$i<strlen($str);$i++){

<?php //Eg- Panagram - The quick brown fox jumps over the lazy dog $str = "Bright vixens jump; dozy fowl quack"; $wordarr = array(); $lettercount = 0; for($i=0;$i<strlen($str);$i++){

<?php $str = "string to be reverse"; echo $str; echo "\n"; //Output 1 = 'esrever eb ot gnirt' $str_length = strlen($str); $revstr = ''; for($i=$str_length;$i > 0;$i--){

<?php ini_set('display_errors', 1); ini_set('display_startup_errors', 1); error_reporting(E_ALL); $str = "JOHN"; $str1 = "SMITH"; if(strlen($str) >= strlen($str1)){ $strtoloop = $str;