1. What is a strength of yours?
2. Write the code for Merge Sort.
3. Describe how to implement two stacks using a single array.
4. What is the effect on the exchange rate if the fiscal deficit increases?
5. Given an array, remove elements that appear consecutively for more than k times. Once removed, rejoin the left and right parts and remove again. Repeat until no such subarray exists. For example, given the array [1,1,2,2,3,3,3,2,2,4,1] and k=2, we remove [3,3,3] resulting in [1,1,2,2,2,2,4,1]. Then we remove [2,2,2,2] resulting in [1,1,4,1], which is the final array. Use a stack (push pair of element, current count, pop whenever count>k for any element).
Browse through a variety of job opportunities tailored to your skills and preferences. Filter by location, experience, salary, and more to find your perfect fit.
We have sent an OTP to your contact. Please enter it below to verify.
Instantly access job listings, apply easily, and track applications.
