تمرین های PHP - مرحله easy - دست نوشته های امیر

تمرین های PHP – مرحله easy

بخش چالش های سایت edabit.com شامل تمرین های برنامه نویسی به زبان پایتون، پی اچ پی، جاوا، جاوااسکریپت، روبی و … را در درجه سختی های مختلف دارد.

فهرست مراحل حل شده:

تمرین های PHP – مرحله easy

در این بخش تمرین های برنامه نویسی پی اچ پی با درجه سختی easy حل شد؛ البته نه همه ی تمرین ها چون تعداد زیادی تمرین موجود هست ولی تمرین های صفحه ی اول حل شد دلیل این موضوع هم ضبط ویدیو بود که نمیخواستم زمان زیادی داشته باشه.

احتمالا کمی مشکل صدا هست که سعی می کنم از ویدیوهای بعدی بهتر پیش برم.

لیست سوالات حل شده:

https://edabit.com/challenge/6cy4ZoxMggJNCBjEa

https://edabit.com/challenge/4uEox3w945f8skbwN

https://edabit.com/challenge/uXkJxdBwE3AA7ww8w

https://edabit.com/challenge/CHvqoJec87KcpXzm6

https://edabit.com/challenge/fRwYWypcJv2Wh2wuS

https://edabit.com/challenge/YzEBRZsefZpWdgvPv

https://edabit.com/challenge/6KoodWTcxo87SFpv6

https://edabit.com/challenge/WGGbqecYMAEAkuTwR

https://edabit.com/challenge/3iiu7oo5EgNrYuXKn

https://edabit.com/challenge/mhHNdTvC2WSrPHqRh

https://edabit.com/challenge/pmbYjCjmbRiJMg2Gk

ویدیوی حل سوالات:

اگر در دیدن ویدیو مشکل دارید با کلیک روی این لینک از آپارات ویدیو رو ببنید.

پیشنهاد نویسنده: اگر نیاز به نرم افزار ویرایش ویدیو دارید این لینک را بخوانید.

کد حل سوالات:

<?php


function largestSwap($number) {

	if($number < 10 || $number > 99)
		return;

	$string = str_split($number);

	$newNumber = $string[1] . $string[0];

	if($number >= $newNumber)
		return "true";
	else
		return "false";
}

echo "largestSwap(27) : " . largestSwap(27) . "<br />";
echo "largestSwap(43) : " . largestSwap(43) . "<br />";
echo "largestSwap(14) : " . largestSwap(14) . "<br />";
echo "largestSwap(53) : " . largestSwap(53) . "<br />";
echo "largestSwap(99) : " . largestSwap(99) . "<br />";



function capMe($arr) {

	$output = array();
	$counter = 0;
	foreach ($arr as $key => $value) {
		$temp1 = str_split($value);
		$temp2 = strtoupper($temp1[0]);

		for($i = 1; $i < strlen($value); $i++)
			$temp2[$i] = strtolower($temp1[$i]);

		$output[$counter] = json_encode($temp2);
		$counter++;
	}

	return $output;

}

print_r(capMe(["mavis", "senaida", "letty"]));
echo "<br /><br />";
print_r(capMe(["samuel", "MABELLE", "letitia", "meridith"]));
echo "<br /><br />";
print_r(capMe(["Slyvia", "Kristal", "Sharilyn", "Calista"]));
echo "<br /><br />";


function highLow($numberString) {
	$numbers = explode(" ", $numberString);

	$min = $numbers[0];
	$max = $numbers[0];

	for ($i=1; $i < count($numbers); $i++) { 
		if($numbers[$i] > $max)
			$max = $numbers[$i];
		elseif ($numbers[$i] < $min)
			$min = $numbers[$i];
	}

	return $max . " " . $min;
}

echo 'highLow("1 2 3 4 5") : ' . highLow("1 2 3 4 5") . "<br />";
echo 'highLow("1 2 -3 4 5") : ' . highLow("1 2 -3 4 5") . "<br />";
echo 'highLow("1 9 3 4 -5") : ' . highLow("1 9 3 4 -5") . "<br />";
echo 'highLow("13") : ' . highLow("13") . "<br />";

