I had a one-hour technical interview on HackerRank where I was asked two questions. One was a DSA question to be coded in **C++**, and the other was based on **JavaScript**. --- Q1. Leetcode 658 – Find K Closest Elements Link: https://leetcode.com/problems/find-k-closest-elements/description/ Given a sorted array `arr`, two integers `k` and `x`, return the `k` closest integers to `x` in the array. The result should also be sorted in ascending order. An integer `a` is closer to `x` than an integer `b` if: * `|a - x| < |b - x|`, or * `|a - x| == |b - x|` and `a < b` **Example Input**: ``` arr = [1,2,3,4,5], k = 4, x = 3 Output: [1,2,3,4] ``` **My C++ Code:** ```cpp #include #include #include #include #include #include using namespace std; int addNumbers(int a, int b) { return a+b; } // // // // // Input: arr = [1,2,3,4,5], k = 4, x = 3 int main() { // int size; vectorarr={23, 45, 67, 98}; int k=2; int x=75; // cin>>size; // for (int i=0;i>temp; // arr.push_back(temp); // } vector> diff; // vector diff(arr.size(),0); for(int i=0;i>pq; for(int i=0;ik) pq.pop(); } vectorans; while(pq.size()){ pair temp=pq.top(); ans.push_back(arr[temp.second]);//O(k) // cout<