Anand Undavia

@AnandUndavia

I write some React at Cisco, just here to follow the tech stuff!.. and maybe just maybe, some cats 🐈😻

Vrijeme pridruživanja: kolovoz 2018.
Rođen/a 1996.

Tweetovi

Blokirali ste korisnika/cu @AnandUndavia

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @AnandUndavia

  1. Prikvačeni tweet
    13. ožu 2019.

    Recently, I came across this picture and got inspired from it to actually write 'thanos-js'. Here is the result: Let me know what you think! :D

    Poništi
  2. 2. velj

    Solution to problem 38 ran for the longest time (~30 seconds) compared any of my previous solutions. As long as it satisfies the "one-minute rule" :P Link:

    Poništi
  3. 1. velj
    Poništi
  4. 1. velj
    Poništi
  5. 1. velj
    Poništi
  6. 1. velj

    50% of the answer was already given in the problem description :P My solution to problem 34:

    Poništi
  7. 1. velj
    Poništi
  8. 1. velj

    A Solution obtained by Exhaustive Search is never wrong :D ( Just a fancy way of saying I brute forced :P ) Here is the solution to problem 32:

    Poništi
  9. 29. sij
    Poništi
  10. 29. sij

    I would like to a way to prove ( or at least a 'why' ) that no such number greater than 194979 exists for which sum of digits raise to power 5 is equal to the number itself. Anyone?

    Prikaži ovu nit
    Poništi
  11. 29. sij

    I lacked enough mathematical knowledge to find the upper bound for problem 30. So, I let my solution run for 1e7 and got the green tick! Here is the link:

    Prikaži ovu nit
    Poništi
  12. proslijedio/la je Tweet
    27. sij

    Developers sitting in meetings and fixing CSS bugs all day: "Funny how I get paid for this" Developers working on open-source software that thousands of companies and developers depend on: "Funny how I don't get paid for this"

    Prikaži ovu nit
    Poništi
  13. 23. sij

    Problem 29 reminds me how big numbers are easily handled by programming languages WITHOUT external libraries. Solution is straightforward:

    Poništi
  14. 23. sij

    Generate the series, add the numbers, submit the answer and get the green tick! The solution to problem 28:

    Poništi
  15. 23. sij

    Too lazy to find an efficient solution for problem 27. So here the brute forced one :P

    Poništi
  16. proslijedio/la je Tweet
    22. sij

    Ideas are cheap, everybody has one. Execution is hard, only a few people can pull it off. Execution > ideas

    Poništi
  17. 20. sij

    Back to after some time and I finished problem 26!! I actually had fun solving the problem and got wrong answer couple of times because the answer the number which produces the longest cycle and not the length of it! Link:

    Poništi
  18. 15. sij

    Got an award "Easy Prey" as I solved the 25th! Here is the solution:

    Poništi
  19. 15. sij

    I have advanced to level 1 on Project Euler after solving the 24th problem!! The algorithm I referred: Link to my solution:

    Poništi
  20. proslijedio/la je Tweet
    13. sij

    All the developers are @ hault !

    Poništi
  21. 12. sij
    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·