© 2022 Hashnode
#competitive-programming
Introduction Welcome Back! In this post, we will take a beginner's dive into segment trees in c++, we will look at what are they. what are they for? and we will solve some basic competitive programmin…
Ever wondered why DSA is so much important in implementing software and as well as hiring process. Why the companies is primarily focused on taking DSA and not some specific language/framework questio…
While solving problems on LeetCode, most of you must have realized that LeetCode doesn't provide an option to sort the questions by likes or likes-dislikes ratio apart from the first 100 most liked qu…
Introduction Hello everyone, welcome back!, today I wanted to give a beginners overview of stacks and queues in Python, we will take a good look at what are they? what are they for? and we will look t…
I am not a competitive person and if you would consider drinking Milo at a pace of a dozen Tetra Paks an hour working well under stress; then, yes, I also work extremely well under stress. So how exac…
1. Sliding Window The Sliding Window pattern is used to perform a required operation on a specific window size of a given array or linked list, such as finding the longest subarray containing all 1s. …
Every time when you ask someone good about how to practice, he/she will reply to you to “solve a lot of problems” and that’s true, there’s no other way. Anyway, I’ve thought about it and actually I’m able to tell a bit more. I know some peo…
Recursion expects us to divide the problem into more small problems and in case of linkedlist one way of dividing the problem is by observing linkedlist as head and rest of linkedlist ATTITUDE -> first node, which we have to deal with, and …
What is Competitive Programming? Competitive Programming is an exercise to level up your programming and DSA skills via solving problems. These are solved under crucial constraints like memory constra…
Linked lists Linked lists are direct information structures associating hubs in a grouping. Every hub has two parts: 1.) An information component and 2.) A pointer containing a memory address to the f…
