Skip to content

Commit 4d8245a

Browse files
committed
Chapter 9.2 - Grammarly + Upper Letter Titles
1 parent ad201ed commit 4d8245a

File tree

1 file changed

+6
-6
lines changed

1 file changed

+6
-6
lines changed

chapter-09-problems-for-champions-part-2.md

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
1-
# Chapter 9.2. Problem for Champions – Part II
1+
# Chapter 9.2. Problems for Champions – Part II
22

3-
In this chapter we, will review three additional problems that belong to the category "**for champions**", i.e., they are more complex than the rest of the problems in this book.
3+
In this chapter, we will review three additional problems that belong to the category "**for champions**", i.e., they are more complex than the rest of the problems in this book.
44

5-
## More complex problems on the studied material
5+
## More Complex Problems on The Studied Material
66

77
Before moving on to particular problems, we must clarify that we can solve them more efficiently with **additional knowledge in programming with Java** (methods, arrays, collections, recursion, etc.). Each solution that we will provide now only uses the material covered in this book. The goal is to learn how to construct **more complex algorithms** based on your knowledge up to the present moment.
88

@@ -69,7 +69,7 @@ Let's examine each of the parts in detail.
6969

7070
The input of our problem consists of a few components:
7171
- On the **first line, we have all the money** that Lina has for shopping.
72-
- On **each of the following lines**, we will have kind of **command**.
72+
- On **each of the following lines**, we will have a **command**.
7373

7474
The first part of the reading is trivial. We should keep in mind that we will be using the **`BigDecimal`** type because we are working with money, and we need precise accuracy:
7575

@@ -91,7 +91,7 @@ The algorithm for solving the problem is a direct one – we continue **reading
9191

9292
Let's examine the first two sub-problems for our algorithm. The first sub-problem concerns the way we read the commands until we reach the **"mall.Exit"** command. The solution that we previously saw uses a **`while-loop`**. The second sub-problem is to **access each symbol** of the command passed. Keeping in mind that the input data with the commands is a **`String`** type, the easiest way to access each symbol inside the strings is via a **`foreach` loop**.
9393

94-
Here is how the code will look like when are using those two types of loops:
94+
Here is what the code will look like when are using those two types of loops:
9595

9696
![](assets/chapter-9-2-images/01.Passion-days-03.png)
9797

@@ -133,7 +133,7 @@ How can we do that? We will leave the answer to this question to the reader.
133133
Test your solution here: [https://judge.softuni.org/Contests/Practice/Index/664#0](https://judge.softuni.org/Contests/Practice/Index/664#0).
134134

135135

136-
### Problem: Numerical Expression
136+
### Problem: X Expression
137137

138138
Bonny is an extremely powerful witch. Because her natural power is not sufficient to successfully fight vampires and werewolves, she has started to master the power of Expressions. An expression is hard to master because the spell relies on the ability to **quickly solve mathematical expressions**.
139139

0 commit comments

Comments
 (0)