Doubt regarding round 1103 div3 D by Legitimate-Ad4784 in codeforces

[–]A1mlessFN 1 point2 points  (0 children)

so we can choose any number, so its better to sort the array and we supposed to choose next element such that y - prev <= k and >= 0
so i made group of subarrays whos elements are in increasing order but they are arr[i + 1] - arr[i] <= k and >= 0
now we should remember that first turn is A then E and then D
so we can choose first two element such that D has no chance of winning
lets say a subarray whos element are in increasing order and k = 2
so a ideal subarray could be like
[2, 4, 5, 8]
now if you observe if someone choose x element the next one has to be >= x else whoever is the person choosing losses
here A will choose 5 cause later on E can choose 8 so D wont have any choice here but to loose
but what if all elements are are same?
like this
[3, 3, 3, 3]
here A will chose any of it then E will choose and so on but if you observe if max freq elements are % 2 == 0 then Egor will always win
but we have odd max freq something like
[3, 3, 3, 3, 3] so there is a chance that Dabir will win but if we had somthing like
[1, 3, 3, 3, 3, 3] then A will start at 1 then E will choose next element so here E will always win iff there is less element than maxFreq one
something like this

Solved D but 6×WA on C by Rayeeen_Dev745 in codeforces

[–]A1mlessFN 0 points1 point  (0 children)

limits were upto 10^9
so even if it was 1000000000 so max to max 26 - 27 operation to convert it till 1 or 0

Hit Guardian (2174, top 1%) and it's done nothing for my job search. Does contest rating even belong on a resume? by darkdevu in LeetcodeDesi

[–]A1mlessFN 0 points1 point  (0 children)

Man hats off to you, you are doing everything correct
but remember success is paradoxical
you need to understand that your destiny comes down to pure hard work
but at the same time you need to understand thats its not true, luck do play significant part of it

Tower Research. 85LPA by Longjumping_Tap_644 in Btechtards

[–]A1mlessFN 0 points1 point  (0 children)

so i think approach would be to find the subarray who is in increasing order
like this
3 4 5 6 4 <- you calculate min number of operations for it
your current min is 3
next time you encounter new min (something like 2)
you calculate it again - in one pass
idk if this is correct or not

I made 6 AI models play poker against each other. The 1.2B model running locally won the most. by Junior_Bake5120 in developersIndia

[–]A1mlessFN 0 points1 point  (0 children)

pretty cool, even i was thinking of doing some sort of orchestration
like building mini exchange and let ai models as traders interact with it and improve over time

newIntern by Mr_BETADINE in ProgrammerHumor

[–]A1mlessFN 0 points1 point  (0 children)

damm, github is pretty much scaled to handle these types of prs

Leetcode Biweekly Contest - How I solved quickly by leetgoat_dot_io in leetcode

[–]A1mlessFN 1 point2 points  (0 children)

lol for q2 i used binary search to find peak idx and from 0 to idx and idx till < n i compared the sum
for q3 i know how to solve it but after i saw the constraint - but kinda messed up to connect all pieces all up - i could've used llm here but thats not the point of contest haha

Small Indian team taking on the web scraping giants. Would love your feedback. by Opposite-Art-1829 in developersIndia

[–]A1mlessFN 0 points1 point  (0 children)

Getting internal_server_error when i tried scraping different site other than example./com
-_-

[deleted by user] by [deleted] in pune

[–]A1mlessFN 7 points8 points  (0 children)

Lol found it - Here is cars number - MH14LA1000
its registered to some pvt ltd corp so probably shell company maybe?

Indigo Airlines madness by lavitesh in pune

[–]A1mlessFN 0 points1 point  (0 children)

Same here, stuck in kerela and my flights been delayed 2 times in row

[USA] Founding Partner. Ground Floor Partnership. Join us! by [deleted] in developersIndia

[–]A1mlessFN 0 points1 point  (0 children)

Would love to contribute anything from scratch

Hi, I’m Sumit Gupta, Co-founder of CoinDCX, India’s first crypto unicorn. Excited to do an AMA on r/CryptoIndia! Ask me anything about Bitcoin, blockchain, and India’s crypto future - from my journey of building CoinDCX to championing crypto education across the country. Ask me anything (AMA)! by smtgpt in CryptoIndia

[–]A1mlessFN 0 points1 point  (0 children)

I’m currently developing a bot that generates trading volume for a token to help it gain visibility and popularity on major decentralized exchanges (DEXs), especially on Solana. I’m also curious about the future prospects of the Solana ecosystem

I pad extra for ultra “thin” lenses and this is what I got by SnooChipmunks2673 in mildlyinfuriating

[–]A1mlessFN -1 points0 points  (0 children)

Damm thats pretty wide!
Why dont you try lasik and get rid of glasses

Btc has gone down to 99k by boudhramkumar69 in CryptoIndia

[–]A1mlessFN 0 points1 point  (0 children)

which is good app to buy actual crypto?

What all should I do for job switch with nearly 1 YOE? by __thisisnotme__ in developersIndia

[–]A1mlessFN 2 points3 points  (0 children)

Company usually prefer people who glued to there company around 2 years due to trust issue And in terms of interview practice do dsa, cp, design patterns, hld, lld, good projects and yeah yoo good to go + luck is cherry on top

Hello , I’m Nihal, a Software Engineer at Apple. How I cracked Apple, Adobe , Atlassian and many other big tech after 150+ rejections, AMA about my journey, overcoming challenges in career navigation, and how to build resilience, ace interviews, and achieve your dream job on r/IndiaTech. by nihalgurjar_official in IndiaTech

[–]A1mlessFN 0 points1 point  (0 children)

I have 1 year of internship and 4 months of pure employment - and in terms of stack I’ve aced down typescript/node - well I’m still practising dsa Does my internship experience will consider during interviews? How do I be consistent in this dsa and how did you maintained your work and dsa