Last updated: Aug 4, 2022

Additional Concepts

This section contains some of the problems and concepts that are important from the perspective of a competitive programmer and will help you work on all your areas of CP, problems from this section are very interesting and fun to solve, they'll quiz your brain into finding the best possible solution for the problem, happy learning!!

Count The Number Of Players Who Need Training And Have Strictly Less Power And Endurance Than Any Other Player MEDIUM

This blog will discuss the topic of the Count of players who need training and have strictly less power and endurance than any other player, including codes.

Author Sagar Mishra

0 upvotes

Predict the winner of a game by converting 0 to 1 turn by turn following the given rules

This article explains the problem to predict the winner of a game by converting 0 to 1 turn by turn following the given rules

Author Yukti Kumari

0 upvotes

This article discusses the problem of Game of Nim, which is one of the most important questions in competitive programming

Author Rhythm Jain

0 upvotes

Stone Game EASY

In this article, we will discuss the problem of Stone Game that covers dynamic programming, game theory, and mathematics concepts involved.

Author Rhythm Jain

0 upvotes

This article discusses the Problem of Stone Games 2, which is one of the most famous questions in dynamic programming and game theory.

Author Rhythm Jain

0 upvotes

This blog will solve a LeetCode Problem named Stone Game III in a Brute Force manner to an Optimized Approach.

0 upvotes

This blog will solve a LeetCode Problem named Stone Game IV in a Brute Force manner to an Optimized Approach.

0 upvotes

Stone Game V MEDIUM

In this blog, we will see how we can solve the famous problem, i.e., Stone Game V.

Author Sanjana kumari

1 upvote

This blog will discuss the famous Leetcode problem Stone Game VII and solve it using dynamic programming.

Author Aman kumar Chourasiya

0 upvotes

The Prisoner’s Dilemma Game Theory

The prisoner’s dilemma game theory is a classic decision-making problem, very much prevalent in real-life scenarios as well.

Author Arun Nawani

0 upvotes

The Alpha-Beta Pruning Algorithm

In this blog post, we’ll study the alpha-beta pruning algorithm and explore an example for a clear understanding.

Author Chaturvedi

1 upvote

The Divisor Game

Two friends are playing a divisor game where every time a number is reduced by one of its factors. A player loses if they can’t reduce the number any further. Our task is to know which one of the friends will win the game.

Author Arun Nawani

0 upvotes

Sprague Grundy Theorem

This article explains the Sprague Grundy theorem with examples in game theory.

Author Yukti Kumari

1 upvote

Pattern Searching using a Trie of all Suffixes

In this article, we will learn how to implement pattern Searching using a Trie of all Suffixes.

Author brainstorming

0 upvotes

Permutation Swaps

This blog will cover the question of Permutation swaps and discuss their Time and Space complexity.

Author Nishant Rana

0 upvotes

The Earliest Moment When Everyone Becomes Friends

This article will cover the widespread problem of the Disjoint-set, i.e., The earliest moment when everyone becomes friends.

Author Deleted User

0 upvotes

Count of Distinct Groups of Strings Formed after Performing an Equivalent Operation MEDIUM

This blog will discuss the number of distinct groups of strings formed after performing an equivalent operation.

Author Sahil Setia

0 upvotes

Minimum Cost to connect the graph by choosing any vertices that have a cost of at least 0

In this article, we will discuss the approach to connect the graph in minimum cost, in which cost for connecting each vertex is given to us.

Author Vaibhav Agarwal

0 upvotes

Find MEX of every subtree in the given Tree

This article will discuss the problem to find MEX of every subtree in the given tree.

Author Vibhor_376

1 upvote

Maximum AND value of a pair in an array

This blog will cover the question of finding the maximum bitwise AND value of a pair in an array and discuss its Time and Space complexities.

Author Nishant Rana

1 upvote

Maximum XOR value pair MEDIUM

This article will discuss the “maximum XOR value pair” problem in which we have to find the maximum possible XOR value pair present in the given array Arr of non-negative integers of size N.

0 upvotes

Find the leftmost and rightmost set bit of a number

The blog discusses in detail the ”Find the leftmost and rightmost set bit of a number” problem. We’ll discuss many approaches to solve the problem and time and space complexity for each method.

Author Raksha jain

7 upvotes

Find the element that appears once

This blog will cover the question of Finding the element that appears once and discuss their Time and Space complexity.

Author Nishant Rana

2 upvotes

Playfair Cipher Program in C HARD

This article covers the Playfair Cipher Program in C. Playfair Cipher is the first and most well-known digraph substitution cipher that employs symmetry encryption.

0 upvotes