Tip 1 : Don't stick to a single topic too much. Cover all and prepare short notes for all the topics so it will be easier for revision.
Tip 2 : Do projects so that they will be an added weightage.
Tip 3 : Practice a minimum of 100 questions on that particular topic so that it will be easy to crack within no time.
Tip 1 : Projects add good weight to the resume. So the interviewer asks the questions based on that.
Tip 2 : Resume should be genuine. You have to be confident of whatever is written in your resume.
It was coding coding round consisting of two questions and we were supposed to finish it within 60 minutes



F(n) = F(n-1) + F(n-2),
Where, F(1) = F(2) = 1.
For ‘N’ = 5, the output will be 5.
This problem is a simple recursive problem. But time complexity of simple recursive calls is exponential. In O(long) this problem can be solved using a simple trick.
If n is even then k = n/2:
F(n) = [2*F(k-1) + F(k)]*F(k)
If n is odd then k = (n + 1)/2
F(n) = F(k)*F(k) + F(k-1)*F(k-1)
This method will solve this question in O(long).



String ‘A’ is said to be similar to string ‘B’ if and only if
1. ‘A’ is equal to ‘B’.
2. Divide both ‘A’ and ‘B’ into two – two strings ‘A1’, ‘A2’ , ‘B1’ and ‘B2’ such that both of them('A1' and 'A2') have same size. Then at least one of the following must hold true:
a. ‘A1’ is similar to ‘B1’ and ‘A2’ is similar to ‘B2’.
b. ‘A1’ is similar to ‘B2’ and ‘A2’ is similar to ‘B1’.
I solved this problem using this approach.
Let’s define the following operation on string S. We can divide it into two halves and if we want we can swap them. And also, we can recursively apply this operation to both of its halves. By careful observation, we can see that if after applying the operation on some string A, we can obtain B, then after applying the operation on B we can obtain A. And for the given two strings, we can recursively find the least lexicographic string that can be obtained from them. Those obtained strings if are equal, the answer is YES, otherwise NO. For example, the least lexicographically string for “aaba” is “aaab”. And least lexicographically string for “abaa” is also “aaab”. Hence both of these are equivalent.
General round
1. To write a function that will swap two numbers (2 or 3 fixed), i.e. if I got 2, I need to return 3 and vice versa.
2. Write SQL query for a table given by him.
3. Two classes are there Base and Derived where Derived class is inheriting Base class If we create an object of Derived class, and called destructor from it which destructor will be called first.
4. What is the difference between a Process and a Thread?
5. What is Deadlock? How to prevent it?
6. Give examples of any two Network Protocols and the layers at which they work.
7. What happens when you type URL in your browser?
8. Check whether two strings are equivalent or not, one of them being an abbreviation of the other. (Case-Insensitive)
For example String: Internationalization Abbr: I18n where 18 are the number of characters between I and N
Be clear with your btech syllabus...must go through oops concept, dbms, operating system
General daily life questions
1. Questions on my hobbies, that I have mentioned while introducing myself.
2. Tell me about your three personality traits, according to your friend’s/colleagues’ perspective.
3. How do you react to a scenario where you as an intern got converted for full time but your close friend working with you got rejected?
4. Location preference? Why are you opting for that specific choice?
Tip 1: Be confident
Tip 2: Always answer logically
Tip 3: Keep a soft smile on your face while answering

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?