To maintain documentation, it doesn't matter if you use GitHub or another service for storing code, we recommend using Markdown.
We recommend starting each top-level README file with title, about section, and links to your profile on service belongs to repository.
# leetcode-java
## About
Some solved problems from [LeetCode](https://leetcode.com) on Java.
## Links
Profile on LeetCode: [fartem](https://leetcode.com/fartem/).After the introductory information, you need to create a table with links to the task and its solution, as well as divide everything into categories from your source.
For example, for LeetCode, the division will be into Easy, Medium, and Hard.
## Problems
### Easy
| Name | Link to LeetCode | Link to solution |
| -------------------- | -------------------------------------------------------- | ------------------------------------------------------------------------------------- |
| 1. Two Sum | [Link](https://leetcode.com/problems/two-sum/) | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/TwoSum.java) |
| 9. Palindrome Number | [Link](https://leetcode.com/problems/palindrome-number/) | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/PalindromeNumber.java) |
### Medium
| Name | Link to LeetCode | Link to solution |
| ------------------------------------------------- | ------------------------------------------------------------------------------------- | ----------------------------------------------------------------------------------------------------------------- |
| 2. Add Two Numbers | [Link](https://leetcode.com/problems/add-two-numbers/) | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/AddTwoNumbers.java) |
| 3. Longest Substring Without Repeating Characters | [Link](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/medium/LongestSubstringWithoutRepeatingCharacters.java) |For Codewars, the sections will be different - 8 kyu, 7 kyu and so on for each
difficulty level.
## Katas
### 8 kyu
| Name | Link to Codewars | Link to solution |
| -------------------------------- | -------------------------------------------------------------- | -------------------------------------------------------------------------------------------------- |
| Abbreviate a Two Word Name | [Link](https://www.codewars.com/kata/57eadb7ecd143f4c9c0000a3) | [Link](./src/main/java/com/smlnskgmail/jaman/codewarsjava/kyu8/AbbreviateATwoWordName.java) |
| Age Range Compatibility Equation | [Link](https://www.codewars.com/kata/5803956ddb07c5c74200144e) | [Link](./src/main/java/com/smlnskgmail/jaman/codewarsjava/kyu8/AgeRangeCompatibilityEquation.java) |
### 7 kyu
| Name | Link to Codewars | Link to solution |
| --------------------- | -------------------------------------------------------------- | ----------------------------------------------------------------------------------------- |
| All Inclusive? | [Link](https://www.codewars.com/kata/5700c9acc1555755be00027e) | [Link](./src/main/java/com/smlnskgmail/jaman/codewarsjava/kyu7/AllInclusive.java) |
| Alphabetical Addition | [Link](https://www.codewars.com/kata/5d50e3914861a500121e1958) | [Link](./src/main/java/com/smlnskgmail/jaman/codewarsjava/kyu7/AlphabeticalAddition.java) |Different programming languages and frameworks can use their own structure to work with project files.
We recommend using the general rules for working with a project for your programming language or framework.
The only rule that applies here is that you don't need to mix all the code in one folder. Divide your solutions by complexity categories, or by topics (working with lists, binary trees, and search).
In addition to explicitly dividing the files into different sections, name the files using the task number (if they exists). Some programming languages (Dart for example) contain a basic linter rule for naming files, where it is forbidden to use numbers in the file name. If you don't need the rule except in this case, disable it in the linter settings.
We need this rules for easy viewing your files. If you are searching solution from LeetCode, it is easy to navigate by problem number, not its name.
100_same_tree.dart
101_symmetric_tree.dart
104_maximum_depth_of_binary_tree.dart
108_convert_sorted_array_to_binary_search_tree.dartIf you have a question, issues, or comment, write to artem.fomchenkov@outlook.com.