Upload Button Icon Add office photos

Filter interviews by

TrustFort Full Stack Developer Interview Questions and Answers

Updated 12 Jul 2023

TrustFort Full Stack Developer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. What is the angular and its advantages?
  • Ans. 

    Angular is a popular front-end framework for building dynamic web applications.

    • Angular is developed and maintained by Google.

    • It uses TypeScript for building web applications.

    • Advantages include two-way data binding, dependency injection, and modular architecture.

    • Angular provides a rich set of built-in directives and components for faster development.

    • It has a large community and ecosystem for support and resources.

  • Answered by AI
  • Q2. What is node and its advantages?
  • Ans. 

    Node.js is a runtime environment that allows you to run JavaScript on the server side.

    • Node.js is built on Chrome's V8 JavaScript engine.

    • It uses an event-driven, non-blocking I/O model which makes it lightweight and efficient.

    • Node.js is commonly used for building scalable network applications.

    • Advantages include fast execution, easy scalability, and a large ecosystem of libraries and frameworks.

    • Example: Building a real-t...

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 33 questions in total. The objective questions were simple.

  • Q1. 

    Sort Big List Dates Problem Statement

    Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.

    Example:

    Inpu...
  • Ans. 

    Sort a list of event dates in ascending order based on year, month, and day.

    • Sort the list of dates based on year, then month, and finally day.

    • Use a sorting algorithm to rearrange the dates in ascending order.

    • Ensure the constraints are met for each date in the list.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Given an array and a target sum, find all pairs of elements that add up to the target sum.

    • Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the pairs based on the first element and then the second element.

    • Handle edge cases like duplicate elements and pairs with the same values.

    • Example...

  • Answered by AI
  • Q3. 

    Maximum Sum Problem Statement

    Given an integer N, your task is to recursively break it into three integer parts: N / 2, N / 3, and N / 4. You need to compute the maximum sum possible by dividing the numbe...

  • Ans. 

    Given an integer N, recursively break it into three parts and find the maximum sum possible.

    • Recursively divide N into N/2, N/3, and N/4 to find the maximum sum

    • Compare the sum obtained by dividing N with the sum of N itself

    • Return the maximum sum for each test case

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 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 interviewRejected

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

  • Q1. 

    Duplicate Integer in Array

    Given an array ARR of size N, containing each number between 1 and N-1 at least once, identify the single integer that appears twice.

    Input:

    The first line contains an integer...
  • Ans. 

    Identify the duplicate integer in an array containing numbers between 1 and N-1.

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

    • Return the element with a frequency greater than 1 as the duplicate integer.

    • Ensure the constraints are met and a duplicate number is guaranteed to be present.

  • Answered by AI
  • Q2. 

    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. 

    Calculate 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 node value to the path sum and multiply by 10 for each level

    • When reaching a leaf node, add the final path sum to the total sum

    • Return the total sum modulo (10^9 + 7)

  • Answered by AI
  • Q3. 

    Topological Sort Problem Statement

    You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.

    Explanation:

    A directed acyclic g...

  • Ans. 

    Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.

    • Create a graph data structure to represent the DAG

    • Use depth-first search (DFS) to perform topological sorting

    • Maintain a visited array to keep track of visited nodes

    • Return the ordering of nodes after DFS traversal

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on DSA.

  • Q1. 

    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.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Rotated Array Minimum Finder

    You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...

  • Ans. 

    Implement a function to find the minimum number in a rotated sorted array efficiently.

    • Use binary search to find the minimum element in the rotated array.

    • Compare the mid element with the start and end elements to determine which half of the array to search next.

    • Continue the binary search until the minimum element is found.

  • Answered by AI
  • Q3. 

    Maximum Binary Tree Construction Problem

    Given an array TREE of 'N' unique integers, construct a maximum binary tree using the following rules:

    1. The root of this tree is the maximum number in TREE.
    2. T...
  • Ans. 

    Construct a maximum binary tree from an array of unique integers following specific rules.

    • Find the maximum number in the array to set as the root of the tree.

    • Recursively construct the left subtree with elements before the maximum number.

    • Recursively construct the right subtree with elements after the maximum number.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley 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 interviewRejected

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: The test was for two and half hours where 1 hour was for general aptitude, 1 hr was for coding aptitude(either on java or C or C++as you choose) and 1/2 an hour for two coding questions.

Round: Technical Interview
Experience: In technical round they asked puzzles, aptitude questions and basic C coding. I was asked to write the code for two questions(one was on sort and search) and was asked the logic of two questions.They asked basics of linked lists, stacks, queues. Infact they were not very interested in the syntax and were pressing on the logic

General Tips: Being a non software branch students is not at all a problem. The company took 4 interns where 3 were from core branches. The fact that we had to work in JAVA and most of us didn't know JAVA, the company only looks for aptitude and ability to learn. So if you don't know anything, tell frankly that you don't know that part, rather than guessing. Be thorough with what you know and confidentially answer all the questions.
Also do not be tensed and take things lightly, if the interviewer is joking. Be candid.
Skill Tips: Learn basics of coding from books . Aptitude can be done from sites likes geeks for geeks, etc. The level of aptitude is not very high and infact the coding aptitude is also theoretical and does not involve in depth knowledge.
Skills:
College Name: NIT Surathkal

Interview Preparation Tips

Round: Test
Experience: Online Test (General aptitude, C aptitude ,Programming problems).

General Tips: Study basics of C and DSA well. Utilize the last summer vacations for studying for placements. Be confident and Honest.
Yes it is challenging and exhausting. It tests your patience. But final reward is also great so we must keep going toward it.
Skill Tips: Online coding sites such as Codechef, etc. Narasimha Karumanchi for data structures and algorithm will help in preparation.
Skills:
College Name: NIT Surathkal

