Tip 1 : Practise DSA problems
Tip 2 : Implement design patterns
Tip 3 : Create multiple projects
Tip 1 : Make it crisp and clear 1 page resume should be fine for fresher
Tip 2 : Include projects and your contribution
This was online coding questions round two easy level coding questions were asked



Two strings are isomorphic if a one-to-one mapping is possible for every character of the first string ‘str1’ to every character of the second string ‘str2’ while preserving the order of the characters.
All occurrences of every character in the first string ‘str1’ should map to the same character in the second string, ‘str2’.
If str1 = “aab” and str2 = “xxy” then the output will be 1. ‘a’ maps to ‘x’ and ‘b’ maps to ‘y’.
If str1 = “aab” and str2 = “xyz” then the output will be 0. There are two different characters in 'str1', while there are three different characters in 'str2'. So there won't be one to one mapping between 'str1' and 'str2'.
Tip 1 : String manipulation approach
Tip 2 : Two pointer method
Tip 3 : Practise on online platforms



Tip 1 : Solved using Hashmap
Tip 2 : Try using data structure for this kind of question
Tip 3 : Practise medium level question from internet
The technical Round was an easy one, no tough questions were asked as such
Tip 1 : Be truthful whatever you have done
Tip 2 : Go through the concepts of DBMS
Tip 3 : Also read the theory of OOPs
It was a programming round. 2 coding questions were asked by the interviewer



F(n) = F(n-1) + F(n-2),
Where, F(1) = F(2) = 1.
For ‘N’ = 5, the output will be 5.
Iterative: Initialize the first and second numbers to 0 and 1. Following this, we print the first and second numbers. Then we send the flow to the iterative while loop where we get the next number by adding the previous two number and simultaneously we swap the first number with the second and the second with the third.



Iterative - Using hashmap calculate count
Managerial Round. Only single puzzle was asked in this round.
How to Measure 45 minutes using two identical wires?
Tip 1 : If we light a stick, it takes 60 minutes to burn completely. What if we light the stick from both sides? It will take exactly half the original time, i.e. 30 minutes to burn completely.
Tip 2 : 0 minutes – Light stick 1 on both sides and stick 2 on one side.
Tip 3 : 30 minutes – Stick 1 will be burnt out. Light the other end of stick 2.45 minutes – Stick 2 will be burnt out. Thus 45 minutes is completely measured.
It was a HR round
Tip 1 : Be truthful and tell about your contribution
Tip 2 : Stay confident

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?