# Akanksha Agrawal

- 3yrs exp
- Python, ABAP (20-80)
- In memory storage.

# Question 1: Find the 2nd largest number in an integer array.
ex- [1, 2, 2, 2]
- [2, 1, 2, 4, 3, 1]
- [2,2,2]

def findSecondLargest(nums):
    
    if len(nums) == 0:
        return "List is empty"
    
    first_Largest = -float(inf)
    second_largest = -float(inf)
    
    
    for i in range(len(nums)):
        
        if nums[i]>first_largest:
            first_largest = nums[i]
            
    for i in range(len(nums)):
        
        if nums[i] > second_largest and second_largest<first_largest:
            second_largest = nums[i]
            
    
    if second_largest == first_largest or second_largest == -float(inf): 
        return "There is no second largest"
    
    return second_largest
        
        
        

# Question 2:

order is placed at 5:38PM...

7:38 -> sms/notifications.

5:39 -> 7:39
5:40 -> 7:40

(5.39,7.39)

# Question 3:

[0s.. 1s... 2....]

sort array.

< O(nlogn)

no_of_zeros += 1
no_of_ones += 1
no_of_twos += 1

for _ in range(no_of_zeros):
res.append(0)