Longest increasing subsequence added

[sHiVaNgI821]

Added the longest_increasing_subsequence method that returns the longest strictly increasing subsequence that can be obtained from the given array. The lower_bound function used in the implementation has been taken from #351

References to other Issues or PRs or Relevant literature

Brief description of what is fixed or changed

Other comments

[codecov]

Codecov Report

Merging #364 (cb73fc2) into master (0f23c98) will increase coverage by 0.009%.
The diff coverage is 100.000%.

@@              Coverage Diff              @@
##            master      #364       +/-   ##
=============================================
+ Coverage   98.574%   98.583%   +0.009%     
=============================================
  Files           25        25               
  Lines         3297      3319       +22     
=============================================
+ Hits          3250      3272       +22     
  Misses          47        47               

Impacted Files	Coverage Δ
pydatastructs/linear_data_structures/__init__.py	100.000% <ø> (ø)
pydatastructs/linear_data_structures/algorithms.py	99.678% <100.000%> (+0.024%)	⬆️

[Smit-create]

@sHiVaNgI821 Please resolve merge conflicts since your previous PR has merged.

[Smit-create]

@czgdp1807 Please have a look

[czgdp1807]

Seems good. Would prefer to use, snake case instead of camel case in the doc string examples.

[Smit-create]

Looks ready to be merged.

[czgdp1807]

Will merge once the tests pass.

[czgdp1807]

Thanks.