Create count_of_Smaller_Numbers_After_Self.py

[Swish78]

This code takes an array of integers as input and returns an array of the number of elements in the array that are smaller than each element from the input array, using a binary search algorithm to maintain a sorted list.

[github-actions]

You are making strides, keep up the good work 🔥 an don't forget to star⭐ this repo

[fms12]

you are file should structure like this. @Swish78

• DATA-STRUCTURE-AND-ALGORITHM-IN-PY
  • LinkedList
    • Doubly
    • Singly
    • ReversedSingly <----------- This will be your newly created folder
      • solution.py <----------- Write the code for the implementation here
      • test_solution.py <----------- Write a test for it here to make sure it's working

[fms12]

@Swish78 try to resolve the deep source issues. so you will get to know more.

[fms12]

@Swish78 what is other files you have pushed ?