Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by TSS Consultancy Team. If you also belong to the team, you can get access from here

TSS Consultancy Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

TSS Consultancy Technical Support Engineer Interview Questions and Answers

Updated 29 Sep 2023

TSS Consultancy Technical Support Engineer Interview Experiences

2 interviews found

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

I applied via Naukri.com and was interviewed before Sep 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Nornal Test , not much difficult

Round 3 - HR 

(3 Questions)

  • Q1. Last Round with Tech lead and HR
  • Q2. Salary Discussion
  • Q3. Previous Work related

Interview Preparation Tips

Interview preparation tips for other job seekers - Good For Fresher
Not Recommended for Experience

I applied via Naukri.com and was interviewed in Jun 2020. There were 4 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Sql server related
  • Q2. Windos related

Interview Preparation Tips

Interview preparation tips for other job seekers - There are 3 round will be taken. first Online test , second round Technical, last Hr

Technical Support Engineer Interview Questions Asked at Other Companies

asked in Salesforce
Q1. Admin Questions :- What is Relationships what are types of relati ... read more
asked in Zoho
Q2. Send an email to customer apologising the mistake made by the rep ... read more
asked in Salesforce
Q3. How you will get contact of account with name starting with abc.
Q4. What are the steps which you will follow if a customer calls and ... read more
Q5. How to release previous IP which assign to your device?

Interview questions from similar companies

Interview Preparation Tips

Round: CGPA SHORTlist
Experience: They selected students who have CGPA greater than 8.5.After the selection was done,we had skype interviews where each student was given a slot.In the interview they ask you about 'tell me about yourself',your projects.You should explain the projects exactly and clearly.They ask you better alternatives for implementing the project.After that on the basis of the project they ask you questions related to that subject.Data structures is very important.After the questions on projects were asked they ask you to write programs on data structures(simple programs). They asked me a program to reverse a singly linked list. After that,if they are impressed with it,they go for databases.One should be thorough with functionalities of each key.If time permits they may ask you puzzles(some of my friends were asked). Quite an easy interview.They give you enough time to think so no worries.People with some interview experience can easily crack this.The main objective of the interviewer is he/she checks whether the student is perfect in the concepts learned.
Tips: Don't be panic.If you don't know anything directly say 'I don't know'. They ask you very easy questions.

General Tips: Don't be panic.Since this is skype interview you can be relaxed.Be cool and focussed .Listen to the interviewer questions carefully.
Skills: Database Management, Algorithms And Data Structures
College Name: VIT Vellore
Motivation: Company works on latest trends like azure,etc and they work on projects related to microsoft.

Interview Preparation Tips

Round: Test
Experience: 1st Round : 30 Aptitude Questions (Difficulty Level-HIGH) with nega
tive marking- My Score 15/30, Highest in the test
+ 2 Coding Questions ( Dyanamic Programming + N-Queens Problem)

Round: Technical Interview
Experience: Technical Interview- Questions based on recurssion DSA, HTML.

General Tips: Just know the project you have done in details , don't bluff
First Interview and got it in single shot.
Skill Tips: Karumanchi for DSA, w3 Schools for web related topics DBMS and SQL from Tutorial point.
Skills:
College Name: NIT Surathkal

I appeared for an interview before Oct 2020.

Round 1 - Face to Face 

(1 Question)

Round duration - 40 minutes
Round difficulty - Medium

Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?

  • Q1. 

    Flip Bits Problem Explanation

    Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...

  • Ans. 

    Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.

    • Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.

    • Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.

    • Return the maximum count of 1s obtained by flipping a sub-array at most once.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 20 minutes
Round difficulty - Medium

Asked 1 standard algorithm

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.

    • Mark visited cells to avoid redundant traversal.

    • Increment island count whenever a new island is encountered.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in HyderabadEligibility criteriaAbove 65%MAQ Software interview preparation:Topics to prepare for the interview - Data Structure, Design and analysis of algorithms, DBMS, operating system, computer network, competitive programmingTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : prepare for competitive programming
Tip 2 : know about standard algorithm
Tip 3 : must be good with dbms

Application resume tips for other job seekers

Tip 1 : must have projects, which you can explain to them
Tip 2 : have things on resume, that you are totally certain about.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Feb 2021. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Interview Preparation Tips

Interview preparation tips for other job seekers - Your resume should have SQL projects and you should be good at problem solving. Since there is data related work in company hence having knowledge of data science would really help

I applied via Campus Placement and was interviewed in Dec 2021. There was 1 interview round.

Interview Questionnaire 

