All Posts

Competitive programming beginner topics part 2

4— layout: post title: “Competitive Programming Beginner Topics Part 2” tags: [Writing, competitive programming,Competitive Programming Beginner] usemathjax: true —

Maximum Subarray Sum: Kadanes Algorithm (Dynamic Programming)

Problem: We have to find the maximum subarray sum.

Elementary Number Theory

Prime Factorization A number a is called a divisor or a factor of a number b if b is divisible by a, which means that there exists some integer k...

The big (o) notation

In computer science, algorithms play an important role in solving problem and optimizing processes. A key factor in evaluating the efficiency of these algorithms is the concept of time complexity....

Additional Silver Topics

Two Pointers The two pointers method iterates two pointers across an array, to track the start and end of an interval, or two values in a sorted array that we...