Can anyone help me solve this question

#1

Can anyone pls help me solve Q3 in the given document
https://1drv.ms/b/s!Al9xIYmMuIkqiDdWAcp0ddaFYJFF?e=fJkBBz

#2

i think dequeue can be implemented here but am not getting the logic…

#3

https://1drv.ms/b/s!Al9xIYmMuIkqiDdWAcp0ddaFYJFF?e=fJkBBz

#4

You want me to write the code? Because the logic is explained in the 2 paras written below, i.e., you maintain a queue of finish times , and whenever a new element comes ,pop those elements whose finish time was less, so that the buffer size is again maximised. If there is space then insert the element, otherwise drop it.

#5

it would be good if u write the code…:slight_smile:

#6


I have tried the code here…pls check

#7

Thanks in advance…:slight_smile:

#8

Okay I’ll write a simpler implementation. Please Wait.

1 Like
#9

i think some error is there in the else part…

#10

thnx…

#11

Okay this https://ide.codingblocks.com/s/245438 this passes the sample test cases.

#12

its not giving any o/p…getting sigsegv

#13

Please try this https://ide.codingblocks.com/s/245449

#14

yea sure i am trying…

#15

still am getting the same sigsegv…lets debug

#16

Is it giving sigsegv for sample? The new code which I sent?

#17

yeah its giving sigsegv for the sample

#18

It shouldn’t ,please click on the new code its running fine on the hackerblocks ide.

#19

yeah its running…net problem sorry…

#20

Okay if you don’t have any further doubts please mark this as resolved.