1. Sort the given array using only O(n) solution: [0,1,1,1,0,0,0,1,0,1,0,1,1,0,0]
2. Which languages are you comfortable speaking: Hindi, Kannada, or English?
3. How do you prioritize tasks?
4. What are the agile ceremonies?
5. Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.
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.
