| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|2073|[Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2073.java)||Easy||

|2070|[Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2070.java)||Medium||

|2068|[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2068.java)||Easy||

|2063|[Vowels of All Substrings](https://leetcode.com/problems/vowels-of-all-substrings/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2063.java)||Medium||

packagecom.fishercoder.solutions;

importjava.util.Deque;

importjava.util.LinkedList;

publicclass_2073 {

publicstaticclassSolution1 {

publicinttimeRequiredToBuy(int[]tickets,intk) {

inttime =0;

Deque<int[]>queue =newLinkedList<>();

for (inti =0;i <tickets.length;i++) {

queue.addLast(newint[]{tickets[i],i});

}

while (!queue.isEmpty()) {

int[]curr =queue.pollFirst();

if (curr[0] -1 >0) {

queue.addLast(newint[]{curr[0] -1,curr[1]});

}

time++;

if (curr[1] ==k &&curr[0] -1 ==0) {

returntime;

}

}

returntime;

}

}

}