Upload Button Icon Add office photos

Tredence

Compare button icon Compare button icon Compare

Filter interviews by

Tredence Full Stack Developer Interview Questions and Answers

Updated 11 Oct 2024

Tredence Full Stack Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Sep 2024. There were 3 interview rounds.

Round 1 - Coding Test 

You will be getting questions on the tech stack you have experience with, in depth questions on Node js and React js, real time challenges faced, two coding questions (1 easy and 1 medium)

Round 2 - Coding Test 

F2f round for about 1.5 hrs, you be given a task to create a functionality using frontend tech stack you have chosen, more coding questions medium level, framework related ij depth questions

Round 3 - Behavioral 

(2 Questions)

  • Q1. Previous experience and questions related to that
  • Q2. More questions on how to approach a problem

Interview questions from similar companies

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Mostly questioned asked related to projects like cors platform, hibernate and general java

I applied via Company Website and was interviewed in Jun 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Related to react js amd js

Interview Preparation Tips

Interview preparation tips for other job seekers - Average interview. There will he two rounds technical. One will be telephonic and second will be skyp video.
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Group Discussion 

Topic about what happens when actress enter into politics

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Design pattern how we used in programming language
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Jun 2024. There was 1 interview round.

Round 1 - Coding Test 

Programming language, c, html, css, javascript, php, angular,

Interview Preparation Tips

Topics to prepare for ITC Infotech Full Stack Developer interview:
  • full stack web develaper
Interview preparation tips for other job seekers - full stock webdevelapre
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Basic aptitude reasoning

Round 2 - Coding Test 

Core js angular react

Round 3 - HR 

(2 Questions)

  • Q1. Expectations regarding the job and salary
  • Ans. 

    I expect challenging projects, opportunities for growth, competitive salary based on experience and skills.

    • Expect to work on challenging projects that will help me grow as a developer

    • Opportunities for career advancement and skill development

    • Expect a competitive salary based on my experience and skills

    • Looking for a supportive work environment with opportunities for collaboration and learning

  • Answered by AI
  • Q2. Performance and location based questioning
Interview experience
2
Poor
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Oct 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Online zoom coding test will be there - 4 questions - 2 about output of code & 2 about technical questions.

Round 2 - Technical 

(2 Questions)

  • Q1. Polymorphism and explain about virtual polymorphism
  • Ans. 

    Polymorphism is the ability of a single function or method to operate on different types of data.

    • Polymorphism allows objects of different classes to be treated as objects of a common superclass.

    • Virtual polymorphism is achieved through virtual functions in C++.

    • Virtual functions allow a function in a base class to be overridden in a derived class.

    • Example: Animal class with virtual function 'makeSound' overridden in Dog a

  • Answered by AI
  • Q2. Write code for virtual polymorphism and explain
  • Ans. 

    Virtual polymorphism allows objects of different classes to be treated as objects of a common superclass.

    • Create a base class with virtual functions

    • Create derived classes that override the virtual functions

    • Use pointers or references of the base class to call the overridden functions

  • Answered by AI
Round 3 - HR 

(3 Questions)

  • Q1. About yourself should explain
  • Q2. Reason for job change
  • Q3. Salary negotiations and location

Interview Preparation Tips

Interview preparation tips for other job seekers - I have interviewed for c++ developer role in incedo company - please make sure you are completely aware of every functions and keywords relate to c++ concepts.

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed before Dec 2023. There were 3 interview rounds.

Round 1 - Aptitude Test 

Coding questions and some aptitude questions

Round 2 - Technical 

(1 Question)

  • Q1. Asked oops concept
Round 3 - HR 

(1 Question)

  • Q1. What is ur 5year goal
  • Ans. 

    My 5-year goal is to become a lead software developer in a reputable tech company, leading a team of developers and working on cutting-edge projects.

    • Advance my technical skills by learning new programming languages and technologies

    • Gain experience in project management and leadership roles

    • Contribute to open-source projects and attend tech conferences to network and stay updated with industry trends

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Nothing much like advice just study

Tredence Interview FAQs

How many rounds are there in Tredence Full Stack Developer interview?
Tredence interview process usually has 3 rounds. The most common rounds in the Tredence interview process are Coding Test and Behavioral.
How to prepare for Tredence Full Stack Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Tredence. The most common topics and skills that interviewers at Tredence expect are Node.Js, React.Js, Javascript, Data Management and Data Mining.

Tell us how to improve this page.

Tredence Full Stack Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Tredence Full Stack Developer Salary
based on 4 salaries
₹13 L/yr - ₹15 L/yr
61% more than the average Full Stack Developer Salary in India
View more details
Consultant
408 salaries
unlock blur

₹6.5 L/yr - ₹21 L/yr

Associate Manager
373 salaries
unlock blur

₹12.5 L/yr - ₹36.5 L/yr

Senior Business Analyst
251 salaries
unlock blur

₹6.5 L/yr - ₹17 L/yr

Data Engineer
221 salaries
unlock blur

₹6 L/yr - ₹22 L/yr

Business Analyst
173 salaries
unlock blur

₹6 L/yr - ₹12 L/yr

Explore more salaries
Compare Tredence with

ITC Infotech

3.6
Compare

CMS IT Services

3.1
Compare

KocharTech

3.9
Compare

Xoriant

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview