pawan_asipu
pawan_asipu
  1. Different substrings in a string that start and end with given strings
  2. stringstream in C++ and its applications
  3. Python | String startswith()
  4. Minimum move to end operations to make all strings equal
  5. Maximum Possible Product in Array after performing given Operations
  6. Queries to count the number of unordered co-prime pairs from 1 to N
  7. Find single in an array of 2n+1 integer elements
  8. Check if a given array is pairwise sorted or not
  9. Lexicographically next string
  10. Sum of all the prime divisors of a number
  11. Modify a bit at a given position
  12. Smallest subarray with k distinct numbers
  13. std::next_permutation and prev_permutation in C++
  14. atanh() function in C++ STL
  15. Check if a large number is divisible by 13 or not
  16. Next word that does not contain a palindrome and has characters from first k
  17. Sparse Table
  18. Range sum query using Sparse Table
  19. boost::split in C++ library
  20. append() and extend() in Python
  21. Python String Title method
  22. issubset() in python
  23. set add() in python
  24. set clear() in python
  25. filter() in python
  26. Check whether given three numbers are adjacent primes
  27. Given 1's, 2's, 3's ......k's print them in zig zag way.
  28. string center() in python
  29. Python String | istitle()
  30. String endswith() in Python
  31. Python String | find()
  32. String partition() in Python
  33. Python String | split()
  34. Python String | zfill()
  35. Python map() function
  36. Python reversed() function
  37. String rjust() and ljust() in python()
  38. Python set symmetric_difference_update()
  39. String rindex() in python
  40. Python String | rsplit()
  41. Python String | rfind()
  42. Python Dictionary clear()
  43. Python Dictionary copy()
  44. Find the position of the last removed element from the array
  45. copysign() function in C++
  46. equalsIgnoreCase() in Java
  47. StringBuffer insert() in Java
  48. Perfect power (1, 4, 8, 9, 16, 25, 27, ...)
  49. Square pyramidal number (Sum of Squares)
  50. Squared triangular number (Sum of cubes)
  51. Number of integers with odd number of set bits
  52. std::bitset::to_ullong and std::bitset::to_ulong in C++ STL
  53. lrint() and llrint() in C++
  54. fabs() in C++
  55. remainder() in C++
  56. fdim() in C++
  57. Minimum digits to remove to make a number Perfect Square
  58. Possible two sets from first N natural numbers difference of sums as D
  59. Pairs involved in Balanced Parentheses
  60. Sum of range in a series of first odd then even natural numbers
  61. log1p() in C++
  62. remquo() in C++
  63. expm1() in C++
  64. ldexp() in C++
  65. frexp() in C++
  66. Program to find Nth term of series 1, 3, 12, 60, 360…
  67. atan2() function in C++ STL
  68. acosh() function in C++ STL
  69. acos() function in C++ STL
  70. sinh() function in C++ STL
  71. Number of squares of maximum area in a rectangle
  72. cosh() function in C++ STL
  73. tanh() function in C++ STL
  74. asinh() function in C++ STL
  75. Compute power of power k times % m
  76. Different ways to represent N as sum of K non-zero integers
  77. Make all numbers of an array equal
  78. Find three integers less than or equal to N such that their LCM is maximum
  79. Check if the large number formed is divisible by 41 or not
  80. Minimum number of single digit primes required whose sum is equal to N
  81. Number of ways to represent a number as sum of k fibonacci numbers
  82. Shortest distance between two nodes in an infinite binary tree
  83. Check if is possible to get given sum from a given set of elements
  84. Minimum cost path from source node to destination node via an intermediate node
  85. Sum of sum of all subsets of a set formed by first N natural numbers
  86. Longest common anagram subsequence from N strings
  87. First element greater than or equal to X in prefix sum of N numbers using Binary Lifting
  88. Number of paths from source to destination in a directed acyclic graph
  89. array at() function in C++ STL
  90. array get() function in C++ STL
  91. Intersecting rectangle when bottom-left and top-right corners of two rectangles are given
  92. Check if a point lies on or inside a rectangle | Set-2
  93. Find First element in AP which is multiple of given prime
  94. Minimum multiplications with {2, 3, 7} to make two numbers equal
  95. Count elements in the given range which have maximum number of divisors
  96. Numbers with sum of digits equal to the sum of digits of its all prime factor
  97. LongBuffer get() methods in Java
  98. LongBuffer slice() method in Java
  99. LongBuffer wrap() method in Java
  100. LongBuffer arrayOffset() method in Java
  101. LongBuffer hasArray() method in Java
  102. LongBuffer allocate() method in Java
  103. LongBuffer duplicate() method in Java
  104. LongBuffer put() methods in Java
  105. LongBuffer compact() method in Java
  106. LongBuffer asReadOnlyBuffer() method in Java
  107. LongBuffer equals() method in Java
  108. DoubleBuffer arrayOffset() method in Java With Examples
  109. DoubleBuffer compareTo() method in Java With Examples
  110. DoubleBuffer wrap() method in Java with Examples
  111. DoubleBuffer slice() method in Java with Examples
  112. DoubleBuffer asReadOnlyBuffer() method in Java with Examples
  113. DoubleBuffer equals() method in Java with Examples
  114. DoubleBuffer array() method in Java With Examples
  115. DoubleBuffer duplicate() method in Java with Examples
  116. DoubleBuffer allocate() method in Java With Examples
  117. DoubleBuffer compact() method in Java With Examples
  118. DoubleBuffer hasArray() method in Java with Examples
  119. DoubleBuffer put() methods in Java with Examples | Set 1
  120. Check whether a given point lies on or inside the rectangle | Set 3
  121. Sum of Factors of a Number using Prime Factorization
  122. Divide a number into two parts such that sum of digits is maximum
  123. Find four factors of N with maximum product and sum equal to N | Set 3
  124. Program to find N-th term of series 3, 5, 33, 35, 53....
  125. Find Nth number of the series 1, 6, 15, 28, 45, .....
  126. Program to find the N-th term of series 3, 5, 33, 35, 53…. | Set-2
  127. Find two distinct prime numbers with given product
  128. Program to find remainder when large number is divided by r
  129. Minimum changes required to make first string substring of second string
  130. Check n^2 - m^2 is prime or not
  131. Given a number x , find y such that x*y + 1 is not a prime
  132. Find count of Almost Prime numbers from 1 to N
  133. Find the largest good number in the divisors of given number N
  134. Sum of first N natural numbers by taking powers of 2 as negative number
  135. Check if it is possible to move from (a, 0) to (b, 0) with given jumps
  136. Check if it is possible to move from (0, 0) to (x, y) in N steps
  137. Program to find the Nth term of series 5, 12, 21, 32, 45......
  138. Program to find the Nth number of the series 2, 10, 24, 44, 70.....
  139. Program to find N-th term of series 1, 2, 11, 12, 21….
  140. Find N digits number which is divisible by D
  141. Number of solutions for x < y, where a <= x <= b and c <= y <= d and x, y are integers
  142. Find the number of rectangles of size 2*1 which can be placed inside a rectangle of size n*m
  143. Number of solutions for the equation x + y + z <= n
  144. Minimum increment operations to make the array in increasing order
  145. Check if a large number is divisible by 2, 3 and 5 or not
  146. Print values of 'a' in equation (a+b) <= n and a+b is divisible by x
  147. Number of squares of side length required to cover an N*M rectangle
  148. Maximum count of equal numbers in an array after performing given operations
  149. Find the sum of all multiples of 2 and 5 below N
  150. Convert given array to Arithmetic Progression by adding an element
  151. Find the sum of first N odd Fibonacci numbers
  152. Sum of all the multiples of 3 and 7 below N
  153. Minimum number of cuts required to make circle segments equal sized
  154. Find the number of primitive roots modulo prime
  155. Find the index of the left pointer after possible moves in the array
  156. Probability of getting more value in third dice throw
  157. Minimum number of moves required to reach the destination by the king in a chess board
  158. Sum of the digits of a number N written in all bases from 2 to N/2
  159. Check if N can be represented as sum of integers chosen from set {A, B}
  160. Check if N is divisible by a number which is composed of the digits from the set {A, B}
  161. Lexicographically smallest substring with maximum occurrences containing a's and b's only
  162. Maximum length substring with highest frequency in a string
  163. Find the maximum possible value of the minimum value of modified array
  164. Sub-strings that start and end with one character and have at least one other
  165. Find the non decreasing order array from given array
  166. Possible cuts of a number such that maximum parts are divisible by 3
  167. Find the sum of the all amicable numbers up to N
  168. Check if a number can be expressed as sum two abundant numbers
  169. Largest subset where absolute difference of any two element is a power of 2
  170. Shortest Path using Meet In The Middle
  171. Make Binary Search Tree
  172. Sub-string that contains all lowercase alphabets after performing the given operation
  173. Find the winner by adding Pairwise difference of elements in the array until Possible
  174. Maximum number of teams that can be formed with given persons
  175. Find the values of X and Y in the Given Equations
  176. Find maximum operations to reduce N to 1
  177. Source to destination in 2-D path with fixed sized jumps
  178. Given two binary strings perform operation until B > 0 and print the result
  179. Count primes that can be expressed as sum of two consecutive primes and 1
  180. Minimum number of given moves required to make N divisible by 25
  181. Minimum edges to be added in a directed graph so that any node can be reachable from a given node
  182. Minimum number of elements that should be removed to make the array good
  183. Minimum operations to make counts of remainders same in an array
  184. Make a tree with n vertices , d diameter and at most vertex degree k
  185. Find the number of distinct pairs of vertices which have a distance of exactly k in a tree
  186. Find the minimum number of preprocess moves required to make two strings equal
  187. Minimum number of given powers of 2 required to represent a number
  188. Greatest number less than equal to B that can be formed from the digits of A
  189. Number of ways to select a node from each connected component
  190. Count numbers which are divisible by all the numbers from 2 to 10
  191. Find last five digits of a given five digit number raised to power five
  192. Ways to place 4 items in n^2 positions such that no row/column contains more than one
  193. Find the shortest distance between any pair of two different good nodes
  194. Find the count of numbers that can be formed using digits 3, 4 only and having length at max N.
  195. Numbers that are not divisible by any number in the range [2, 10]
  196. Maximize profit when divisibility by two numbers have associated profits
  197. Find the sum of all Truncatable primes below N
  198. Find if the given number is present in the infinite sequence or not
  199. Find the number of good permutations
  200. Find the weight of the minimum spanning tree
  201. Find the numbers of strings that can be formed after processing Q queries
  202. Find the number of ways to divide number into four parts such that a = c and b = d
  203. Minimize the cost to split a number
  204. Find the maximum number of composite summands of a number
  205. Given count of digits 1, 2, 3, 4, find the maximum sum possible
  206. Find the good permutation of first N natural numbers
  207. Find the number of different numbers in the array after applying the given operation q times
  208. Minimum steps to color the tree with given colors
  209. Find the number of integers from 1 to n which contains digits 0's and 1's only
  210. Find the number of jumps to reach X in the number line from zero
  211. Find the minimum number of steps to reach M from N
  212. Shortest path from source to destination such that edge weights along path are alternatively increasing and decreasing
  213. Check if a given number divides the sum of the factorials of its digits
  214. Find the number of integers x in range (1,N) for which x and x+1 have same number of divisors
  215. Length of the longest increasing subsequence such that no two adjacent elements are coprime
  216. Find n positive integers that satisfy the given equations
  217. Find the Kth node in the DFS traversal of a given subtree in a Tree
  218. Find (1^n + 2^n + 3^n + 4^n) mod 5 | Set 2
  219. Lazy Propagation in Segment Tree | Set 2
  220. Find the longest sub-string which is prefix, suffix and also present inside the string
  221. Find the minimum number of operations required to make all array elements equal
  222. Convert the undirected graph into directed graph such that there is no path of length greater than 1
  223. Minimum number of changes such that elements are first Negative and then Positive
  224. Find the sum of the number of divisors
  225. Find the number of sub arrays in the permutation of first N natural numbers such that their median is M
  226. Find the number of divisors of all numbers in the range [1, n]
  227. Find the minimum number of rectangles left after inserting one into another
  228. Check if a directed graph is connected or not
  229. Find permutation of first N natural numbers that satisfies the given condition
  230. Count of integers of the form (2^x * 3^y) in the range [L, R]
  231. Check if a string contains two non overlapping sub-strings "geek" and "keeg"
  232. Count of all possible values of X such that A % X = B
  233. Maximum possible sub-array sum after at most X swaps
You may use GeeksforGeeks CONTRIBUTE portal to help other geeks. For more info, please refer this.

pawan_asipu hasn't improved any 'Articles' yet!
You may use GeeksforGeeks CONTRIBUTE portal to help other geeks. For more info, please refer this.