Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Find the nearest smaller number for every element such that the smaller element is on left side #3626

Open
3 tasks
saurabhgoyaliitr opened this issue Jun 30, 2018 · 1 comment
Labels
new algorithm For issues pertaining to the creation of new algorithms

Comments

@saurabhgoyaliitr
Copy link
Contributor

This is a(n):

  • [x ] New algorithm
  • Update to an existing algorithm
  • Error
  • Proposal to the Repository

Details:
Given an array of integers, find the nearest smaller number for every element such that the smaller element is on left side.
Implementation language: C++
Data Structure used: Stack

AdiChat added a commit that referenced this issue Jul 16, 2018
Fixes issue #3626 Find the nearest smaller number one left side for each element in an array
@arnavb arnavb added the new algorithm For issues pertaining to the creation of new algorithms label Feb 24, 2019
@busamate
Copy link

Is this solved? If its not, can i solve it?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
new algorithm For issues pertaining to the creation of new algorithms
Projects
None yet
Development

No branches or pull requests

3 participants