tag:blogger.com,1999:blog-8236160994359493526.comments2023-07-27T13:48:56.784+05:30Interview questions on Algorithms, Programmingtnsatishhttp://www.blogger.com/profile/11487701501347042727noreply@blogger.comBlogger29125tag:blogger.com,1999:blog-8236160994359493526.post-29258436724633494242023-01-25T13:55:56.029+05:302023-01-25T13:55:56.029+05:30She had her palms within the pockets of the coat a...She had her palms within the pockets of the coat and a cigarette in her mouth. Cataluna Esteme itself had been active within the lead business till 1998, when the getting older proprietor <a href="https://saletoiletplungers.net/2022/11/10/best-toilet-plungers-for-high-pressure.html" rel="nofollow">Toilet Plungers for High Pressure</a> had been felled by heart bother whereas on a visit to Paris. Over the following 12 months or so, the assets of the company had been distributed to the proprietor's heirs, and the company itself had gone dormant. Cataluna Esteme existed within the desk drawer of a lawyer in Andorra's capital city of Andorra la Vella.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-53170778001074145582022-12-05T06:39:24.061+05:302022-12-05T06:39:24.061+05:30If you encounter an unfortunate streak of losses, ...If you encounter an unfortunate streak of losses, the amount want to|you should|you have to} bet could exceed this limit, additionally inflicting you to <a href="https://카지노사이트.online/dafabet/" rel="nofollow">dafabet</a> not cowl your losses. The Brach’s candy corn gave the impression to be going for the same Russian-roulette effect, because the that} flavors have been jumbled and the colours weren’t an instantaneous giveaway. Inside Bets are these where you place chips directly on a quantity or a gaggle of them. Dozen – Similar to column bets but you cowl the primary 12 numbers, or the middle or final 12. As the researchers observe in the paper, "for the casino the information is generally good—minor adjustments will ameliorate the advantage of the physicist-gambler." For extra info, see the developer’s privateness coverage.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-44039077338287616972022-11-15T09:09:46.331+05:302022-11-15T09:09:46.331+05:30Knowing the secret arithmetic that a 토토사이트 slot ma...Knowing the secret arithmetic that a <a href="https://casino.edu.kg/%ED%86%A0%ED%86%A0-%EC%82%AC%EC%9D%B4%ED%8A%B8.html" rel="nofollow">토토사이트</a> slot machine uses to create pseudorandom outcomes isn’t enough to assist hackers, although. That’s outcome of|as a end result of} the inputs for a PRNG range relying on the temporal state of each machine. The seeds are different at different occasions, for example, as is the information culled from the interior clocks. So even if they understand how a machine’s PRNG functions, hackers would also have to investigate the machine’s gameplay to discern its sample.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-85133246085779153982022-11-14T15:51:20.890+05:302022-11-14T15:51:20.890+05:30Once your account is created, you'll be logge...Once your account is created, you'll be logged-in to this account. There are sure restrictions concerning your place of residence. You can see the record of restricted nations in GamingZion's evaluate <a href="https://casino.edu.kg/1xbet.html" rel="nofollow">1xbet</a> about Jackpot City Casino.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-90588738805510218182022-08-17T23:23:58.423+05:302022-08-17T23:23:58.423+05:30Nice article Man Keep up the good work. And I woul...Nice article Man Keep up the good work. And I would like to be here again to find another masterpiece article. Thanks for sharing. if you want to get <a href="https://courierstoindia.com/au/" rel="nofollow">Send Gifts from Australia to India</a> then visit our website.Couriers to Indiahttps://www.blogger.com/profile/17814544731530335711noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-88130139981209840682014-07-03T15:54:54.193+05:302014-07-03T15:54:54.193+05:30How is it O(n^2) time complexity? The for loop exe...How is it O(n^2) time complexity? The for loop executes at max n iterations only. So, it is O(n) only. tnsatishhttps://www.blogger.com/profile/11487701501347042727noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-90990392548878363732014-07-03T13:40:03.904+05:302014-07-03T13:40:03.904+05:30Answer 3 is not O(n) time complexity but O(n^2) ti...Answer 3 is not O(n) time complexity but O(n^2) time complexityAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-44044361424979592252014-05-15T16:41:25.984+05:302014-05-15T16:41:25.984+05:30Nice answer :)Nice answer :)Anonymoushttps://www.blogger.com/profile/14196358531733151688noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-38043125184974837962014-04-22T11:37:02.870+05:302014-04-22T11:37:02.870+05:30How will the boat come back to take the next two? ...How will the boat come back to take the next two? tnsatishhttps://www.blogger.com/profile/11487701501347042727noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-32188589198088304712014-04-22T09:03:18.462+05:302014-04-22T09:03:18.462+05:30What about the following solution:
1) HHHCCC ->...What about the following solution:<br />1) HHHCCC -> --<br />2) HHCC -> HC<br />3) CC -> HHHC<br />4) -- -> HHHCCCAnonymoushttps://www.blogger.com/profile/03021033111744577217noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-81442521983481918852014-04-13T00:24:47.405+05:302014-04-13T00:24:47.405+05:30This comment has been removed by a blog administrator.Anonymoushttps://www.blogger.com/profile/10672055622764738047noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-21444568896911195572014-01-31T00:23:42.090+05:302014-01-31T00:23:42.090+05:30wouldn't it be 2*sqrt(n) -1? because you'v...wouldn't it be 2*sqrt(n) -1? because you've already established the upper bound, you don't need to test it.<br /><br />x + 1*n^((m-2)/m), x + 2*n^((m-2)/m), ... x + n ^(1/m)*n^((m-2)/m)<br />x + 1*n^((m-2)/m), x + 2*n^((m-2)/m), ... x + (n-1) ^(1/m)*n^((m-2)/m)Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-49669637365638609882012-12-03T00:18:51.951+05:302012-12-03T00:18:51.951+05:30same negative question again: what will be its out...same negative question again: what will be its output for: -2 -1 -3 -4 -5 -6 -7 -8 -9 -10Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-9967633102994979962012-11-19T17:01:06.610+05:302012-11-19T17:01:06.610+05:30Sorry for the late reply. I updated the post with ...Sorry for the late reply. I updated the post with the explanation. tnsatishhttps://www.blogger.com/profile/11487701501347042727noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-30656600367807181132012-09-27T05:57:14.824+05:302012-09-27T05:57:14.824+05:30can you explain more?:
1*n^((m-1)/m), 2*n^((m-1)/...can you explain more?:<br /><br />1*n^((m-1)/m), 2*n^((m-1)/m), .. , n^(1/m)*n^((m-1)/m). <br /><br /><br /><br />x + 1*n^((m-2)/m), x + 2*n^((m-2)/m), ... x + n^(1/m)*n^((m-2)/m)Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-13939240962939374072012-02-17T21:41:23.789+05:302012-02-17T21:41:23.789+05:30Nitin,
I guess, it works, even if all the eleme...Nitin,<br /> I guess, it works, even if all the elements are negative. It prints indexes as -1, and sum as 0.tnsatishhttps://www.blogger.com/profile/11487701501347042727noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-86693541289714159782012-02-17T21:22:41.560+05:302012-02-17T21:22:41.560+05:30Thanks Anonymous. I corrected it.Thanks Anonymous. I corrected it.tnsatishhttps://www.blogger.com/profile/11487701501347042727noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-36976070024397924602012-02-13T01:39:11.976+05:302012-02-13T01:39:11.976+05:30Call it a sub-sequence, not a subset.Call it a sub-sequence, not a subset.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-22245376979081769742011-11-21T12:14:23.875+05:302011-11-21T12:14:23.875+05:30Will this work if all the elements are negative?Will this work if all the elements are negative?Nitin D'Souzahttps://www.blogger.com/profile/15295509277894980598noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-62143317195328875472011-07-21T07:34:51.795+05:302011-07-21T07:34:51.795+05:30Thanks for pointing the mistake. I corrected it. I...Thanks for pointing the mistake. I corrected it. I was expecting contiguous subset, and not the normal subset.tnsatishhttps://www.blogger.com/profile/11487701501347042727noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-37591567644702470812011-07-20T23:54:29.232+05:302011-07-20T23:54:29.232+05:30I don't believe this question is asked correct...I don't believe this question is asked correctly for the given answer.<br />You want the contiguous sub-sequence with the maximum sum. A subset is not ordered, and would thus a subset with the maximal sum would be the given by the sum of the positive values. It would be 28 in both cases.<br />I hope this wasn't actually the way the interview was done.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-58090342441161212112011-03-25T17:58:47.259+05:302011-03-25T17:58:47.259+05:30awesome.. the oneawesome.. the oneAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-18135712773873683112010-02-09T16:03:16.241+05:302010-02-09T16:03:16.241+05:30if sum of all decimal digits is divisible by 3 the...if sum of all decimal digits is divisible by 3 then the given number is divisible by 3Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-76002114151219150232009-12-29T14:31:32.880+05:302009-12-29T14:31:32.880+05:30For any rectangle, the diagonals are of equal size...For any rectangle, the diagonals are of equal size. For this rectangle, the other diagonal gives the radius, and it is same as the blue diagonal. So, the radius is 8".tnsatishhttps://www.blogger.com/profile/11487701501347042727noreply@blogger.comtag:blogger.com,1999:blog-8236160994359493526.post-75133498523917819262009-05-20T09:09:18.652+05:302009-05-20T09:09:18.652+05:30If it is random(n), then it is not guaranteed to b...If it is random(n), then it is not guaranteed to be unique. If you call random(n) twice, you may get the same no both times. But, we need unique random numbers.tnsatishhttps://www.blogger.com/profile/11487701501347042727noreply@blogger.com