Upload Button Icon Add office photos
Engaged Employer

i

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

Suma Soft Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Suma Soft Assistant Manager Interview Questions and Answers

Updated 13 Apr 2022

Suma Soft Assistant Manager Interview Experiences

1 interview found

I applied via Referral and was interviewed before Apr 2021. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. Explain overall Experience & responsibilities

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident & explain all the tasks you did before & suggest new ideas to improve your skills in future

Interview questions from similar companies

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

I applied via Approached by Company and was interviewed in Aug 2023. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Explained below
  • Q2. As given below with

Interview Preparation Tips

Interview preparation tips for other job seekers - I recently had joined for the position of Assistant Manager Finance with Incedo India.
I felt truly blessed to have had the opportunity to engage with such knowledgeable and experienced professionals during the interview. The questions were thoughtfully crafted, focusing on fundamental concepts in finance, as well as my relevant experience from previous roles.
The interviewers demonstrated a deep understanding of the core areas of finance, creating a conducive environment for discussing both theoretical concepts and practical applications.
My overall experience with Incedo India's interview process was highly positive. It not only allowed me to showcase my skills and experiences but also provided insights into the company's commitment to excellence in the finance domain.

Tip: Believe yourself and your knowledge.


Thank You Incedo India

I appeared for an interview in Sep 2017.

Interview Questionnaire 

4 Questions

  • Q1. Technical interview take by client technical person actually they are hiring for another client so they took total 3 technical round and final will HR round
  • Q2. Asking about life cycle of Dot net mvc contols entity frame work and SQL queries
  • Q3. Problem based on oops and SQL queries outputs
  • Q4. Basic questions about my self ,salary discussion basic formalities form I have to fill up

Interview Preparation Tips

Round: Test
Experience: There were around 15 objective question that includes mvc, c#.net and SQL server. It was very simple question like different types of filters,Acton results in mvc. Basic oops concept and dot net web page regarding

Round: Resume Shortlist
Experience: After completing test round another was technical round discussed maily for mvc and SQL server questions. Around 30 mint discussion. After qualify this round another round will start from client technical staff.

General Tips: It was for 2-3 year experience person very simple to crack but focus on you which profile you are looking for study interview questions from net
Skills: Dot net mve oops concept jQuery and SQL server

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

I applied via Naukri.com and was interviewed before May 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 - One-on-one 

(1 Question)

  • Q1. Tell me about yourself

Interview Preparation Tips

Interview preparation tips for other job seekers - Tell me about yourself and be thorough with the Job Description

Interview Questionnaire 

2 Questions

  • Q1. Basics from all framework you have worked on.
  • Q2. There working all are non technical people's they don't know the projects here major people working in testing and non related work

I applied via Walk-in and was interviewed before Jul 2021. There were 3 interview rounds.

Round 1 - Coding Test 

Data structures and algorithms

Round 2 - Coding Test 

Python etl,pandas, pyspark questions

Round 3 - HR 

(1 Question)

  • Q1. Salary negotiation , work culture

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong with the basics and practice common programming problems

I applied via Naukri.com and was interviewed before Mar 2020. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Difference between Hashtable and hashmap?
  • Ans. 

    Hashtable is synchronized while hashmap is not.

    • Hashtable is thread-safe while hashmap is not.

    • Hashtable does not allow null keys or values while hashmap allows one null key and multiple null values.

    • Hashtable is slower than hashmap due to synchronization.

    • Hashtable is a legacy class while hashmap is a newer implementation.

  • Answered by AI
  • Q2. Difference between hashmap and concurrent hashmap?
  • Ans. 

    Hashmap is not thread-safe while Concurrent Hashmap is thread-safe.

    • Hashmap is not suitable for multi-threaded environments as it can lead to race conditions and data inconsistencies.

    • Concurrent Hashmap allows multiple threads to access and modify the map concurrently without any data inconsistencies.

    • Concurrent Hashmap uses a technique called lock striping to achieve thread-safety.

    • Concurrent Hashmap is slower than Hashma...

  • Answered by AI
  • Q3. Jdbc step
  • Q4. Spring ioc

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview was average they asked questions from core java spring hibernate... And so on..

Skills evaluated in this interview

I applied via first naukari and was interviewed before Oct 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. A graph is stored in sql database. Questions was to find the shorted path between point A and B.

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview was quite simple. Basics of python and database were asked and some problem solving questions.

I applied via Naukri.com and was interviewed before May 2018. There were 5 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Telephonic technical
  • Q2. Core Java related exception handling ,design pattern ,oops solid design principle, rest API, different annotations of spring and jpa
  • Q3. Same questions on telephonic round but detailed elaborate and given simple problem statement we had to justify that why it's time n space complexity valid. Rest API questions hibernate orm use
  • Q4. Manager round just to check whether you have actually worked on project or not stress testing performance questions scenario questions

Interview Preparation Tips

General Tips: Quite easy just go with preparation
Skills: Core Java sevlet JSP hibernate spring rest API, Communication, Body Language, Problem Solving, Analytical Skills, Decision Making Skills
Duration: 1-4 weeks

Suma Soft Interview FAQs

How many rounds are there in Suma Soft Assistant Manager interview?
Suma Soft interview process usually has 1 rounds. The most common rounds in the Suma Soft interview process are One-on-one Round.
How to prepare for Suma Soft Assistant Manager 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 Suma Soft. The most common topics and skills that interviewers at Suma Soft expect are Domestic BPO, Domestic Sales, Home Loans, Insurance and Medical Billing.

Tell us how to improve this page.

Suma Soft Assistant Manager Salary
based on 24 salaries
₹4 L/yr - ₹7.2 L/yr
36% less than the average Assistant Manager Salary in India
View more details

Suma Soft Assistant Manager Reviews and Ratings

based on 3 reviews

2.7/5

Rating in categories

2.3

Skill development

2.6

Work-life balance

3.0

Salary

3.4

Job security

2.3

Company culture

2.3

Promotions

2.3

Work satisfaction

Explore 3 Reviews and Ratings
Back Office Executive
228 salaries
unlock blur

₹0.9 L/yr - ₹3 L/yr

Software Engineer
148 salaries
unlock blur

₹2 L/yr - ₹9 L/yr

Customer Care Executive
93 salaries
unlock blur

₹1 L/yr - ₹3.2 L/yr

Software Developer
88 salaries
unlock blur

₹2 L/yr - ₹8.6 L/yr

Sales Executive
71 salaries
unlock blur

₹1.4 L/yr - ₹3.6 L/yr

Explore more salaries
Compare Suma Soft 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