Tip 1 : Have clear concepts of Aptitudes
Tip 2 : Have clear concepts of fundamentals of programming
Tip 3 : At least have a project
Tip 1 : Simple and to the point
Tip 2 : Mention the main things in which you are confident
It was a Technical Round. Here I was asked few coding questions and also few technical questions related OOPS, C language, Array, Pointer etc.



F(n) = F(n - 1) + F(n - 2),
Where, F(1) = 1, F(2) = 1
"Indexing is start from 1"
Input: 6
Output: 8
Explanation: The number is ‘6’ so we have to find the “6th” Fibonacci number.
So by using the given formula of the Fibonacci series, we get the series:
[ 1, 1, 2, 3, 5, 8, 13, 21]
So the “6th” element is “8” hence we get the output.
#include
int main() {
int i, n;
// initialize first and second terms
int t1 = 0, t2 = 1;
// initialize the next term (3rd term)
int nextTerm = t1 + t2;
// get no. of terms from user
printf("Enter the number of terms: ");
scanf("%d", &n);
// print the first two terms t1 and t2
printf("Fibonacci Series: %d, %d, ", t1, t2);
// print 3rd to nth terms
for (i = 3; i <= n; ++i) {
printf("%d, ", nextTerm);
t1 = t2;
t2 = nextTerm;
nextTerm = t1 + t2;
}
return 0;
}



#include
int main()
{
//let's assume the maximum array size as 100.
//initialize sum as 0. Otherwise, it will take some garbage value.
int arr[100], size, i, sum = 0;
//Get size input from user
printf("Enter array size\n");
scanf("%d",&size);
//Get all elements using for loop and store it in array
printf("Enter array elements\n");
for(i = 0; i < size; i++)
scanf("%d",&arr[i]);
//add all elements to the variable sum.
for(i = 0; i < size; i++)
sum = sum + arr[i]; // same as sum += arr[i];
//print the result
printf("Sum of the array = %d\n",sum);
return 0;
}
It was a Managerial and HR round.
Tip 1 : Stay honest
Tip 2 : Speak confidently
Tip 3 : Don't fake anything

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is the best case time complexity of Bubble Sort?