Topic: stack-problem / Level: beginner

• 951. Write a program to push elements into a stack and remove all multiples of both 2 and 9.
• 952. Create a function to push numbers into a stack and count how many of them are prime and greater than 50.
• 953. Write a program to reverse every third element in a stack using recursion.
• 954. Implement a function to push the elements of a queue into a stack and pop them in reverse order.
• 955. Write a program to push elements into a stack and remove every second element divisible by 3.
• 956. Create a function to push the digits of a number into a stack and reverse them if the number is greater than 100.
• 957. Write a program to push numbers into a stack and count how many of them are divisible by 4 and 6.
• 958. Implement a function to reverse every fourth element in a stack using a second stack.
• 959. Write a program to push elements into a stack and pop them until their product exceeds 300.
• 960. Create a function to push elements into a stack and count how many of them are perfect squares.
• 961. Write a program to reverse the digits of all numbers divisible by 5 in a stack using recursion.
• 962. Implement a function to push elements into a stack and pop elements in groups of 4.
• 963. Write a program to push numbers into a stack and remove every multiple of 13.
• 964. Create a function to push elements into a stack and count how many of them are greater than 60.
• 965. Write a program to reverse every second group of k elements in a stack without recursion.
• 966. Implement a function to push the elements of a matrix into a stack column by column and reverse them.
• 967. Write a program to push elements into a stack and remove every number that is divisible by both 3 and 10.
• 968. Create a function to push the elements of an array into a stack and remove every third element.
• 969. Write a program to reverse the digits of numbers in a stack that are divisible by both 2 and 7.
• 970. Implement a function to push elements from two stacks into a third stack, alternating between them.
• 971. Write a program to push elements into a stack and pop elements until their sum exceeds 400.
• 972. Create a function to push numbers into a stack and count how many of them are odd.
• 973. Write a program to reverse every second element in a stack using recursion.
• 974. Implement a function to push the elements of a binary search trees postorder traversal into a stack.
• 975. Write a program to push elements into a stack and remove all prime-indexed elements.
• 976. Create a function to reverse the top n elements of a stack using recursion.
• 977. Write a program to push numbers into a stack and remove all multiples of both 4 and 5.
• 978. Implement a function to push the digits of a number into a stack and reverse them if the number is a perfect cube.
• 979. Write a program to reverse every fourth element in a stack using recursion.
• 980. Create a function to push elements into a stack and count how many of them are divisible by both 3 and 6.
• 981. Write a program to push the elements of a matrix into a stack diagonally and reverse them.
• 982. Implement a function to reverse every second pair of elements in a stack.
• 983. Write a program to push elements into a stack and remove all elements smaller than the top element.
• 984. Create a function to push numbers into a stack and count how many of them are divisible by both 5 and 8.
• 985. Write a program to reverse every second group of k elements in a stack using a second stack.
• 986. Implement a function to push elements into a stack and remove the first element that is greater than 25.
• 987. Write a program to push numbers into a stack and pop elements until their product exceeds 500.
• 988. Create a function to push the digits of a number into a stack and reverse them if the number is divisible by 6.
• 989. Write a program to push elements into a stack and count how many of them are prime numbers.
• 990. Implement a function to reverse the first half of a stack using recursion.
• 991. Write a program to push elements into a stack and remove every second element starting from the top.
• 992. Create a function to push the elements of a queue into a stack and print them in reverse order.
• 993. Write a program to push numbers into a stack and count how many of them are divisible by 9.
• 994. Implement a function to reverse every second element in a stack using a second stack.
• 995. Write a program to push elements into a stack and remove every number that is a multiple of 7.
• 996. Create a function to push numbers into a stack and count how many of them are greater than 75.
• 997. Write a program to reverse the digits of all prime numbers in a stack using recursion.
• 998. Implement a function to push the elements of a matrix row by row into a stack and reverse them.
• 999. Write a program to push elements into a stack and count how many of them are greater than the top element.
• 1000. Create a function to push numbers into a stack and remove every second number that is divisible by 4.

• More Levels

• Intermediate
• Advanced