solves time needed to buy tickets

Author: anishLearnsToCode

Diff for: README.md

@@ -492,7 +492,7 @@
 | 2057 | [Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value)                                                          |                                                           [![Java](assets/java.png)](src/SmallestIndexWithEqualValue.java)                                                           |                                                                                                                                   |
 | 2062 | [Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string)                                                    |                                                          [![Java](assets/java.png)](src/CountVowelSubstringsOfAString.java)                                                          |                                                                                                                                   |
 | 2068 | [Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent)                          |                                                    [![Java](assets/java.png)](src/CheckWhetherTwoStringsAreAlmostEquivalent.java)                                                    |                                                                                                                                   |
-| 2073 | [Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets)                                                                    |                                                                                                                                                                                      |                                                                                                                                   |
+| 2073 | [Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets)                                                                    |                                                             [![Java](assets/java.png)](src/TimeNeededToBuyTickets.java)                                                              |                                                                                                                                   |
 | 2078 | [Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors)                                      |                                                                                                                                                                                      |                                                                                                                                   |
 | 2085 | [Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence)                                            |                                                                                                                                                                                      |                                                                                                                                   |
 | 2089 | [Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array)                                          |                                                                                                                                                                                      |                                                                                                                                   |

Diff for: src/TimeNeededToBuyTickets.java

@@ -0,0 +1,12 @@
+// https://leetcode.com/problems/time-needed-to-buy-tickets
+// T: O(|tickets|)
+// S: O(1)
+
+public class TimeNeededToBuyTickets {
+    public int timeRequiredToBuy(int[] tickets, int k) {
+        int time = 0;
+        for (int i = 0 ; i < k ; i++) time += Math.min(tickets[i], tickets[k]);
+        for (int i = k + 1 ; i < tickets.length ; i++) time += Math.min(tickets[i], tickets[k] - 1);
+        return time + tickets[k];
+    }
+}