function sortNumsAscending($arr) {

	if(is_null($arr))
		return [];

	$tempArr = $arr;
	$count = count($arr);

	for ($i=0; $i < $count ; $i++) {
		for ($j=$i; $j < $count; $j++) { 

			if($tempArr[$i] > $tempArr[$j]) {
				$temp = $tempArr[$i];
				$tempArr[$i] = $tempArr[$j];
				$tempArr[$j] = $temp;
			}
		}
	}

	return $tempArr;

}



print_r(sortNumsAscending([1, 2, 10, 50, 5]));
echo "<br /><br />";
print_r(sortNumsAscending([80, 29, 4, -95, -24, 85]));
echo "<br /><br />";
print_r(sortNumsAscending(null));
echo "<br /><br />";
print_r(sortNumsAscending([]));
echo "<br /><br />";


function factorial($number) {
	$sum = 1;
	for ($i=1; $i <= $number; $i++) { 
		$sum *= $i;
	}
	return $sum;
}

echo "factorial(3) : " . factorial(3) . "<br />";
echo "factorial(5) : " . factorial(5) . "<br />";
echo "factorial(13) : " . factorial(13) . "<br />";


function evenOddPartition($arr) {

	$output = array();
	$output[0] = array();
	$output[1] = array();
	$oddcounter = 0;
	$evencounter = 0;

	$count = count($arr);
	for ($i=0; $i < $count; $i++) { 
		if($arr[$i] == 0 || $arr[$i] % 2 == 0) {
			$output[0][$evencounter] = $arr[$i];
			$evencounter++;
		}
		else {
			$output[1][$oddcounter] = $arr[$i];
			$oddcounter++;
		}
	}

	return $output;

}

echo "<pre />";
print_r(evenOddPartition([5, 8, 9, 2, 0]));
echo "<br /><br />";
print_r(evenOddPartition([1, 0, 1, 0, 1, 0]));
echo "<br /><br />";
print_r(evenOddPartition([1, 3, 5, 7, 9]));
echo "<br /><br />";
print_r(evenOddPartition([]));
echo "<br /><br />";


function hasSpaces($string) {

	$temp = str_split($string);

	for ($i=0; $i < strlen($string); $i++)
		if($temp[$i] === " ")
			return "true";

	return "false";

}

echo 'hasSpaces("hello") : ' . hasSpaces("hello") . "<br/>";
echo 'hasSpaces("hello, world") : ' . hasSpaces("hello, world") . "<br/>";
echo 'hasSpaces(" ") : ' . hasSpaces(" ") . "<br/>";
echo 'hasSpaces("") : ' . hasSpaces("") . "<br/>";
echo 'hasSpaces(",./!@#") : ' . hasSpaces(",./!@#") . "<br/>";


function missingNum($numbers) {

	$sorted = sortNumsAscending($numbers);

	for ($i=0; $i < count($numbers); $i++)
		if($i + 1 != $sorted[$i])
			return $i + 1;

	return 10;


}

echo "missingNum([1, 2, 3, 4, 6, 7, 8, 9, 10]) : " . missingNum([1, 2, 3, 4, 6, 7, 8, 9, 10]).	"<br />";
echo "missingNum([7, 2, 3, 6, 5, 9, 1, 4, 8]) : " . missingNum([7, 2, 3, 6, 5, 9, 1, 4, 8]).	"<br />";
echo "missingNum([10, 5, 1, 2, 4, 6, 8, 3, 9]) : " . missingNum([10, 5, 1, 2, 4, 6, 8, 3, 9]).	"<br />";


function doubleChar($string) {

	$output = "";
	$temp = str_split($string);
	for ($i=0; $i < strlen($string); $i++)
		$output .= $temp[$i] . $temp[$i];

	return $output;
}

echo 'doubleChar("String") : ' . doubleChar("String") . "<br />";
echo 'doubleChar("Hello World!") : ' . doubleChar("Hello World!") . "<br />";
echo 'doubleChar("1234!_ ") : ' . doubleChar("1234!_ ") . "<br />";


function societyName($arr) {

	$output = "";

	foreach ($arr as $key => $value) {
		$temp = str_split($value);
		$output .= $temp[0];
	}

	return $output;

}

echo 'societyName(["Adam", "Sarah", "Malcolm"]) : ' . societyName(["Adam", "Sarah", "Malcolm"]) . "<br /><br />";
echo 'societyName(["Harry", "Newt", "Luna", "Cho"]) : ' . societyName(["Harry", "Newt", "Luna", "Cho"]) . "<br /><br />";
echo 'societyName(["Phoebe", "Chandler", "Rachel", "Ross", "Monica", "Joey"]) : ' . societyName(["Phoebe", "Chandler", "Rachel", "Ross", "Monica", "Joey"]) . "<br /><br />";


function removeDups($arr) {

	$output = array();
	$unique = true;
	$counter = 0;

	for ($i=0; $i < count($arr); $i++) {
		$unique = true;
		for ($j=0; $j < $i; $j++) {
			if($i == $j)
				continue;
			if($arr[$i] === $arr[$j])
				$unique = false;
		}

		if($unique) {
			$output[$counter] = $arr[$i];
			$counter++;
		}

	}

	return $output;
}

print_r(removeDups([1, 0, 1, 0]));
echo "<br /><br />";
print_r(removeDups(["The", "big", "cat"]));
echo "<br /><br />";
print_r(removeDups(["John", "Taylor", "John"]));
echo "<br /><br />";

?>

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

<?php

function largestSwap($number) {

if($number < 10 || $number > 99)

return;

$string = str_split($number);

$newNumber = $string[1] . $string[0];

if($number >= $newNumber)

return "true";

else

return "false";

}

echo "largestSwap(27) : " . largestSwap(27) . " ";

echo "largestSwap(43) : " . largestSwap(43) . " ";

echo "largestSwap(14) : " . largestSwap(14) . " ";

echo "largestSwap(53) : " . largestSwap(53) . " ";

echo "largestSwap(99) : " . largestSwap(99) . " ";

function capMe($arr) {

$output = array();

$counter = 0;

foreach ($arr as $key => $value) {

$temp1 = str_split($value);

$temp2 = strtoupper($temp1[0]);

for($i = 1; $i < strlen($value); $i++)

$temp2[$i] = strtolower($temp1[$i]);

$output[$counter] = json_encode($temp2);

$counter++;

}

return $output;

}

print_r(capMe(["mavis", "senaida", "letty"]));

echo " ";

print_r(capMe(["samuel", "MABELLE", "letitia", "meridith"]));

echo " ";

print_r(capMe(["Slyvia", "Kristal", "Sharilyn", "Calista"]));

echo " ";

function highLow($numberString) {

$numbers = explode(" ", $numberString);

$min = $numbers[0];

$max = $numbers[0];

for ($i=1; $i < count($numbers); $i++) {

if($numbers[$i] > $max)

$max = $numbers[$i];

elseif ($numbers[$i] < $min)

$min = $numbers[$i];

}

return $max . " " . $min;

}

echo 'highLow("1 2 3 4 5") : ' . highLow("1 2 3 4 5") . " ";

echo 'highLow("1 2 -3 4 5") : ' . highLow("1 2 -3 4 5") . " ";

echo 'highLow("1 9 3 4 -5") : ' . highLow("1 9 3 4 -5") . " ";

echo 'highLow("13") : ' . highLow("13") . " ";

