Senior Software Engineer

You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.

Note :

Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.

You are given a Singly Linked List of integers. Sort the Linked List using merge sort.

Merge Sort is a Divide and Conquer algorithm. It divides the input into two halves, calls itself for the two halves, and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, L, M, R) is a key process that assumes that arr[L..M] and arr[M + 1...R] are sorted and merges the two sorted subarrays into one.

idfy_verification


pan, aadhar, voter ------ identity_types in idfy_verifications


status = 3 -> failed



idfy_verifications -> draft: 0, processing: 1, processed: 2, failed: 3, retry_exceeded: 4


1d id_type loan_id status. match_score updated_at

1 voter_id 112 1 5. date
2 voter_id 113 1 0
3 voter_id 113 3 1
4 voter_id 112 3 nil. 
5 voter_id 112 2 nil. 

Take the loan_ids which are status = 3 and status !=2 for that id_type and load_id

Design a Notification system which are

* Able send notification
* track - status
* multiple devices and channels