{"id":2320,"date":"2020-07-29T07:34:34","date_gmt":"2020-07-29T07:34:34","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=2320"},"modified":"2022-03-23T08:08:57","modified_gmt":"2022-03-23T08:08:57","slug":"valuable-time","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/valuable-time\/","title":{"rendered":"Valuable Time"},"content":{"rendered":"

\"\"<\/p>\n

Concepts Used<\/h3>\n
\n

Queues.<\/p>\n<\/blockquote>\n

Difficulty Level<\/h3>\n
\n

Easy.<\/p>\n<\/blockquote>\n

Problem Statement :<\/h3>\n
\n

Ravi is asked to solve a challenge by his friend Salma. He is given a sequence and is asked to perform operations on it such that the sequence becomes the same as Salma’s sequence in minimal time, and he need to clear the sequence during the process.<\/p>\n

In rotation operation<\/strong>, Ravi can remove the first element of his sequence and push it in the end, it takes 1 unit of time.<\/p>\n

In clear operation<\/strong>, an element can be removed from the front, each remove costs 1 unit of time for Ravi’s list. It is not necessary that clearing operation will be performed only after the sequence becomes the same, we can also clear if the front element of both sequences are the same. The clear operation will be performed on both the sequences and for Salma’s sequence it will take zero amount of time.<\/p>\n<\/blockquote>\n

<\/strong><\/u><\/a><\/p>\n

EXAMPLE:<\/h4>\n
Input\n5\n5 4 2 3 1\n5 2 1 4 3\n\nOutput\n7\n\nSample test case explanation\nWe can clear the first element as it is the same. Remaining sequence of Ravi is [4,2,3,1] and Salma is [2,1,4,3].\nSince the first of both lists are different, perform the rotation operation and Ravi's sequence will become [2,3,1,4].\nWe can clear the first element as it is the same. The remaining sequence of Ravi is \n[3,1,4], and Salma is [1,4,3].\nSince the first of both lists are different, perform the rotation operation and Ravi's sequence will become [1,4,3].\nWe can clear the first element as it is the same. The remaining sequence of Ravi is [4,3] and Salma is [4,3].\nWe can clear the first element as it is the same. The remaining sequence of Ravi is [3] and Salma is [3].\nWe can clear the first element as it is the same. The remaining sequence of Ravi is [] and Salma is [].\nSo a total of 7 units of time is taken.<\/code><\/pre>\n
Explanation:<\/h3>\n
\n
Push all the elements in their respective queues.<\/p>\n
Now start traversing from the front of each queue.<\/p>\n
If the front element of both the queues match, pop them out.<\/p>\n
Else rotate.<\/p>\n
Also increase the time counter in both the cases.<\/p>\n<\/blockquote>\n
Solutions:<\/h3>\n
\t\t\t\t\t\t