Add LongestIncreasingSubsequenceNLogN class and corresponding test class

[huseynovvusal]

Hello, everyone! I added O(nlogn) solution of Longest Increasing Subsequence problem with simple and easy-to-follow explanations.

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized it.
• All filenames are in PascalCase.
• All functions and variable names follow Java naming conventions.
• All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
• All new code is formatted with clang-format -i --style=file path/to/your/file.java

[codecov-commenter]

Codecov Report

Attention: Patch coverage is 94.73684% with 1 line in your changes missing coverage. Please review.

Project coverage is 73.80%. Comparing base (c8177e3) to head (6b7b6fe).

Files with missing lines	Patch %	Lines
...programming/LongestIncreasingSubsequenceNLogN.java	94.73%	0 Missing and 1 partial ⚠️

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #6221      +/-   ##
============================================
+ Coverage     73.78%   73.80%   +0.01%     
- Complexity     5304     5310       +6     
============================================
  Files           672      673       +1     
  Lines         18357    18376      +19     
  Branches       3549     3553       +4     
============================================
+ Hits          13545    13562      +17     
  Misses         4265     4265              
- Partials        547      549       +2     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

[DenizAltunkapan]

LGM, but i think the actions will fail because there is no private constructor

[siriak]

Looks good, thanks!

[huseynovvusal]

Looks good, thanks!

Glad to hear! 🎉