Hello,\n\nCan someone help with the this question, \n\nHow to find the minumum absolute diff among the last k numbers from incoming stream of integers. \n\nExample: arr = [3,8,-10,23,19,-4,-14,27], k = 3\nAns = 10, since K = 3, last 3 elements [-4, -14, 27], abs min diff among these is 10. \n\nmin absolute diff in fixed array would take O(n logn) time with sorting and single traversal for consecutive comparison \n\nIf the input is incoming stream of integers, I would store incoming numbers fixed storage of queue of size k, (this would help us to know which elements are added and remove) since we are interested in last k numbers in the incoming stream of numbers and also store last k numbers in a Binary search tree(BST) for doing the consecutive comparisons in the sorted order. \nAn enqueue into queue tells this needs to added to BST and dequeued number to be removed from the BST. and modifered inorder travsersal on this BST gives the min absolute diff for the last K numbers. \n\nDo you guys know if there is anyother better approach ?\n

Hello,\n\nCan someone help with the this question, \n\nHow to find the minumum absolute diff among the last k numbers from incoming stream of integers. \n\nExam