11 Questions

  • Q1. Introduce yourself
  • Ans. 

    I am a software engineer with expertise in developing and maintaining software applications.

    • Proficient in programming languages such as Java, C++, and Python

    • Experienced in developing web applications using frameworks like Spring and Django

    • Skilled in database management and SQL queries

    • Familiar with software development methodologies like Agile and Scrum

    • Strong problem-solving and analytical skills

    • Excellent communication

  • Answered by AI
  • Q2. Given a table storing details of student like enrollment number, graduation date, enrollment date, output the recent 10 graduates details
  • Ans. 

    Output details of recent 10 graduates from a table storing student details.

    • Sort the table by graduation date in descending order.

    • Select the top 10 rows from the sorted table.

    • Output the selected rows.

  • Answered by AI
  • Q3. Find the third largest element from array, give the optimized approach using just half traversal of array.
  • Ans. 

    Optimized approach to find third largest element from array using half traversal.

    • Sort the array in descending order and return the element at index 2.

    • Use a max heap to keep track of the top 3 elements while traversing the array.

    • Use two variables to keep track of the second and third largest elements while traversing the array.

    • Divide the array into two halves and find the maximum and second maximum in each half, then co

  • Answered by AI
  • Q4. Print first character of words in a string 1) using one stack and 2)using an array.
  • Ans. 

    Answering how to print first character of words in a string using one stack and an array.

    • For using one stack, push each character onto the stack and pop when a space is encountered. Print the popped character.

    • For using an array, split the string into words and print the first character of each word.

    • In both cases, handle edge cases like empty string and string with only one word.

  • Answered by AI
  • Q5. Which data structure inserts and deletes in O(1) time and is it possible to create a data structure with insertion, deletion and search retrieval in O(1) time
  • Ans. 

    Hash table. No, it is not possible to create a data structure with all operations in O(1) time.

    • Hash table uses a hash function to map keys to indices in an array.

    • Insertion and deletion can be done in O(1) time on average.

    • Search retrieval can also be done in O(1) time on average.

    • However, worst-case scenarios can result in O(n) time complexity.

    • It is not possible to create a data structure with all operations in O(1) time

  • Answered by AI
  • Q6. What are acid properties , how two transactions occur simultaneously while maintaining Acid properties
  • Ans. 

    ACID properties ensure database transactions are reliable. Two transactions can occur simultaneously using locking and isolation.

    • ACID stands for Atomicity, Consistency, Isolation, and Durability.

    • Atomicity ensures that a transaction is treated as a single unit of work, either all or none of it is executed.

    • Consistency ensures that a transaction brings the database from one valid state to another.

    • Isolation ensures that co...

  • Answered by AI
  • Q7. What are indexes , example, Is it possible to have more than one clustered index and more than one non clustered index ?
  • Ans. 

    Indexes are used to improve query performance. Multiple clustered and non-clustered indexes can be created on a table.

    • Indexes are used to quickly locate data without scanning the entire table.

    • Clustered index determines the physical order of data in a table.

    • Non-clustered index is a separate structure that contains a copy of the indexed columns and a pointer to the actual data.

    • A table can have only one clustered index, b...

  • Answered by AI
  • Q8. Explain Project done and questions related to project were asked.
  • Q9. Given a array and a number , find whether number can be generated using sum of array members if yes output those numbers
  • Ans. 

    Given an array and a number, find if the number can be generated using sum of array members and output those numbers.

    • Iterate through the array and check if the number can be generated using the sum of array members

    • Use a hash table to store the difference between the number and each array element

    • If the difference is found in the hash table, output the corresponding array elements

    • If no such combination is found, output '

  • Answered by AI
  • Q10. Time complexity of various data structure operations
  • Ans. 

    Time complexity of data structure operations

    • Arrays: O(1) for access, O(n) for search/insert/delete

    • Linked Lists: O(n) for access/search, O(1) for insert/delete

    • Stacks/Queues: O(1) for access/insert/delete

    • Hash Tables: O(1) for access/insert/delete (average case)

    • Trees: O(log n) for access/search/insert/delete (balanced)

    • Heaps: O(log n) for access/insert/delete

    • Graphs: Varies depending on algorithm used

  • Answered by AI
  • Q11. Difference between span and div tag
  • Ans. 

    Span is an inline element used for styling small portions of text, while div is a block-level element used for grouping and styling larger sections of content.

    • Span is an inline element, div is a block-level element

    • Span is used for styling small portions of text, div is used for grouping larger sections of content

    • Span does not create a new line, div creates a new block-level element

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Explain your approach , don't be silent make it interactive, reason your answer, prepare acid properties and practice SQL queries for joins and finding sum and average ,referring primary key using foreign keys between two tables, for dsa learn time complexity of data structure and algorithm you explain.

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

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

Round 1 - Coding Test 

All three questions are leetcode medium level.

Round 2 - Aptitude Test 

10th level aptitude problem.

Round 3 - Technical 

(1 Question)

  • Q1. Discuss about my current project and DBMS and mysql
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

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

Round 1 - Aptitude Test 

It was an online assessment round with various MCQ questions.

Round 2 - Technical 

(1 Question)

  • Q1. 1 DSA question and discussion around projects
  • Ans. Was able to solve DSA question and explained projects
  • Answered Anonymously
Round 3 - Technical 

(2 Questions)

  • Q1. 1DSA question, react based questions, sql questions, normalisation
  • Q2. Was able to solve DSA question and answered all skill based questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare easy and medium level DSA questions, with strong knowledge of all your skill sets and projects.

