Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Technical round with questions on DSA mainly.



If the given string is: STR = "abcde". You have to print the string "edcba".
Try to solve the problem in O(1) space complexity.
Traverse the string and swap the first character with the last character, the second character with the second last character and so on.
Basically, you need to swap the i-th character with the (N-i-1)-th character where N is the length of the string and 0-based indexing is considered.



Let ‘ARR’ be: [1, 4, -5]
The subarray [1, 4, -5] has a sum equal to 0. So the count is 1.
The basic idea is to find all the subarrays of the array and check whether the sum of that subarray is 0. If the sum is zero, we increase our count.
Technical round with questions on OOPS concepts mainly.
What are Static/final/instance variables and methods?
SQL basics, 2nd highest salary
HR round with behavioural questions mainly.
1. Why TIBCO?
2. Where do you see yourself after 5 years?

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