Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit d5ae6da

Browse files
Update README.md
1 parent 7b3cc4a commit d5ae6da

File tree

1 file changed

+3
-1
lines changed

1 file changed

+3
-1
lines changed

‎README.md

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,9 @@
33

44
## Challenge#1- Perfix Notation
55
#### Write a function that evaluates an expression written in Prefix Notiation and returrns a value
6-
_ Problem Statement:
6+
7+
**Problem Statement:
8+
79
Prefix notation (also known as polish notation) is an alternative to the more familier infix notation.
810

911
In infix notation, operators(add,multiply,etc) are written between their operands(number, variables, or sub-expression).

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /