Status: Software Engineer at British Telecom
Position: Senior Software Engineer at Tally solutions
Location: Bangalore, India

Round-1--> F2F technical round around 2 hour
Q1.Tell me about your self?
Q2.Tell me something which is not mentioned in your resume?
Q3.Draw the architecture of your project and explain the component on which you have worked?
Q4.WAP to check whether two linked list intersect or not? if yes then return the distance of an intersecting point from the first list// Time complexity->O(n+m), space- O(1)
Q5. follow up question can you reduce time complexity of the above one?// can be done by using a set
Q6.WAP to validate whether one string s1 is an anagram of string s2? but the twist was according to him a string is ananagram of another if they maintain the relative position of acharacter.
ex->
String s2="kanhaiya" String s1="aha" is anagram but
String s3="hna" is not
Q7.WAP to print all anagrams of string s1 indirectly means print all subset of strings.
Tips-->
Mostly you will be working in C or C++ over there.