Software Engineer

Step 1: I read the problem statement clearly and then I thought about the algorithms .
Step 2 : I test my algorithms on test cases .
Step 3 : I solved this question using while loop according to given condition if the number is even I can 
divide and increase the count steps and then in other case subtract by 1 and increase the count 
steps and finally return the count.
Step 4 : Solution 

class Solution:
def numberOfSteps(self, num: int) -> int:
count = 0
while (num):
if (num % 2 == 0):
num //= 2
count+=1
else:
num -= 1
count+=1
return count

Step 1: I read the problem statement carefully and check the time constraints . 
Step 2 : According to time constraints , Sorting came to my mind and I solve this question using sorting 
method.
Step 3 : I sort the array and I know that I have to find smallest positive number . So I checked for that 
positive missing number in a row and then return the answer.
Step 4 : Solution
def missingNumber(arr,n):
temp=0
arr.sort()
for i in range(n):
if (arr[i]==temp+1):
temp+=1
return temp+1

Step 1 : I carefully read the problem and then I asked about the edge cases like if any number is not 
repeating then in that case what should I return ? I asked about the Time constraints . 
Step 2 : After carefully observing the problem . Hashing came to my mind , I explain my approach to 
Interviewer , he was satisfied with my approach . Asked me to write only function . In between this I 
explained loudly whatever I think .
Step 3 : Explained the Time complexity and Space Complexity 
Step 4 : Solution
#User function Template for python3
from collections import defaultdict
class Solution:
#Function to return the position of the first repeating element.
def firstRepeated(self,arr, n):
ans = -1
mp = defaultdict(lambda : 0)
for i in range(n):
mp[arr[i]] += 1

for i in range(n):
if(mp[arr[i]] > 1):
ans = i+1
return ans
return ans

Tip 1:Practice Sql question from Hackerrank
Tip 2:Practice DBMS theory and practical from Gate Smashers and just before Interview practice Top 50 question of DBMS and SQL from any sheet.

Tip 1: I made my own answer , I don't copy from Internet , only took reference from Internet
Tip 2: Practice HR question in front of mirror , record your answer .
Tip 3: Before interview always revise two to thee times , be confident explain your truth don't lie too much 
about yourself . Be true to yourself. 
Tip 4 : Ask your friends to take mock interview of yours before actual Interview . This will boost your 
confidence.