en
Feedback
Codative πŸ”­

Codative πŸ”­

Open in Telegram

Programmer | Orthodox Christian | Reader Resources: @codative_resources

Show more
1 302
Subscribers
+524 hours
+77 days
+1230 days
Posts Archive
Enjoying cp on my phone I didn't thought it will be possible tho.Thanks for kiwi browser developers and creators of neovim 😏

Note for me: Yesterday is history. Tomorrow is mystery. Today is a gift.

check this out leetcode added time complexity analyzer for analyzing your time and space analysis if you are struggling with
check this out leetcode added time complexity analyzer for analyzing your time and space analysis if you are struggling with space and time now no worries you can just press a button and check if you were correct or not

IDX is here with its awesome features and capabilities

Repost from The Blogrammer
You ever think about giving closure to all the side projects you never finished?

I don know how a person could be dedicate for open source like this but check this out the best place for learning competitive programming cp-algorithms

I have been checking golang for competitive programming. And it simplicity rule came in the wrong place the standard library is poor of data structures that are very mandatory for cp specifically for a person who adapted to python and cpp.😞

Some times we all need update
Some times we all need update

Sometimes simplicity is the key for our problems I was solving codeforces and leetcode for more than 7 months now and one of the best lessons that I have learned is that making simple as much as possible was the key even the most difficult problems that you coukd face when you take them simply they are solvable. So make it simple stupid 😜 @code_cursed

All of us know about binary (01) Exist or not (Phyics view 😜) the most important number system in the world (Heart of our computers) but for most of just we know the numbers and the Concept behind binary number(Representing a number as a sum of power of 2) is far more applicable in many places specially in highly important algorithms like Binary Lifting πŸ‹in which you take power of 2 steps at time which mkes the algorithm run in asymptotic time of log(n) and others like Binary exponentiation which is the internal implementation of pow() function in many programming languages ... β™Ύ I think we owe them thanks specially for the number behind 2 πŸ˜‚ Have you ever imagined If we can represent life as power of 2 πŸ˜‚ @code_cursed

Welcome there dear cursed with coding. I am here to free you from the curse πŸ˜‚ I am here to write about my curses and life of coding as a whole we will talk about:- - Golang - Python - Flutter(Coming soon πŸ™ˆ) - Competitive Programming(My curse 😜) - Much more @code_cursed