1. Count of sub-sequences which satisfy the given condition
  2. Find maximum among x^(y^2) or y^(x^2) where x and y are given
  3. Find the Kth smallest element in the sorted generated array
  4. Find minimum length sub-array which has given sub-sequence in it
  5. Check if two strings are permutation of each other
  6. Check if array can be divided into two sub-arrays such that their absolute difference is K
  7. Find gcd(a^n, c) where a, n and c can vary from 1 to 10^9
  8. Add two unsigned numbers using bits
  9. Number of possible pairs of Hypotenuse and Area to form right angled triangle
  10. Tail recursion to calculate sum of array elements.
  11. Maximum possible intersection by moving centers of line segments
  12. Number of Permutations such that no Three Terms forms Increasing Subsequence
  13. Count numbers which can be represented as sum of same parity primes
  14. Number of ways a convex polygon of n+2 sides can split into triangles by connecting vertices
  15. Check if Decimal representation of an Octal number is divisible by 7
  16. Find minimum possible digit sum after adding a number d
  17. Find maximum in a stack in O(1) time and O(1) extra space
  18. Check whether it is possible to join two points given on circle such that distance between them is k
  19. Maximize number of nodes which are not part of any edge in a Graph
  20. Minimum number of nodes in an AVL Tree with given height
  21. Optimal sequence for AVL tree insertion (without any rotations)
  22. MakeFile in C++ and its applications
  23. Find if array has an element whose value is half of array sum
  24. In-Place Merge Sort
  25. Find a value whose XOR with given number is maximum
  26. Generate all rotations of a number
  27. Minimum operations required to modify the array such that parity of adjacent elements is different
  28. Find Intersection of all Intervals
  29. Find sub-matrix with the given sum
  30. Minimum index i such that all the elements from index i to given index are equal
  31. Number of trailing zeroes in base 16 representation of N!
  32. Minimum operations to make frequency of all characters equal K
  33. Numbers in a Range with given Digital Root
  34. Check if Matrix remains unchanged after row reversals
  35. Check if the given array can be reduced to zeros with the given operation performed given number of times
  36. Minimum length of square to contain at least half of the given Coordinates
  37. Maximal Disjoint Intervals
  38. Maximum points covered after removing an Interval
  39. Check if factorial of N is divisible by the sum of squares of first N natural numbers
  40. Find triplet such that number of nodes connecting these triplets is maximum
  41. Minimum increments to convert to an array of consecutive integers
  42. Find if nCr is divisible by the given prime
  43. Find N distinct numbers whose bitwise Or is equal to K
  44. Count pairs of elements such that number of set bits in their AND is B[i]
  45. Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
  46. Maximum subset sum such that no two elements in set have same digit in them
  47. Find the element in the matrix generated by given rules
  48. Find if a binary matrix exists with given row and column sums
  49. Find optimal weights which can be used to weigh all the weights in the range [1, X]
  50. Number of Quadruples with GCD equal to K
  51. Flipkart Interview Experience | On-Campus Internship
  52. DE-Shaw & Co Interview Experience | On-Campus Internship
  53. Find number of subarrays with XOR value a power of 2
  54. Largest sub-matrix with all equal elements
  55. Significant Inversions in an Array
  56. Minimum halls required for class scheduling
  57. Kth number from the set of multiples of numbers A, B and C
  58. Minimum numbers with one's place as 9 to be added to get N
  59. Count of triplets in an array that satisfy the given conditions
  60. Find if there exists a direction for ranges such that no two range intersect
  61. Number of ways to divide string in sub-strings such to make them in lexicographically increasing sequence
  62. Diameter of a Binary Indexed Tree with N nodes
  63. Find number of square of area Z which can be built in a matrix having blocked regions
  64. Find if a crest is present in the index range [L, R] of the given array
You may use GeeksforGeeks CONTRIBUTE portal to help other geeks. For more info, please refer this.