- Different substrings in a string that start and end with given strings
- stringstream in C++ and its applications
- Python | String startswith()
- Minimum move to end operations to make all strings equal
- Maximum Possible Product in Array after performing given Operations
- Queries to count the number of unordered co-prime pairs from 1 to N
- Find single in an array of 2n+1 integer elements
- Check if a given array is pairwise sorted or not
- Lexicographically next string
- Sum of all the prime divisors of a number
- Modify a bit at a given position
- Smallest subarray with k distinct numbers
- std::next_permutation and prev_permutation in C++
- atanh() function in C++ STL
- Check if a large number is divisible by 13 or not
- Next word that does not contain a palindrome and has characters from first k
- Sparse Table
- Range sum query using Sparse Table
- boost::split in C++ library
- append() and extend() in Python
- Python String Title method
- issubset() in python
- set add() in python
- set clear() in python
- filter() in python
- Check whether given three numbers are adjacent primes
- Given 1's, 2's, 3's ......k's print them in zig zag way.
- string center() in python
- Python String | istitle()
- String endswith() in Python
- Python String | find()
- String partition() in Python
- Python String | split()
- Python String | zfill()
- Python map() function
- Python reversed() function
- String rjust() and ljust() in python()
- Python set symmetric_difference_update()
- String rindex() in python
- Python String | rsplit()
- Python String | rfind()
- Python Dictionary clear()
- Python Dictionary copy()
- Find the position of the last removed element from the array
- copysign() function in C++
- equalsIgnoreCase() in Java
- StringBuffer insert() in Java
- Perfect power (1, 4, 8, 9, 16, 25, 27, ...)
- Square pyramidal number (Sum of Squares)
- Squared triangular number (Sum of cubes)
- Number of integers with odd number of set bits
- std::bitset::to_ullong and std::bitset::to_ulong in C++ STL
- lrint() and llrint() in C++
- fabs() in C++
- remainder() in C++
- fdim() in C++
- Minimum digits to remove to make a number Perfect Square
- Possible two sets from first N natural numbers difference of sums as D
- Pairs involved in Balanced Parentheses
- Sum of range in a series of first odd then even natural numbers
- log1p() in C++
- remquo() in C++
- expm1() in C++
- ldexp() in C++
- frexp() in C++
- Program to find Nth term of series 1, 3, 12, 60, 360…
- atan2() function in C++ STL
- acosh() function in C++ STL
- acos() function in C++ STL
- sinh() function in C++ STL
- Number of squares of maximum area in a rectangle
- cosh() function in C++ STL
- tanh() function in C++ STL
- asinh() function in C++ STL
- Compute power of power k times % m
- Different ways to represent N as sum of K non-zero integers
- Make all numbers of an array equal
- Find three integers less than or equal to N such that their LCM is maximum
- Check if the large number formed is divisible by 41 or not
- Minimum number of single digit primes required whose sum is equal to N
- Number of ways to represent a number as sum of k fibonacci numbers
- Shortest distance between two nodes in an infinite binary tree
- Check if is possible to get given sum from a given set of elements
- Minimum cost path from source node to destination node via an intermediate node
- Sum of sum of all subsets of a set formed by first N natural numbers
- Longest common anagram subsequence from N strings
- First element greater than or equal to X in prefix sum of N numbers using Binary Lifting
- Number of paths from source to destination in a directed acyclic graph
- array at() function in C++ STL
- array get() function in C++ STL
- Intersecting rectangle when bottom-left and top-right corners of two rectangles are given
- Check if a point lies on or inside a rectangle | Set-2
- Find First element in AP which is multiple of given prime
- Minimum multiplications with {2, 3, 7} to make two numbers equal
- Count elements in the given range which have maximum number of divisors
- Numbers with sum of digits equal to the sum of digits of its all prime factor
- LongBuffer get() methods in Java
- LongBuffer slice() method in Java
- LongBuffer wrap() method in Java
- LongBuffer arrayOffset() method in Java
- LongBuffer hasArray() method in Java
- LongBuffer allocate() method in Java
- LongBuffer duplicate() method in Java
- LongBuffer put() methods in Java
- LongBuffer compact() method in Java
- LongBuffer asReadOnlyBuffer() method in Java
- LongBuffer equals() method in Java
- DoubleBuffer arrayOffset() method in Java With Examples
- DoubleBuffer compareTo() method in Java With Examples
- DoubleBuffer wrap() method in Java with Examples
- DoubleBuffer slice() method in Java with Examples
- DoubleBuffer asReadOnlyBuffer() method in Java with Examples
- DoubleBuffer equals() method in Java with Examples
- DoubleBuffer array() method in Java With Examples
- DoubleBuffer duplicate() method in Java with Examples
- DoubleBuffer allocate() method in Java With Examples
- DoubleBuffer compact() method in Java With Examples
- DoubleBuffer hasArray() method in Java with Examples
- DoubleBuffer put() methods in Java with Examples | Set 1
- Check whether a given point lies on or inside the rectangle | Set 3
- Sum of Factors of a Number using Prime Factorization
- Divide a number into two parts such that sum of digits is maximum
- Find four factors of N with maximum product and sum equal to N | Set 3
- Program to find N-th term of series 3, 5, 33, 35, 53....
- Find Nth number of the series 1, 6, 15, 28, 45, .....
- Program to find the N-th term of series 3, 5, 33, 35, 53…. | Set-2
- Find two distinct prime numbers with given product
- Program to find remainder when large number is divided by r
- Minimum changes required to make first string substring of second string
- Check n^2 - m^2 is prime or not
- Given a number x , find y such that x*y + 1 is not a prime
- Find count of Almost Prime numbers from 1 to N
- Find the largest good number in the divisors of given number N
- Sum of first N natural numbers by taking powers of 2 as negative number
- Check if it is possible to move from (a, 0) to (b, 0) with given jumps
- Check if it is possible to move from (0, 0) to (x, y) in N steps
- Program to find the Nth term of series 5, 12, 21, 32, 45......
- Program to find the Nth number of the series 2, 10, 24, 44, 70.....
- Program to find N-th term of series 1, 2, 11, 12, 21….
- Find N digits number which is divisible by D
- Number of solutions for x < y, where a <= x <= b and c <= y <= d and x, y are integers
- Find the number of rectangles of size 2*1 which can be placed inside a rectangle of size n*m
- Number of solutions for the equation x + y + z <= n
- Minimum increment operations to make the array in increasing order
- Check if a large number is divisible by 2, 3 and 5 or not
- Print values of 'a' in equation (a+b) <= n and a+b is divisible by x
- Number of squares of side length required to cover an N*M rectangle
- Maximum count of equal numbers in an array after performing given operations
- Find the sum of all multiples of 2 and 5 below N
- Convert given array to Arithmetic Progression by adding an element
- Find the sum of first N odd Fibonacci numbers
- Sum of all the multiples of 3 and 7 below N
- Minimum number of cuts required to make circle segments equal sized
- Find the number of primitive roots modulo prime
- Find the index of the left pointer after possible moves in the array
- Probability of getting more value in third dice throw
- Minimum number of moves required to reach the destination by the king in a chess board
- Sum of the digits of a number N written in all bases from 2 to N/2
- Check if N can be represented as sum of integers chosen from set {A, B}
- Check if N is divisible by a number which is composed of the digits from the set {A, B}
- Lexicographically smallest substring with maximum occurrences containing a's and b's only
- Maximum length substring with highest frequency in a string
- Find the maximum possible value of the minimum value of modified array
- Sub-strings that start and end with one character and have at least one other
- Find the non decreasing order array from given array
- Possible cuts of a number such that maximum parts are divisible by 3
- Find the sum of the all amicable numbers up to N
- Check if a number can be expressed as sum two abundant numbers
- Largest subset where absolute difference of any two element is a power of 2
- Shortest Path using Meet In The Middle
- Make Binary Search Tree
- Sub-string that contains all lowercase alphabets after performing the given operation
- Find the winner by adding Pairwise difference of elements in the array until Possible
- Maximum number of teams that can be formed with given persons
- Find the values of X and Y in the Given Equations
- Find maximum operations to reduce N to 1
- Source to destination in 2-D path with fixed sized jumps
- Given two binary strings perform operation until B > 0 and print the result
- Count primes that can be expressed as sum of two consecutive primes and 1
- Minimum number of given moves required to make N divisible by 25
- Minimum edges to be added in a directed graph so that any node can be reachable from a given node
- Minimum number of elements that should be removed to make the array good
- Minimum operations to make counts of remainders same in an array
- Make a tree with n vertices , d diameter and at most vertex degree k
- Find the number of distinct pairs of vertices which have a distance of exactly k in a tree
- Find the minimum number of preprocess moves required to make two strings equal
- Minimum number of given powers of 2 required to represent a number
- Greatest number less than equal to B that can be formed from the digits of A
- Number of ways to select a node from each connected component
- Count numbers which are divisible by all the numbers from 2 to 10
- Find last five digits of a given five digit number raised to power five
- Ways to place 4 items in n^2 positions such that no row/column contains more than one
- Find the shortest distance between any pair of two different good nodes
- Find the count of numbers that can be formed using digits 3, 4 only and having length at max N.
- Numbers that are not divisible by any number in the range [2, 10]
- Maximize profit when divisibility by two numbers have associated profits
- Find the sum of all Truncatable primes below N
- Find if the given number is present in the infinite sequence or not
- Find the number of good permutations
- Find the weight of the minimum spanning tree
- Find the numbers of strings that can be formed after processing Q queries
- Find the number of ways to divide number into four parts such that a = c and b = d
- Minimize the cost to split a number
- Find the maximum number of composite summands of a number
- Given count of digits 1, 2, 3, 4, find the maximum sum possible
- Find the good permutation of first N natural numbers
- Find the number of different numbers in the array after applying the given operation q times
- Minimum steps to color the tree with given colors
- Find the number of integers from 1 to n which contains digits 0's and 1's only
- Find the number of jumps to reach X in the number line from zero
- Find the minimum number of steps to reach M from N
- Shortest path from source to destination such that edge weights along path are alternatively increasing and decreasing
- Check if a given number divides the sum of the factorials of its digits
- Find the number of integers x in range (1,N) for which x and x+1 have same number of divisors
- Length of the longest increasing subsequence such that no two adjacent elements are coprime
- Find n positive integers that satisfy the given equations
- Find the Kth node in the DFS traversal of a given subtree in a Tree
- Find (1^n + 2^n + 3^n + 4^n) mod 5 | Set 2
- Lazy Propagation in Segment Tree | Set 2
- Find the longest sub-string which is prefix, suffix and also present inside the string
- Find the minimum number of operations required to make all array elements equal
- Convert the undirected graph into directed graph such that there is no path of length greater than 1
- Minimum number of changes such that elements are first Negative and then Positive
- Find the sum of the number of divisors
- Find the number of sub arrays in the permutation of first N natural numbers such that their median is M
- Find the number of divisors of all numbers in the range [1, n]
- Find the minimum number of rectangles left after inserting one into another
- Check if a directed graph is connected or not
- Find permutation of first N natural numbers that satisfies the given condition
- Count of integers of the form (2^x * 3^y) in the range [L, R]
- Check if a string contains two non overlapping sub-strings "geek" and "keeg"
- Count of all possible values of X such that A % X = B
- Maximum possible sub-array sum after at most X swaps

pawan_asipu hasn't improved any 'Articles' yet!