Trainee software developer Interview Questions
5K
Trainee Software Developer interview questions shared by candidates
Merge Linked list
10 Answers↳
Round 1 had very basic quant and C output questions. Try to solve Test your C skills. Round 2: 1. Reverse Linked List(shocked to see this). 2. Merge Linked List. 3. Sort alphanumeric array 4. Some pattern question. 5. Find 2 numbers in the sorted array having sum closest to the given number. Less
↳
can I use python in coding round of libsys recruitment process
↳
Can you please tell which type of c/c++ questions were asked in the technical apti? Less
Why u chose IT? Why do want to join syntel?
6 Answers↳
Results are announced some of my friends got selected ,nd they joined syntel chennai by 7th August Less
↳
Sep 1st week
↳
I gave hr interview in pune on 19 august. When i can expect results ?
Difficult Quantitative questions
6 Answers↳
I got shortlisted for further rounds with NetCracker.
↳
Could you please tell me the tough one which was asked in coding
↳
Are you selected?
WAP to find and print second largest digit in the given number? ( without using arrays, functions and using only one loop).
5 Answers↳
while (num>0) { int dig = num % 10; if(dig > largest) { if(seclarg dig && dig > seclarg) seclarg = dig; num /= 10; } Less
↳
while(n){ x=n%10; if(max1x) max2=x; n=n/10; } } Less
↳
#include using namespace std; int main() { int n,x,max1=0,max2=0; cin>>n; while(n>0) { x=n%10; if(max1>x) {if(max2 Less
count number of star (*) in between two bar(|) in a substring of a given string( **|*|***)
5 Answers↳
for(int i=0;i
↳
str1= "**|*|***" li=[] count=0 for x in range(len(str1)): if str1[x]=='|': li.append(x) min_i=li[0] max_i=li[-1] for i in range(min_i,max_i): if str1[i]=="*": count+=1 print(count) Less
↳
import java.util.Scanner; // ****|**|*** public class Ques_13_findStar { public static void main(String[] args) { Scanner s = new Scanner(System.in); System.out.println(findStar(s.next())); } private static int findStar(String str) { int count = 0; int start = 0; for (int i = 0; i < str.length(); i++) { if(str.charAt(i)=='|'){ start = i; break; } } for (int i = start+1; i < str.length(); i++) { if(str.charAt(i)!= '|'){ count++; } } return count-1; } } Less
what will system.out print do?
4 Answers↳
I agree with you...this company cannot be trusted.they don't know how to take interviews.these people will never appreciate your knowledge. Less
↳
If you have reference than you will be treated very well. Even if you don't have technical knowledge Less
↳
3 months 4 rounds of interview just shows how screwed up their hiring process is. Less
1. Write a program in C to print the following pattern if value for S and N are given. Say if S=3,N=3 the pattern should be: 3 44 555 555 44 3
4 Answers↳
#include #include int main() { int s=3,i,j; int n=3; for(i=3;i=3;i--) { for(j=i;j>=3;j--) { printf("%d",i); } printf("\n"); } } Less
↳
#include void main() { int s=3, n=3, i, j; printf("Enter the value of s and n:\n"); scanf("%d %d", &s, &n); printf("The value of s = %d and n = %d:\n", s, n); for(i=0;i=0;j--) { printf("%d",s); } s++; printf("\n"); } s--; for(i=n;i>=0;i--) { for(j=0;j Less
↳
#include int main() { int s=3,n=3,i,j; for(i=s;i=s;i--) { for(j=0;j<=(i-n);j++) { printf("%d",i); } printf("\n"); } } Less
this was asked in second round. harder one: print the pattern 33333 32223 32123 32223 33333
4 Answers↳
#include using namespace std; #include int main() { int n,p; cin>>n; p=n; int r=0,c = 2*n-1; vector> arr(c); for(int i=0;i(c); while(n>0) { for(int i=r; i=r;i--) { arr[c-1][i]=n; } for(int i=c-2;i>=r+1;i--) { arr[i][r]=n; } n--; r++; c--; } c=2*p-1; for(int i=0;i Less
↳
#include using namespace std; #include int main() { int n,p; cin>>n; p=n; int r=0,c = 2*n-1; vector> arr(c); for(int i=0;i(c); while(n>0) { for(int i=r; i=r;i--) { arr[c-1][i]=n; } for(int i=c-2;i>=r+1;i--) { arr[i][r]=n; } n--; r++; c--; } c=2*p-1; for(int i=0;i Less
↳
#include using namespace std; void print(int a[100][100],int size) { for(int i=0;i Less
questions Lcm and addition of array 1 hour time
4 Answers↳
Python solution in O(n) time. l=list(map(int,input().split()) s=sum(l) #it gives the sum of array in O(n) time. for i in l: print(s-i,' ') Less
↳
superrr
↳
easy
