All language subtitles for 5. Challenge 1 – Finding Maximum Value in Array

af Afrikaans
ak Akan
sq Albanian
am Amharic
ar Arabic
hy Armenian
az Azerbaijani
eu Basque
be Belarusian
bem Bemba
bn Bengali
bh Bihari
bs Bosnian
br Breton
bg Bulgarian
km Cambodian
ca Catalan
ceb Cebuano
chr Cherokee
ny Chichewa
zh-CN Chinese (Simplified)
zh-TW Chinese (Traditional)
co Corsican
hr Croatian
cs Czech
da Danish
nl Dutch
en English
eo Esperanto
et Estonian
ee Ewe
fo Faroese
tl Filipino
fi Finnish
fr French
fy Frisian
gaa Ga
gl Galician
ka Georgian
de German
el Greek
gn Guarani
gu Gujarati
ht Haitian Creole
ha Hausa
haw Hawaiian
iw Hebrew
hi Hindi
hmn Hmong
hu Hungarian Download
is Icelandic
ig Igbo
id Indonesian
ia Interlingua
ga Irish
it Italian
ja Japanese
jw Javanese
kn Kannada
kk Kazakh
rw Kinyarwanda
rn Kirundi
kg Kongo
ko Korean
kri Krio (Sierra Leone)
ku Kurdish
ckb Kurdish (Soranî)
ky Kyrgyz
lo Laothian
la Latin
lv Latvian
ln Lingala
lt Lithuanian
loz Lozi
lg Luganda
ach Luo
lb Luxembourgish
mk Macedonian
mg Malagasy
ms Malay
ml Malayalam
mt Maltese
mi Maori
mr Marathi
mfe Mauritian Creole
mo Moldavian
mn Mongolian
my Myanmar (Burmese)
sr-ME Montenegrin
ne Nepali
pcm Nigerian Pidgin
nso Northern Sotho
no Norwegian
nn Norwegian (Nynorsk)
oc Occitan
or Oriya
om Oromo
ps Pashto
fa Persian
pl Polish
pt-BR Portuguese (Brazil)
pt Portuguese (Portugal)
pa Punjabi
qu Quechua
ro Romanian
rm Romansh
nyn Runyakitara
ru Russian
sm Samoan
gd Scots Gaelic
sr Serbian
sh Serbo-Croatian
st Sesotho
tn Setswana
crs Seychellois Creole
sn Shona
sd Sindhi
si Sinhalese
sk Slovak
sl Slovenian
so Somali
es Spanish
es-419 Spanish (Latin American)
su Sundanese
sw Swahili
sv Swedish
tg Tajik
ta Tamil
tt Tatar
te Telugu
th Thai
ti Tigrinya
to Tonga
lua Tshiluba
tum Tumbuka
tr Turkish
tk Turkmen
tw Twi
ug Uighur
uk Ukrainian
ur Urdu
uz Uzbek
vi Vietnamese
cy Welsh
wo Wolof
xh Xhosa
yi Yiddish
yo Yoruba
zu Zulu
Would you like to inspect the original subtitles? These are the user uploaded subtitles that are being translated: 1 00:00:00,090 --> 00:00:04,170 Welcome back to another challenging hour C programming chorus. 2 00:00:04,580 --> 00:00:10,490 And in these challenge, your task is to write a program that initializes an array of India jurists. 3 00:00:11,070 --> 00:00:18,000 And these scenes of jurists, of these given array are simply digits representing your phone number. 4 00:00:18,090 --> 00:00:25,920 So, for example, if your phone number is one four oh two nine four five, let's say, then you should 5 00:00:25,920 --> 00:00:28,710 initialize an array of size seven. 6 00:00:29,100 --> 00:00:34,830 And every element of this array should simply be a digit of your phone number. 7 00:00:34,920 --> 00:00:37,770 So the first element of the array would be one. 8 00:00:37,800 --> 00:00:40,740 The second element would be four and so on. 9 00:00:40,860 --> 00:00:46,710 And once you've initialize your array, the program should find out the maximum value, the maximum 10 00:00:46,710 --> 00:00:47,310 digit. 11 00:00:47,460 --> 00:00:47,790 Right. 12 00:00:48,150 --> 00:00:52,380 In this particular array of numbers and printed out on the screen. 13 00:00:52,500 --> 00:00:59,190 So in this example for these particular phone number that we have right now, the program should print 14 00:00:59,480 --> 00:01:04,020 that the maximum value of the next one with a maximum digit is nine. 15 00:01:04,110 --> 00:01:05,200 So good luck, guys. 16 00:01:05,230 --> 00:01:07,410 Sam, I'll see you in the Solutions video. 1578

Can't find what you're looking for?
Get subtitles in any language from opensubtitles.com, and translate them here.