Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6368089
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 25, 20262026-05-25T00:37:54+00:00 2026-05-25T00:37:54+00:00

Does anyone know where I can get lots of challenging programming problems that involve

  • 0

Does anyone know where I can get lots of challenging programming problems that involve the use of stacks? I’ll like to challenge myself with super hard problems.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-25T00:37:54+00:00Added an answer on May 25, 2026 at 12:37 am

    My Favorite

    1. Convert Prefix expression to Postfix using stack
    2. Implement a stack with O(1) for access to max element
    3. Implement tower of hanoi without
      recursion. 🙂

    Take any damn recursive program , which is recursive by intuition, and try to implement it iteratively. Every recursive has a iterative solution.
    That should keep you busy for a while. 🙂

    BTW,
    Why dont you buy/borrow “Data Structures Using C and C++” by langsam/tennenbaum ?

    YOu will get sufficient problem for a week. 🙂

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Does anyone know how I can get a format string to use bankers rounding
Does anyone know where I can get a canonical XML document that uses every
Does anyone know how I can get rid of the following assembler warning? Code
Does anyone know how I can get the phone number of the device I
Does anyone know how I can get the helpful Eclipse popups with javadoc when
Does anyone know how I can get the value of an input box, without
Does anyone know where I can go to get a list of the new
Does anyone know how I can force CanExecute to get called on a custom
Does anyone know how can I get the path and URL of the Joomla
Does anyone know if you can get the time interval between break points in

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.