2053. Kth Distinct String in an Array
A distinct string is a string that is present only once in an array.
Given an array of strings
arr, and an integerk, return thekth*distinct string present inarr. If there are fewer thankdistinct strings, return an empty string*"".Note that the strings are considered in the order in which they appear in the array.
3244. Shortest Distance After Road Addition Queries II
You are given an integer
nand a 2D integer arrayqueries.There are
ncities numbered from0ton - 1. Initially, there is a unidirectional road from cityito cityi + 1for all0 <= i < n - 1.
queries[i] = [ui, vi]represents the addition of a new unidirectional road from cityuito cityvi. After each query, you need to find the length of the shortest path from city0to cityn - 1.There are no two queries such that
queries[i][0] < queries[j][0] < queries[i][1] < queries[j][1].Return an array
answerwhere for eachiin the range[0, queries.length - 1],answer[i]is the length of the shortest path from city0to cityn - 1after processing the firsti + 1queries.
3243. Shortest Distance After Road Addition Queries I
You are given an integer
nand a 2D integer arrayqueries.There are
ncities numbered from0ton - 1. Initially, there is a unidirectional road from cityito cityi + 1for all0 <= i < n - 1.
queries[i] = [ui, vi]represents the addition of a new unidirectional road from cityuito cityvi. After each query, you need to find the length of the shortest path from city0to cityn - 1.Return an array
answerwhere for eachiin the range[0, queries.length - 1],answer[i]is the length of the shortest path from city0to cityn - 1after processing the firsti + 1queries.