I applied via Campus Placement

Interview Questionnaire 

2 Questions

  • Q1. How can a chemical Engineer help citi?
  • Ans. 

    A chemical engineer can help Citi by providing expertise in process optimization, risk management, and sustainability.

    • Optimizing Citi's manufacturing processes to reduce costs and increase efficiency

    • Developing risk management strategies to ensure compliance with environmental regulations

    • Implementing sustainable practices to reduce Citi's environmental impact

    • Providing technical expertise in chemical reactions and materi...

  • Answered by AI
  • Q2. He asked me about my JEE Rank, preparations

Interview Preparation Tips

Round: HR Interview
Experience: I had done many web and android apps. They asked me about my institute experience, things I have done here. It was an easy walk for me.

Skills: SQL, Java Programming
Duration: 2
College Name: IIT Madras

I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Check palindrome , anagram of string with O(n)
  • Ans. 

    To check palindrome and anagram of a string with O(n), use a hash table to store character frequencies.

    • Create a hash table to store the frequency of each character in the string.

    • For palindrome, check that no more than one character has an odd frequency.

    • For anagram, compare the hash tables of the two strings.

    • If the hash tables are equal, the strings are anagrams.

    • If the hash tables differ by only one character, the strin...

  • Answered by AI
  • Q2. Optimized solutions and core principles applied in OOPS
  • Ans. 

    Optimized solutions and core principles applied in OOPS

    • Encapsulation, Inheritance, Polymorphism, Abstraction are core principles of OOPS

    • Optimized solutions can be achieved through efficient algorithms and data structures

    • Design patterns like Singleton, Factory, Observer can also be used for optimized solutions

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - They are looking for best possible solutions. and they are not using that in project then also they ask

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Core java,multi threading and react

Interview Preparation Tips

Interview preparation tips for other job seekers - very good company. Interview process is very fair.

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Hard

  • Q1. 

    Find the Duplicate Number Problem Statement

    Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...

  • Ans. 

    Find the duplicate number in an integer array containing numbers from 0 to (N - 2).

    • Iterate through the array and keep track of the frequency of each number using a hashmap.

    • Return the number that appears twice in the array.

    • The duplicate number is always present in the given array.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 50 Minutes
Round difficulty - Easy

  • Q1. 

    Bubble Sort Problem Statement

    Sort an unsorted array of non-negative integers using the Bubble Sort algorithm, which swaps adjacent elements if they are not in the correct order to sort the array in non-d...

  • Ans. 

    Bubble Sort is used to sort an array of non-negative integers in non-decreasing order by swapping adjacent elements if they are not in the correct order.

    • Iterate through the array and compare adjacent elements, swapping them if they are in the wrong order.

    • Repeat this process until the array is sorted in non-decreasing order.

    • Time complexity of Bubble Sort is O(n^2) in worst case.

    • Example: For input [6, 2, 8, 4, 10], the o

  • Answered by AI
Round 3 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Unweighted Graph Shortest Path Problem

    You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N houses numbered from 1 ...

  • Ans. 

    Find the shortest path between two houses in a city represented as an unweighted graph.

    • Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.

    • Start BFS from the source house and keep track of the shortest path to each house.

    • Once the destination house is reached, backtrack to find the shortest path.

    • Consider using a queue data structure to implement BFS efficiently.

  • Answered by AI
Round 4 - HR 

Round duration - 60 Minutes
Round difficulty - Easy

Interview Preparation Tips

Eligibility criteria7Morgan Stanley interview preparation:Topics to prepare for the interview - Java , spring, aws,azure, Algorithm, computer Architecture, compiler designTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : online resources
Tip 2 : cracking the coding interview by Gayle laykemann this is one of the best book for learning the concept at the initial level. Start practicing the approaches mention in the book once done apply the same to similar level pattern questions.
Tip 3 : geeks for geeks start from school level and then move towards easy medium and hard once done practice the previous year questions

Application resume tips for other job seekers

Tip 1 : precise clear concise and well written 
Tip 2 : mentions the skills sets along with the projects

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Jul 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Rate your self out of 5?

TrustFort Interview FAQs

How many rounds are there in TrustFort Full Stack Developer interview?
TrustFort interview process usually has 2 rounds. The most common rounds in the TrustFort interview process are Resume Shortlist and One-on-one Round.
How to prepare for TrustFort 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 TrustFort. The most common topics and skills that interviewers at TrustFort expect are Angularjs, Bootstrap, CSS, Front End and HTML.
What are the top questions asked in TrustFort Full Stack Developer interview?

Some of the top questions asked at the TrustFort Full Stack Developer interview -

  1. What is the angular and its advantag...read more
  2. What is node and its advantag...read more

Tell us how to improve this page.

TrustFort Full Stack Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Wells Fargo Interview Questions
3.8
 • 570 Interviews
Citicorp Interview Questions
3.7
 • 568 Interviews
Bajaj Finserv Interview Questions
4.0
 • 523 Interviews
HSBC Group Interview Questions
3.9
 • 487 Interviews
Xyz Company Interview Questions
3.8
 • 460 Interviews
American Express Interview Questions
4.2
 • 364 Interviews
BNY Interview Questions
3.9
 • 346 Interviews
UBS Interview Questions
3.9
 • 336 Interviews
Morgan Stanley Interview Questions
3.7
 • 291 Interviews
View all
Compare TrustFort with

Bajaj Finserv

4.0
Compare

Wells Fargo

3.8
Compare

JPMorgan Chase & Co.

3.9
Compare

HSBC Group

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