Skip to content

Commit ddbf3ed

Browse files
authored
Create README.md
1 parent 038fa0e commit ddbf3ed

File tree

1 file changed

+13
-0
lines changed

1 file changed

+13
-0
lines changed

README.md

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
# codejava
2+
core java code
3+
One.java and BuySell java are two of the interview questions asked in PayTm interview.
4+
One.java
5+
the string "5+6*7-60" should be reversed in "60-7*6+5"
6+
========
7+
8+
BuySell.java
9+
===================
10+
The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling in those days.
11+
For example, if the given array is {100,180,260,310,40,535,695} the maximum profit can earned by buying on day 0, selling on day 3.
12+
Again buy on day 4 and sell on day 6. If the given array of prices is sorted in decreasing order, then profit cannot be earned at
13+
all.

0 commit comments

Comments
 (0)