Competitive Coding

 Hey, I was just wondering about what next? I have made two good websites that are solving real-life problems and I am adding features, improving bugs, and all on sites, and that's pretty much it. I am doing competitive programming for a while now and it's good to have a decent rating on that too. But, again, what's next? What should be my plan for the coming holidays? A greater tech site that also uses AI or something? Or maybe, some site which helps me in someplace. Or an app or some other techy thing which I can make to make my and other life better in some small way.  Or something else? Maybe I should start freelancing and earning bucks for my work. Doing internships is also a good plan. Freelancing is somewhat better in a way though, for it grants me to get my own pace and finish the project as fast as I can.  Or maybe I should just stick to Data Structures and Algorithms, give some time to Dynamic Programming, Graphs, and all, and thus improving my chances for getti...

 I am very bad at keeping what is in my heart. I am pretty straight forward and very easily get offended by someone commenting on me or someone just ignoring me. This was becoming a serious problem for me, as I am not well experienced with such situations and as far as my problems go, I have a clear and simple way to deal with them: Create a Blog.  So, first of all, I get angry very soon and I am likely to get involved in fistfights or saying someone real bad out of temper which makes no sense at all. The first thing is to control anger and act very strategically. This is easier said than done.  I have some rules which I try not to break in an argument. Now, these rules are not at all tactics to win the argument, but these at least would help you in not being guilty because of a foolish reason. So, here are those rules: Be rationale and Respectful: If it is a school fight it's fair enough to punch your way out, but when you are in college or in a company, never ever lose ...

 So, I think it's high time to write an article on this as there are almost hundreds of videos and blogs, but still, we find it difficult to have a proper syllabus and structure. First of all, I list all the resources from which you can learn the theory part at least: Abdul Bari Series on Youtube( link ): Though he teaches slow, I still think he is one of the best teachers to learn the theory of DS and Algo. Code-N-Code ( link ): Waqar Ahmed has made a brilliant youtube channel where you can find in-depth playlists on almost all data structures and algorithms. His approach is based on Competitive Programming and you would really like it if you are a CP fan. GFG: Yeah, it's always on the list! You should use it as a reference and not define your syllabus from it, as its number of articles is enormous. Just google stuff and you would always find it on top. For example, after getting a -100 drop in rating😣, you are on fire inside and see that DP is your weak topic. And the next t...

It's kind of weird but sometimes, I just have tons of things to do, yet I am reluctant to do any of them, like some massive form of energy would come and do that automatically. And this is now for over a week, and I finally though of doing something which I am always ready for and excited for: writing a blog! Although it is just to motivate me, you may just read it for seeing how people get energy from what they love  😉. So, let's jot down every possible thing I gotta do in upcoming months: > CodeKaksha > Game of Codes( Making Blogs and slight improvements) > DTU Times: PhP, Laravel, SQL, and more importantly setting up my dev environment and understanding some codebase from top level. > GSOC: I have selected an organisation for which I have to learn Ruby on Rails. But that's not the point, I just have to  install it locally and understand company's vision. And raise and solve issues. > DSA: Yeah, all of these go to vain if I don't do this in JEE sty...

Trees: All Branches One place Trees are hierarchal data structures built to store information that is connected to each other. As the name suggests, it is a tree, just upside down that stores data in its leaves and connected through branches .  So, this was the introduction, now let's see what we gonna cover in this blog: Applications of trees Binary Trees Traversals Some Trivial Questions The diameter of a binary tree LCA of Binary Tree Questions(Trivial) This is all we gonna cover. This part is not that much tough, but it's likely to get a little frustrating when it comes to trivial questions. (At least for me 😢 )

I thought it would be the right time for juniors and second years like me, to have some important dates in hand instead of just Mirzapur season release dates. So these are some sites, some annual hackathons, which I researched, and have compiled for you all, also, it includes some internships as well. So, get yourself some pen and paper, and let's start: Hackathons: Some important sites which conduct hackathons: Devfolio Devpost MLH Hackerearth https://www.hackathon.io/network http://www.hackalist.org/ Some important hackathons which occur annually: SIH Some important open source programmes GSOC

The Return of Number Theory  We covered in the First part: Primarily Test Prime Factorisation Sieve of Eratosthenes Binary Exponentiation Euclid's Algorithm for GCD Number of divisors/sum of divisors Segmented Sieve We would cover: Modulus Operations Binomial Coefficients Extended Euclidian Algorithm Diophantine Matrix Exponentiation Fibonacci in O(log(n)) Chinese Remainder Theorem Euler's Totient Function And these are the methods which we would cover only in theory, no questions in the fight: Pollard p-1 Pollard rho algorithm Modulus Arithmetic: Before jumping to the formulas for addition, subtraction, etc., firstly, let's have a look at what is M odular Congruence. Modular Congruences: a and b are modular congruent under n if they give the same remainder on dividing by n. Representation: a  ≡ b(mod n)   What that means is that wherever you are given a%n, you can replace it with b%n and it would have no impact no final answer, for example,  9=13 mod 4 (12+9)%4=21%...