## Why is python best suited for Competitive Coding?

When it comes to Product Based Companies, they need good coders and one needs to clear the Competitive Coding round in order to reach the… Read More »

- Count common characters in two strings
- Sort an array without changing position of negative numbers
- Nth number whose sum of digit is multiple of 10
- Given two arrays count all pairs whose sum is an odd number
- Find maximum xor of k elements in an array
- Find minimum difference between any two elements | Set 2
- Why Should I Learn Coding?
- Interactive Problems in Competitive Programming
- Check whether two strings contain same characters in same order
- Total number of possible Binary Search Trees using Catalan Number
- Find the minimum number of operations required to make all array elements equal
- Program to find the kth character after decrypting a string
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Maximize the happiness of the groups on the Trip
- Find the number of pair of Ideal nodes in a given tree
- Find the minimum number of elements that should be removed to make an array good
- Sum of digits with even number of 1's in their binary representation
- Find sub-arrays from given two arrays such that they have equal sum
- Count of all possible values of X such that A % X = B
- Equal Sum and XOR of three Numbers
- Lexicographically Smallest Topological Ordering
- Lazy Propagation in Segment Tree | Set 2
- Convert the undirected graph into directed graph such that there is no path of length greater than 1
- Check which player visits more number of Nodes
- Find the Nth Mosaic number
- Replace array elements by sum of next two consecutive elements
- Optimally accommodate 0s and 1s from a Binary String into K buckets
- Find the weight of the minimum spanning tree
- Count of integers in a range which have even number of odd digits and odd number of even digits
- Check whether a number can be represented as sum of K distinct positive integers

When it comes to Product Based Companies, they need good coders and one needs to clear the Competitive Coding round in order to reach the… Read More »

Python is one such programming language which makes everything easier and straight forward. Anyone who has dabbled in python for Competitive Coding gets somewhat addicted… Read More »

Given a number, you have to represent this number as sum of minimum number of possible psuedobinary numbers. A number is said to be psuedobinary… Read More »

Given an array of size n and a give set of commands of size m. The commands are enumerated from 1 to m. These commands… Read More »

The Google Foo bar challenge has been known for the last 5 years or more as a secret process of hiring developers and programmers all… Read More »

You are wondering some time coder write his code in 2 min or less how? No kidding! Although this tip may not be very useful… Read More »

Not using of 1LL or 1ll when needed filter_none edit close play_arrow link brightness_4 code // A program shows problem if we // don’t use… Read More »

In competitive programming or in general some problems seems difficult but can be solved very easily with little bit magic. We have discussed some tricks… Read More »

Although practice is the only way that ensures increased performance in programming contests but having some tricks up your sleeve ensures an upper edge and… Read More »

We have discussed some tricks in below post. In this post, some more tricks are discussed. Writing C/C++ code efficiently in Competitive programming Although practice… Read More »

Facebook hacker cup is an annual algorithmic programming contest organized by Facebook. Be it students, professionals or experts it attracts numerous programming enthusiasts from all… Read More »

Usually, main purpose of using map stl container is for efficient search operations and sorted order retrieval. As map stores key-value pair, all the search… Read More »

Prerequisites : Input/Output from external file in C/C++, Java and Python for Competitive Programming In above post, we saw a way to have standard input/output… Read More »

Given N modular equations: A ≅ x1mod(m1) . . A ≅ xnmod(mn) Find x in the equation A ≅ xmod(m1*m2*m3..*mn) where mi is prime, or… Read More »

Given an array arr[] of size n, its prefix sum array is another array prefixSum[] of same size such that the value of prefixSum[i] is… Read More »