I applied through college or university. The process took 2 months. I interviewed at tringapps in Feb 2016
Interview
I was selected through campus recruitment. The interview consists of 4 rounds. 1st round happened in my college which is presentation round, where your communication and attitude is verfied. 2nd and 3rd are Technical one and final one is personal HR. Last three rounds was conducted in Tringapps, Chennai. Technical round is bit tough, where they check your logical ability to solve a problem. Sometimes a interview may even extend for 2 hours (mine). Being really good in any programming language and data structure will be really helpful.
Interview questions [1]
Question 1
Linked List, array, think out of the box questions, function prototyping, polymorphism. Most of the time they give you real life scenario question and you need to write logic to solve that question which should be optimised one.
I applied through college or university. I interviewed at tringapps (Sivakasi) in Sep 2022
Interview
Its has four rounds.
1.mcq/ Programming.
2.Hacker earth
3.technical round
4.hr round
The interview was quite easy and the recruiter was friendly. I selected through college placement. The overall experience of the interview was good.
I applied through an employee referral. I interviewed at tringapps in Sep 2021
Interview
They are testing the skills. Asking about programming languages questions from OOPS, Java, Python, C program. They tell us to write one program they ask.
HR is very friendly with interview process . HR is very kindly with me.
Interview questions [1]
Question 1
Self introduction , Basics of programming languages.
I applied through college or university. The process took 2 weeks. I interviewed at tringapps (Chennai) in Apr 2020
Interview
The interview consists of three rounds
1. General tech questions
2. Coding question based on Data structures concept and also a simple for loop questions
3. HR interview with managerial questions
Interview questions [1]
Question 1
Data structure concepts on Stack, linked lists, trees