READMEs adjustment

Author: andrei-punko

README.md

@@ -38,6 +38,7 @@ Gradle isn't required because of embedded Gradle presence in the project
 - [search](src/main/java/by/andd3dfx/search)
 - [serialization](src/main/java/by/andd3dfx/serialization)
 - [sorting](src/main/java/by/andd3dfx/sorting)
+- [stream](src/main/java/by/andd3dfx/stream)
 - [string](src/main/java/by/andd3dfx/string)
 - [tree](src/main/java/by/andd3dfx/tree)
 

interview-materials/code-review/code-review-0.md

@@ -1,3 +1,5 @@
+# Perform refactoring of this code
+
 ## Before refactoring:
 
 ```java

interview-materials/code-review/code-review-1.md

@@ -1,4 +1,4 @@
-# Propose solution by looking on logs
+# Propose solution by looking on app logs
 
 ## Task definition
 

interview-materials/code-review/code-review-2.md

@@ -1,3 +1,5 @@
+# Perform review of this code
+
 ```java
 public class DirectoryFolder {
     private Long id;

interview-materials/code-review/code-review-3.md

@@ -1,3 +1,5 @@
+# Perform review of this code
+
 ```java
 // Сделать ревью кода сервиса DataService и метода создания/получения новой сущности Data.
 // Метод создания может вызваться из разных потоков и должен быть безопасен для такого режима использования.

interview-materials/preparation-to-interview.md

@@ -65,12 +65,12 @@ https://yandex.ru/jobs/faq
 
 ## Not Yandex
 
-First, it is highly recommended to start reading the following book (engineering sections):
+Highly recommended the following book (engineering sections):
 http://www.crackingthecodinginterview.com/contents.html
 
 What to revise:
-• complexity of sorting algorithms
-• after solving every issue algorithm’s time complexity is usually discussed
-• DFS/BFS are frequently asked during coding interviews
-• solving some Dynamic programming problems would be useful because they are less intuitive than for example Greedy
-• Questions similar to climbing stairs: https://leetcode.com/problems/climbing-stairs/description
+- complexity of sorting algorithms
+- after solving every issue algorithm’s time complexity is usually discussed
+- DFS/BFS are frequently asked during coding interviews
+- solving some Dynamic programming problems would be useful because they are less intuitive than for example Greedy
+- Questions similar to climbing stairs: https://leetcode.com/problems/climbing-stairs/description

sql/README.md

@@ -21,4 +21,4 @@
 - [16. Задача про стадионы и матчи](16.sql)
 - [17. Поиск сотрудников, менеджеры которых покинули компанию](17.sql)
 
-See [video solutions](https://youtu.be/GjDF_LdwYHU) of these tasks on YouTube
+See [video](https://youtu.be/GjDF_LdwYHU) on YouTube with solution of these tasks