search

Algo-Phantoms / Algo-Tree

Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.
MIT License
361 stars 621 forks source link

Implementing Stack Concepts #127

Closed Shreyash41 closed 3 years ago

Shreyash41 commented 3 years ago

Hey there, I would like to Implement multiple Stack Concepts using C++ Language. Here is some stuff that I would like to add :

  1. Stock Span Problem
  2. Balanced Parenthesis.
  3. Largest Rectangular Area in Histogram.
  4. Infix to Prefix Conversion.

I would like to contribute as a participant of GSSOC'21.

Shreyash41 commented 3 years ago

@nakul-19 Hey there, I would like to contribute to this please assign it to me.

Nik-09 commented 3 years ago

Hello @nakul-19 @plazzy99 I would like to work on this issue as GSSoC participant. My language of work is python. please assign me . Thanks.

vatsalkesarwani12 commented 3 years ago

@Shreyash41 please mention the language in which you are going to contribute

AnjaliSrivastava722 commented 3 years ago

I would like to add solutions to stock span and balanced paranthesis problems in Java with test cases .Please assign this issue to me.#GSSOC21

Vansh-Gupta4 commented 3 years ago

Hey there, I would like to Implement multiple Stack Concepts using C++ Language. Here is some stuff that I would like to add : Stock Span Problem Balanced Parenthesis. Largest Rectangular Area in Histogram. Infix to Prefix Conversion.

I would love to contribute in this ...i will do it using java

Shreyash41 commented 3 years ago

@plazzy99 @nakul-19 Sir Since this is for GSSoC'21 it would be really nice if any mentor could add a GSSOC'21 label for this issue to avoid confusion.

Suvraneel commented 3 years ago

@plazzy99 @rudrakshi99 I'd love to submit the C++ solution to the above problems (in multiple time complexities for stock span - > O(n^2) & O(n)) Please assign me all these problems in C++ under GSSOC '21. Thanks

Additional : Infix to Postfix Postfix Evaluation (for multiple digit nos.) & other possible conversions among Infix, prefix, postfix

tarun26091999 commented 3 years ago

you cannot solve multiple problems in single issue.

Shreyash41 commented 3 years ago

@tarun26091999 I have already completed some parts. I make a new issue please assign it to me.