docs(leetcode): add solution and documentation for 1365. How Many Numbers Are Smaller Than the Current Number

docs/content/docs/leetcode/1365.mdx

@@ -0,0 +1,19 @@
+---
+title: LC-1365
+description: How Many Numbers Are Smaller Than the Current Number
+---
+
+## OverviewProblem solving guide for Technical Interviews
+
+Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j's such that j != i and nums[j] < nums[i].
+
+### Examples
+
+| Control            | Purpose               | Default  |
+| ------------------ | --------------------- | -------- |
+| `--typeset-size`   | Base text size        | `1em`    |
+| `--typeset-leading`| Line height           | `1.75`   |
+| `--typeset-flow`   | Space between blocks  | `1.25em` |
+
+
+### Constraints