I appeared for an interview in Mar 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 90 minutes
Round difficulty - Medium

A time range is given you can attempt with in that time and once started you cant resume .

  • Q1. 

    Sort String with Alternate Lower and Upper Case

    Given a string STR containing both lowercase and uppercase letters, the task is to sort the string so that the resulting string contains uppercase and lower...

  • Ans. 

    Sort a string with alternate lowercase and uppercase letters in sorted order.

    • Create two separate arrays for lowercase and uppercase letters.

    • Sort both arrays individually.

    • Merge the two arrays alternately to form the final sorted string.

  • Answered by AI
  • Q2. 

    Remove Invalid Parentheses

    Given a string containing only parentheses and letters, your goal is to remove the minimum number of invalid parentheses to make the input string valid and return all possible v...

  • Ans. 

    Given a string with parentheses and letters, remove minimum invalid parentheses to make it valid and return all possible valid strings.

    • Use BFS to explore all possible valid strings by removing parentheses one by one

    • Keep track of visited strings to avoid duplicates

    • Return all unique valid strings obtained after removing minimum number of parentheses

  • Answered by AI
  • Q3. 

    Nth Fibonacci Number Problem Statement

    Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.

    Input:

    ...
  • Ans. 

    Calculate the Nth Fibonacci number efficiently using dynamic programming.

    • Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.

    • Start with base cases F(1) and F(2) as 1, then iterate to calculate F(N) efficiently.

    • Time complexity can be optimized to O(N) using dynamic programming.

    • Example: For N = 5, the 5th Fibonacci number is 5.

  • Answered by AI
  • Q4. 

    Find the Kth Row of Pascal's Triangle Problem Statement

    Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.

    Example:

    Input:
    K = 2
    Output:
    1 1
    Input:
    K = 4
    Output:
    1 4 6 ...
  • Ans. 

    To find the Kth row of Pascal's Triangle given a non-negative integer K.

    • Create an array to store the values of the Kth row of Pascal's Triangle

    • Use the formula C(n, k) = C(n-1, k-1) + C(n-1, k) to calculate the values

    • Return the array as the output

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. I applied for the job as Software Engineer in MumbaiEligibility criteriaNo backlogsMAQ Software interview preparation:Topics to prepare for the interview - Core Java , Data Structures , SQL , Algorithms , OopsTime required to prepare for the interview - 15 daysInterview preparation tips for other job seekers

Tip 1 : Basics of java should be clear 
Tip 2 : Do maximum question on strings and array

Application resume tips for other job seekers

Tip 1 : Atleast 1 good project
Tip 2 : Good ranks on websites like hackerrank , leetcode.

Final outcome of the interviewRejected

Skills evaluated in this interview

TSS Consultancy Interview FAQs

How many rounds are there in TSS Consultancy Technical Support Engineer interview?
TSS Consultancy interview process usually has 3 rounds. The most common rounds in the TSS Consultancy interview process are Resume Shortlist, Aptitude Test and HR.
How to prepare for TSS Consultancy Technical Support Engineer 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 TSS Consultancy. The most common topics and skills that interviewers at TSS Consultancy expect are Back Office, Consultancy, Hedge Funds, IIS and SQL.
What are the top questions asked in TSS Consultancy Technical Support Engineer interview?

Some of the top questions asked at the TSS Consultancy Technical Support Engineer interview -

  1. sql server rela...read more
  2. Last Round with Tech lead and...read more
  3. Windos rela...read more

Tell us how to improve this page.

TSS Consultancy Technical Support Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

MagicBricks Interview Questions
4.4
 • 292 Interviews
Sheenlac Paints Interview Questions
4.5
 • 205 Interviews
Chegg Interview Questions
4.1
 • 156 Interviews
Tracxn Interview Questions
3.1
 • 102 Interviews
MAQ Software Interview Questions
1.9
 • 101 Interviews
CMA CGM Interview Questions
3.9
 • 92 Interviews
Teachnook Interview Questions
3.1
 • 87 Interviews
View all
TSS Consultancy Technical Support Engineer Salary
based on 8 salaries
₹1.5 L/yr - ₹2.6 L/yr
54% less than the average Technical Support Engineer Salary in India
View more details
Business Analyst
113 salaries
unlock blur

₹2.3 L/yr - ₹9 L/yr

Associate Business Analyst
97 salaries
unlock blur

₹2 L/yr - ₹4.8 L/yr

Associate Test Engineer
50 salaries
unlock blur

₹1.8 L/yr - ₹5.5 L/yr

Software Engineer
37 salaries
unlock blur

₹3.6 L/yr - ₹14 L/yr

Associate Software Engineer
37 salaries
unlock blur

₹3 L/yr - ₹6 L/yr

Explore more salaries
Compare TSS Consultancy with

MagicBricks

4.4
Compare

State Street Syntel

3.7
Compare

Sterling & Wilson

4.1
Compare

AXA Business Services

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