Question 1: Tail recursion | Py uo coin weattaditon hte XRD Hackertans Question aueston 1 SG & hackerrank com/test/211i7¢)4nc7/questions/8jkrch4shr SAMER Wn G dastercom Answere The string Sis initially empty. The following can be performed on Sany number of times. 1. Append any character to Sfor a cost of 5 points. 2. Copy any substring of Sthat ends at the current rightmost character. Append it to Sfor a cost of 5 points, What is the minimum cost to construct the string “abhihibhihi"? Pick ONE option BBQ Search --- [PAGE/IMAGE BREAK] --- UESTION. 4 UP Aptitude: 10h Direction: Three of the words win Taining Or Will Not be. Your arevatr willbe the si the otic NE WOT that does NOT be oe ar Bullmastiff Cougar Great Dane Beagle: 12 13 --- [PAGE/IMAGE BREAK] --- 27 ON Apaleal Reasoniog! ayant p Direction: Read the follewing informs SP ae answer Ihe qLiestions gilsh hela, Thete are eight players P. "9. ps. q> 45 rand 'W, Whe are split into two tennis eer dling to the Following conditions OF and’0\cannot be in the same x YBa’ cannot be in the same team YU arid V" are always in the same te a uestionsifP and V-are in one tearm hich of the following t mber \e ot y RW, RUT Q.'S! TW 10 11 --- [PAGE/IMAGE BREAK] --- QUESTIONS “EROUP: apueuae TION Logical Reasoning Maris) Direction: Res the following infexiatior ‘nd answer the questiona given betew, There are eight players 'P. ‘gg 2 Vania W, who are split io twa teams o OFCIIG to the following conditions WRand’s' 5 inthe ‘Cannot be jn the same Wand 'V are always oa Qa tic Wh th ‘ Wuestion: Which oF th & S:'U; V' may be there in a team, PLS, 'T, W may be there in a team 10 O'R, TW 7 12 13 --- [PAGE/IMAGE BREAK] --- ; - = 2 =. — — ——— ————I © 2 : Pee a =~ “4 —— = —— — a ae — = ; ; — a! - D9 ke P a - os j ks. +3 es b Es * s aa, = ies . Aa By " ’ ite a ote A Bit s --- [PAGE/IMAGE BREAK] --- — aes — © inetwuction =. a ae a _ 12. QUSHON =} foo ES RONG SS TEs pei a ee J 6S sS558 pe Maphadio nF ‘SECTION, Po Re << - 4! "toa Se viA fs yo aoent ee , inf > Mn, = Sates 2 Nid * eee ABN Goes: OMetres due Past and theca co SS i - i! OU metres = el! iS Ra at AR POhT . BN NTN RC en ta <a WAYMAN A liter eal, aoe ei eee Pie metas _ > : i (2 ae en ae tle mk " th a , wet a Sia — — Png Nak ee nen = Fal do at 4 ae er, ith rely eS “! 20 ) ri det ea mt iy is Wes is - we . : ai : - aa : "a ; i | a ' : eas | Ly = “ie hy : cae el Su) aw fil. ‘il hy: 25 “ --- [PAGE/IMAGE BREAK] --- — aes — © inetwuction =. a ae a _ 12. QUSHON =} foo ES RONG SS TEs pei a ee J 6S sS558 pe Maphadio nF ‘SECTION, Po Re << - 4! "toa Se viA fs yo aoent ee , inf > Mn, = Sates 2 Nid * eee ABN Goes: OMetres due Past and theca co SS i - i! OU metres = el! iS Ra at AR POhT . BN NTN RC en ta <a WAYMAN A liter eal, aoe ei eee Pie metas _ > : i (2 ae en ae tle mk " th a , wet a Sia — — Png Nak ee nen = Fal do at 4 ae er, ith rely eS “! 20 ) ri det ea mt iy is Wes is - we . : ai : - aa : "a ; i | a ' : eas | Ly = “ie hy : cae el Su) aw fil. ‘il hy: 25 “ --- [PAGE/IMAGE BREAK] --- nat Posie dap eee lO de . WAIN tte ete NAAN TEA a te : ml Hit US NN oS {re 5 Nae PEM) ALT 7 i. en te a ANUT } 1! } —- a re. i ¥ = Seinen ant ee ee Ce Pet SHINee UNIT ue * “aa ia 1 ‘ i i} 1 j Bi: . (Onto Be. f Peieoaie i = ’ a “ :) Pah “ie 4 4 aie! + a aes Be it) Bs sé ta i " 4 iT --- [PAGE/IMAGE BREAK] --- OME. a, Antitude. SUCTION, Pussten Mackay, 4 POW AAY BU pis of lottera are there in ine or! SHIPWRECKING: 6 MINER Hodes many ‘eters bowen then (from bonny icles) ny a > (_ Previous Question ) --- [PAGE/IMAGE BREAK] --- eae’ Reasoning Direction: Read the follow, V INFOrmation and answer the ¢ Uestion's given be TPES Be eight players’P, QRS. p> 1y Wand W, who are split into 1 WR ana ae and 'V are z Questio 13 Marka). ANB AGOTTNg to the following - (Next question Conditions --- [PAGE/IMAGE BREAK] --- \ NY O0:27:93, " se ABIL Marwan } wl — 1 Be) The average OXPeNitunes OMe hotel When there HE 10 Guests ig RS/60 per Suess and the AYERS expenditure 18 Re: AD Winery Wier ae 46 quene JENS Freer Wat. Mere are 10 SOM fixed expenses irespedtive Ol thenumberot S4ests the tind tye BVETAGE exbenditure per NEST When there ATE AD Quest Ih the Fraret q2 | . a Rs. 20 13 xy cS Rs. 25 ee a “a e Cannot be determined t — - 2 (Previous cvesion (Rasen) --- [PAGE/IMAGE BREAK] --- i OTe) Rays: Aptitude secrioy Quant Math Abiity OMB 2nd 'C can conipie te They Start doing the jo. 9196 in 20 cle WBE Ad (©) ear complete: the same job iH 8 3/4, ‘dye Workdtg together Kia TERENHALEAIY one person work ID ON day starting witht tolowee PYIBWA aha C IF was pal Ry ‘AAO per ay. ver ten Job? Rs. 720 Rs. 840 Rs. 630 Rs. 735 --- [PAGE/IMAGE BREAK] --- OUP Aptitude seerioy tegteal Reasoning — Maikin) 4 Direction: Study the Information given below and answer the ‘question that follows: Esha and Fahad are made to more information is given below, “Stone in'8 row according te their elds the ane ‘WMO Is the tales BaNGaN =: Rothe shortest and height of Esha betwen bi The height of Arun is mc Daman is taller thar aman and Babeeta respectively fe than only 4 people in the grou 1 Fahad whi horter than @; t among all the friend: Chandan Daman Esha --- [PAGE/IMAGE BREAK] --- QUESTION 14 ‘GROUP: Aptitude and Kumar sotd the same cs SORIA 8 Prot ot Oso Rasa 15% 10% --- [PAGE/IMAGE BREAK] --- Sik friends namely Arun, Babee, fa, Chandan, Daman, t #0°0n: Some more information IS given below, + Chandan is nor the shortest and height of € EThe height of arun is mote than J -Paman is taller than ¢ ‘ Question: What is the ‘sha'is betwen Daman and Babeeta respectively, only 4 people in the ‘ahad who is si shorter than Babeeta group, SUM of the ranks of Esha and Fahad 10 8 4] --- [PAGE/IMAGE BREAK] --- 22 23 fay INS tle Stifriends namely Arun, Babseta, Chandan, bi man, Esha and Fahad Boon: Some more information is given bel Chandan'ts not the shortest and height of Esha Is be The height of Arun ls more than only 4 people in the oy Sup, Datmanis taller than Fahad who js shorter than Bat ta Esha Babeeta Damar ate matte to'st wen Daman and Babeeta resp bimiation given Belo and answer the quesion that follows, ous Question tively ond In row accoreigng te thelt helghts.The ane yaya a te: Tallest ie goin ‘Next Question --- [PAGE/IMAGE BREAK] --- a ; RCM OVERS Ly) a a = Sanat Matty, bility) © aucune SAL EG)- ~ ra wees el mets, J Ae ANG . nd f fii 4, = oe aa —_ . 7: aa a | a vey. : a ey oe —=—— US ae ¥ ARE — roe - —-==— MOTE ALL see! e220 ,57) a ’ 2; =e ' a 1 $ --- [PAGE/IMAGE BREAK] --- 14 1s 16 17 1B On 20 21 QUESTION. 19 — Gouns Aputide "Math Abily — sdaiueay 4 I the circisntorence ofa eiretelk Oda eR (Hon what i the radia Of the ciel (rakes sr = 2a7qy 490 em 280 cm 630 cm 560.cm --- [PAGE/IMAGE BREAK] --- GRESTIONS 28 Shue. Aptitude SEcTiow PUzal6e = o\Maiktsj4 Pe: Which one or the OPNONG(s a‘relatey and Necessary ake of tte Woy ABieteos: SVEN telow Gymnasium Auditorium Assembly | © Unanswer --- [PAGE/IMAGE BREAK] --- a _ St , 14 ON 20 GRoup. Abtitude Fing the m..: SECTION: p a Missing "UME in the au Puzzles Hee 17 16 ote 8 18 7 9 F ‘ | ; an . 21 a F 25 4 22 a --- [PAGE/IMAGE BREAK] --- days (Mondaee: BSNS Ptah a pany, Will Get. forte we nate wh cet SOOT EVE, Press '\1 MONA STH BS ay) aaa een OES ae MOTO) LBL TA Ry 4 BA) if A iF, ee ; Pe Ae Wig Pe eee — —— a ee iit OLE ee IA Jan = Bll Pls Gs Ss suet tac pe a SS , Ali Lh tia acre a ae he . TTP = or. a) ee cares % ie, ae a ‘ 7 wt oor ecu tert 7 4 =. PME Te — = seam * i ' ~ be y ht a < - . As =) =--- [PAGE/IMAGE BREAK] --- ral Network models, Work The tung, Work have many eifte 998 of intelligence =o. 8 male ot A aSeumpttve mate lamentals of how nex: Fences. We have by Along way to go Of research anc} Cay Feputed institutions dataset (ike Andrew Pavers published from * the problem of having Ng says) the right Pinion 4: Artificial intel advances in soph ‘mislead I9ENCE is plagued by isticated, technologi US to think that they are re bybe while the More Of improved and intelligent but we are yet to unc reality is gui different. The latest ntelligence ticulous engi lerstand what even is, cP resonates more with your unc °¥ tt resonates with you, you do you trust those facts ur percep) and perceptions? Gnd facts that you may know. How 5) D --- [PAGE/IMAGE BREAK] --- FERIA IC doesnot tnn vn equ owe fs 1's, but 110010 ditions. ack can contain multiple good substrings, If two consecutive substrings are good, then they can be ng.as the resulting string is still a good string. Given a good binary string, binString, perform zero or sys ‘Operations on its adjacent good substrings such that the resulting string is the largest possible numeric lue, Two substrings are Saat if the last character of the first substring occurs exactly one index before the first. SS Substrings, 1070. and 171000, among others. Swap these two substrings to get a’ larger 70, This is the largest possible good string that can be formed. rgestMagical in the editor below. Function Parameters str binstring: a binary string --- [PAGE/IMAGE BREAK] --- _ Function Description be _ we fs . ta \e Function Parameters 19 | « the function 4s Str binString: a binary string 4 # The function ac ‘| Returns * 2 str:the largest possible binary value as a string ver fz 24 \ + Yo return th Constraints static allocat * 1 /binString/ <50 21 * char® ret * binStringis a good string 28 . stat’ 2 * 30 * ret » Input Format For Custom Testing 3. * } 32 * v Sample Case 0 33. * chara 34 \ : Sample Input 0 8) STDIN Function Parameters 36 * SSSR 3T * 11011000 > binString = "11011000" 38 * 39 xy 26 Sample Output 0 49 ze * 11100100 4. 42- ch 27 Explanation 0 43 . < : a i r= 11100100. Choose two adjacent good substrings to swap: 10 and 1100, The resultant string, st a 20. --- [PAGE/IMAGE BREAK] --- * Complete the 'FindEquiv * The function is e * The function accepts following paramete WEIGHTED_INTEGER GRAPH unit 2. INTEGER x he weighted graph, : 1. The number of nodes is _nodes. * 2. The number of edges is edges + An edge exists between <n; jame>_from(i] and. _toli]. The weight the edge is _weight[i]. vector findEquivalentMagnitude(int unit_nodes, vector uni vector unit_to, vector unit_weight, int x Line: 10 Col: --- [PAGE/IMAGE BREAK] --- % hackerrank com /test/211i7<éneT/questions/e07edenfgk The function is expected ti The function accepts following p + WEIGHTED INTEGER GRAPH unit INT parameter x, find the magt The number of nodes is he number of edges is. _e between the units form a 2 n edge exists between fi oted at unit 1, 1,, the in: the ed; ‘at most 1 (Unit 1 has in S _weight vector FindEquivalentMa ni > unit_from, ector unit_to, vector unit weight, Line: 10 col: Run Tests Submit --- [PAGE/IMAGE BREAK] --- %3 _hackerrank.com/test/21 li7ci4ne7/question ed to return an INTEGER_ARRAY name>_nodes. ame>_edges. hame>_fromli] and _to[i]. The weight unit 1 in each unit > FindEquivalentMagnitude(int unit_nodes, vector unit_from, > unit_to, vector unit_weight, int x) { Constraints Line: 10 Col: Run Tests Submit - A) P’and'Q' cannot be - B) Pand'Q’ cannot - C) elaborate on wh - D) Complete the function JargestMagical in the editor below. wv + Complete the '\ar - E) s028