function sortNumsAscending($arr) {

if(is_null($arr))

return [];

$tempArr = $arr;

$count = count($arr);

for ($i=0; $i < $count ; $i++) {

for ($j=$i; $j < $count; $j++) {

if($tempArr[$i] > $tempArr[$j]) {

$temp = $tempArr[$i];

$tempArr[$i] = $tempArr[$j];

$tempArr[$j] = $temp;

}

return $tempArr;

}

print_r(sortNumsAscending([1, 2, 10, 50, 5]));

echo " ";

print_r(sortNumsAscending([80, 29, 4, -95, -24, 85]));

echo " ";

print_r(sortNumsAscending(null));

echo " ";

print_r(sortNumsAscending([]));

echo " ";

function factorial($number) {

$sum = 1;

for ($i=1; $i <= $number; $i++) {

$sum *= $i;

}

return $sum;

}

echo "factorial(3) : " . factorial(3) . " ";

echo "factorial(5) : " . factorial(5) . " ";

echo "factorial(13) : " . factorial(13) . " ";

function evenOddPartition($arr) {

$output = array();

$output[0] = array();

$output[1] = array();

$oddcounter = 0;

$evencounter = 0;

$count = count($arr);

for ($i=0; $i < $count; $i++) {

if($arr[$i] == 0 || $arr[$i] % 2 == 0) {

$output[0][$evencounter] = $arr[$i];

$evencounter++;

}

else {

$output[1][$oddcounter] = $arr[$i];

$oddcounter++;

}

return $output;

}

echo "<pre />";

print_r(evenOddPartition([5, 8, 9, 2, 0]));

echo " ";

print_r(evenOddPartition([1, 0, 1, 0, 1, 0]));

echo " ";

print_r(evenOddPartition([1, 3, 5, 7, 9]));

echo " ";

print_r(evenOddPartition([]));

echo " ";

function hasSpaces($string) {

$temp = str_split($string);

for ($i=0; $i < strlen($string); $i++)

if($temp[$i] === " ")

return "true";

return "false";

}

echo 'hasSpaces("hello") : ' . hasSpaces("hello") . " ";

echo 'hasSpaces("hello, world") : ' . hasSpaces("hello, world") . " ";

echo 'hasSpaces(" ") : ' . hasSpaces(" ") . " ";

echo 'hasSpaces("") : ' . hasSpaces("") . " ";

echo 'hasSpaces(",./!@#") : ' . hasSpaces(",./!@#") . " ";

function missingNum($numbers) {

$sorted = sortNumsAscending($numbers);

for ($i=0; $i < count($numbers); $i++)

if($i + 1 != $sorted[$i])

return $i + 1;

return 10;

}

echo "missingNum([1, 2, 3, 4, 6, 7, 8, 9, 10]) : " . missingNum([1, 2, 3, 4, 6, 7, 8, 9, 10]). " ";

echo "missingNum([7, 2, 3, 6, 5, 9, 1, 4, 8]) : " . missingNum([7, 2, 3, 6, 5, 9, 1, 4, 8]). " ";

echo "missingNum([10, 5, 1, 2, 4, 6, 8, 3, 9]) : " . missingNum([10, 5, 1, 2, 4, 6, 8, 3, 9]). " ";

function doubleChar($string) {

$output = "";

$temp = str_split($string);

for ($i=0; $i < strlen($string); $i++)

$output .= $temp[$i] . $temp[$i];

return $output;

}

echo 'doubleChar("String") : ' . doubleChar("String") . " ";

echo 'doubleChar("Hello World!") : ' . doubleChar("Hello World!") . " ";

echo 'doubleChar("1234!_ ") : ' . doubleChar("1234!_ ") . " ";

function societyName($arr) {

$output = "";

foreach ($arr as $key => $value) {

$temp = str_split($value);

$output .= $temp[0];

}

return $output;

}

echo 'societyName(["Adam", "Sarah", "Malcolm"]) : ' . societyName(["Adam", "Sarah", "Malcolm"]) . " ";

echo 'societyName(["Harry", "Newt", "Luna", "Cho"]) : ' . societyName(["Harry", "Newt", "Luna", "Cho"]) . " ";

echo 'societyName(["Phoebe", "Chandler", "Rachel", "Ross", "Monica", "Joey"]) : ' . societyName(["Phoebe", "Chandler", "Rachel", "Ross", "Monica", "Joey"]) . " ";

function removeDups($arr) {

$output = array();

$unique = true;

$counter = 0;

for ($i=0; $i < count($arr); $i++) {

$unique = true;

for ($j=0; $j < $i; $j++) {

if($i == $j)

continue;

if($arr[$i] === $arr[$j])

$unique = false;

}

if($unique) {

$output[$counter] = $arr[$i];

$counter++;

}

return $output;

}

print_r(removeDups([1, 0, 1, 0]));

echo " ";

print_r(removeDups(["The", "big", "cat"]));

echo " ";

print_r(removeDups(["John", "Taylor", "John"]));

echo " ";

کد سوالات در را در گیت هاب ببینید.

3 Comments

دیدگاهتان را بنویسید لغو پاسخ

تمرین های PHP – مرحله easy

لیست سوالات حل شده:

ویدیوی حل سوالات:

کد حل سوالات:

3 Comments

دیدگاهتان را بنویسید لغو پاسخ

راستش اگر نظر منو بخوای میگم اینارو هم بخونی:

مفهوم Clean Code در javascript

آموزش PHP – بررسی زبان برنامه نویسی PHP

لایسنس کد نرم افزارها

آموزش PHP – بررسی سناریو ی پروژه ی ساخت وبسایت شخصی با PHP