Upload Button Icon Add office photos
Engaged Employer

i

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

nCircle Tech Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

nCircle Tech Senior Software Developer Interview Questions and Answers

Updated 3 Apr 2025

nCircle Tech Senior Software Developer Interview Experiences

2 interviews found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Standard questions that you find on hackerrank

Round 2 - Technical 

(1 Question)

  • Q1. Questions about project in college. Geometry. C++
Round 3 - Technical 

(1 Question)

  • Q1. Question about project in college. Geometry. C++ - Oops, pointers Puzzle - cube cutting
Round 4 - HR 

(2 Questions)

  • Q1. Tell me about yourself. Hobbies.
  • Q2. How would you plan a hackathon event in company
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I appeared for an interview before Apr 2024, where I was asked the following questions.

  • Q1. Virtual Functions, Linked List Problems, OOPs
  • Q2. C++ Basic Questions

Senior Software Developer Interview Questions Asked at Other Companies

asked in Freshworks
Q1. Intersection of Linked List Problem You are provided with two sin ... read more
asked in Freshworks
Q2. Overlapping Intervals Problem Statement You are given the start a ... read more
asked in Freshworks
Q3. Middle of Linked List Problem Statement Given the head node of a ... read more
asked in SAP
Q4. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Freshworks
Q5. Cube Sum Pairs Problem Statement Given a positive integer N, find ... read more

Top trending discussions

View All
Interview Tips & Stories
2w
toobluntforu
·
works at
Cvent
Can speak English, can’t deliver in interviews
I feel like I can't speak fluently during interviews. I do know english well and use it daily to communicate, but the moment I'm in an interview, I just get stuck. since it's not my first language, I struggle to express what I actually feel. I know the answer in my head, but I just can’t deliver it properly at that moment. Please guide me
Got a question about nCircle Tech?
Ask anonymously on communities.

Interview questions from similar companies

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

Interview Questionnaire 

4 Questions

  • Q1. Database related questions
  • Q2. Api
  • Q3. Two basic coding questions
  • Q4. Some apti based questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Just try to attempt all the sample questions available in geeks for geeks

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

Round 1 - Aptitude Test 

Aptitude test

Round 2 - Group Discussion 

Current affairs

Round 3 - Technical 

(1 Question)

  • Q1. Puzzle , sql related questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be yourself, whatever you know just be confident

I applied via Referral and was interviewed in Nov 2020. There were 4 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Basic programming concepts, OOPs & logical questions
  • Q2. Particular technology related and basic array programming

Interview Preparation Tips

Interview preparation tips for other job seekers - interview process was very smooth
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

I applied via Job Portal

Round 1 - Coding Test 

60mintues DSA level coding exam

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

I applied via Walk-in and was interviewed before Feb 2023. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. React js, ReactHooks, es67 features, bootstrap
Are these interview questions helpful?

I appeared for an interview in Sep 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

Students who qualified in first round gets link for this round, this round had 4 questions in total, out of which 1 was output based and 3 was DSA based.

  • Q1. 

    Validate Binary Tree Nodes Problem

    You are provided with 'N' binary tree nodes labeled from 0 to N-1, where node i has two potential children, recorded in the LEFT_CHILD[i] and RIGHT_CHILD[i] arrays. Dete...

  • Ans. 

    The task is to determine if the given binary tree nodes form exactly one valid binary tree.

    • Check if there is only one root node (a node with no parent)

    • Check if each node has at most one parent

    • Check if there are no cycles in the tree

    • Check if all nodes are connected and form a single tree

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 75 minutes
Round difficulty - Medium

This round was of 70-75 minutes and had 3 coding questions of easy to medium level. There was some restrictions like we cannot use built-in functions in both second and third subjective round.

  • Q1. 

    Balanced Binary Trees Problem Statement

    You are provided with an integer 'H'. Your task is to determine and print the maximum number of balanced binary trees possible with height 'H'.

    A balanced binary t...

  • Ans. 

    The maximum number of balanced binary trees possible with a given height is to be counted and printed.

    • A balanced binary tree is one in which the difference between the left and right subtree heights is less than or equal to 1.

    • The number of balanced binary trees can be calculated using dynamic programming.

    • The number of balanced binary trees with height 'H' can be obtained by summing the product of the number of balanced...

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was face to face interview round of 60 minutes. It was mostly based on DSA, some questions was also asked related to my projects and DBMS. Interviewer was kind and good.

  • Q1. 

    Wave Array Sorting Problem

    Your goal is to sort a given unsorted array ARR such that it forms a wave array.

    Explanation:

    After sorting, the array should satisfy the wave pattern conditions:

    • ARR[0] &...
  • Ans. 

    The task is to sort an array in a wave form, where each element is greater than or equal to its adjacent elements.

    • Iterate through the array and swap adjacent elements if they do not follow the wave pattern

    • Start from the second element and compare it with the previous element, swap if necessary

    • Continue this process until the end of the array

    • Repeat the process for the remaining elements

    • Return the sorted wave array

  • Answered by AI
  • Q2. 

    Maximum Sum BST Problem Statement

    You are presented with a Binary Tree 'root', which may not necessarily be a Binary Search Tree (BST). Your objective is to identify the maximum sum of node values in any ...

  • Ans. 

    The task is to find the maximum sum of node values of any subtree that is a Binary Search Tree(BST).

    • Traverse the binary tree in a bottom-up manner

    • For each node, check if it forms a BST and calculate the sum of its subtree

    • Keep track of the maximum sum encountered so far

    • Return the maximum sum

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 135 minutes
Round difficulty - Hard

This was the final technical round, it was around 2.5 hours long and based on mostly DSA and little bit Projects, DBMS, OS. Josh mainly focus on DSA and on Tree Data Structure in interview.

  • Q1. 

    Pair Sum in BST Problem Statement

    Given a Binary Search Tree (BST) and a target value K, determine if there exist two unique elements in the BST such that their sum equals K.

    Input:

    An integer T, the nu...
  • Ans. 

    The task is to check if there exist two unique elements in the given BST such that their sum is equal to the given target 'K'.

    • Traverse the BST in-order and store the elements in a sorted array

    • Use two pointers, one at the beginning and one at the end of the array

    • Check if the sum of the elements at the two pointers is equal to the target 'K'

    • If the sum is less than 'K', move the left pointer to the right

    • If the sum is grea...

  • Answered by AI
  • Q2. 

    Find Nodes at Distance K in a Binary Tree

    Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...

  • Ans. 

    The task is to find all nodes in a binary tree that are at a distance K from a given node.

    • Implement a function that takes the binary tree, target node, and distance K as input.

    • Use a depth-first search (DFS) algorithm to traverse the tree and find the nodes at distance K.

    • Keep track of the distance from the current node to the target node while traversing.

    • When the distance equals K, add the current node to the result lis...

  • Answered by AI
Round 5 - HR 

Round duration - 20 minutes
Round difficulty - Easy

This was the simple 20 minutes round

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Raj Kumar Goel Institute Of Technology. Eligibility criteriaNo criteriaJosh Technology Group interview preparation:Topics to prepare for the interview - Linked list, Tree, Graph, Dynamic Programming, Recursion, BacktrackingTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Try to solve some good questions from every topic.
Tip 2 : If not have much time, then you can solve top interview questions from Leetcode.
Tip 3 : Made 2-3 good projects using any technology

Application resume tips for other job seekers

Tip 1 : Keep resume short and crispy.
Tip 2 : Add coding profile handles and github link.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Sep 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 180 min
Round difficulty - Hard

  • Q1. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The problem involves finding the length of the longest common subsequence between two given strings.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the lengths of common subsequences of substrings.

    • Iterate through the strings to fill the array and find the length of the longest common subsequence.

    • Example: For input STR1 = 'abcde' and STR2 = 'ace', the longest common subsequence is 'ac...

  • Answered by AI
  • Q2. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
  • Q3. 

    K Largest Elements Problem Statement

    You are given an unsorted array containing 'N' integers. Your task is to find the 'K' largest elements from this array and return them in non-decreasing order.

    Input:

    T...
  • Ans. 

    Yes, the problem can be solved in less than O(N*log(N)) time complexity using the Quick Select algorithm.

    • Implement Quick Select algorithm to find the Kth largest element in O(N) time complexity.

    • Partition the array around a pivot element and recursively search in the left or right partition based on the position of the pivot.

    • Once you find the Kth largest element, return all elements greater than or equal to it in non-de...

  • Answered by AI
Round 2 - Coding Test 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Size of Largest BST in a Binary Tree

    Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a Binary Search Tree (BST).

    Explanation:

    A Binary Search Tree (BST) is def...

  • Ans. 

    Find the size of the largest BST subtree in a binary tree.

    • Traverse the tree in a bottom-up manner to check if each subtree is a BST.

    • Keep track of the size of the largest BST found so far.

    • Recursively check if the current subtree is a BST and update the size accordingly.

  • Answered by AI
  • Q2. 

    Matrix Chain Multiplication Problem

    Given 'N' 2-dimensional matrices and an array ARR of length N + 1, where the first N integers denote the number of rows in each matrix and the last integer represents t...

  • Ans. 

    Find the minimum number of multiplication operations required to multiply a series of matrices together.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the minimum number of operations needed to multiply matrices.

    • Iterate through different combinations of matrices to find the optimal solution.

    • Consider the dimensions of the matrices to determine the number of operations required.

    • Calcu...

  • Answered by AI
  • Q3. 

    Rotate Linked List Problem Statement

    Given a linked list consisting of 'N' nodes and an integer 'K', your task is to rotate the linked list by 'K' positions in a clockwise direction.

    Example:

    Input:
    Li...
  • Ans. 

    Rotate a linked list by K positions in a clockwise direction.

    • Traverse the linked list to find the length and the last node.

    • Connect the last node to the head to form a circular linked list.

    • Find the new head by moving (length - K) steps from the last node.

    • Break the circular list at the new head to get the rotated linked list.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

  • Q1. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...

  • Ans. 

    Given a string, find the longest palindromic substring within it.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found so far

    • Return the longest palindromic substring

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteria7 CGPAJosh Technology Group interview preparation:Topics to prepare for the interview - DSA, OOPS, OS, CN, DBMS, atleast one languageTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : be thoroughly prepared with dsa
Tip 2 : focus on dbms.
Tip 3 : be prepared with skills mentioned in resume

Application resume tips for other job seekers

Tip 1 : mention some good projects
Tip 2 : don't put false statement

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

It was an 1 hour round with pseudocodes of c different subject questions and it was an objective test

Round 2 - Coding Test 

It was difficult with question of medium to hard level

Interview Preparation Tips

Interview preparation tips for other job seekers - be prepared well

nCircle Tech Interview FAQs

How many rounds are there in nCircle Tech Senior Software Developer interview?
nCircle Tech interview process usually has 4 rounds. The most common rounds in the nCircle Tech interview process are Technical, HR and Coding Test.
How to prepare for nCircle Tech Senior Software 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 nCircle Tech. The most common topics and skills that interviewers at nCircle Tech expect are Javascript, Software Development, Angular, Angularjs and Design Patterns.
What are the top questions asked in nCircle Tech Senior Software Developer interview?

Some of the top questions asked at the nCircle Tech Senior Software Developer interview -

  1. Virtual Functions, Linked List Problems, O...read more
  2. C++ Basic Questi...read more

Tell us how to improve this page.

Overall Interview Experience Rating

5/5

based on 2 interview experiences

Difficulty level

Moderate 100%

Duration

Less than 2 weeks 100%
View more

Interview Questions from Similar Companies

QualiZeal Interview Questions
4.3
 • 59 Interviews
Affine Interview Questions
3.3
 • 51 Interviews
Cyfuture Interview Questions
3.0
 • 46 Interviews
View all
nCircle Tech Senior Software Developer Salary
based on 56 salaries
₹5.1 L/yr - ₹17 L/yr
18% less than the average Senior Software Developer Salary in India
View more details

nCircle Tech Senior Software Developer Reviews and Ratings

based on 5 reviews

4.0/5

Rating in categories

4.3

Skill development

4.5

Work-life balance

3.7

Salary

4.7

Job security

4.7

Company culture

3.0

Promotions

4.5

Work satisfaction

Explore 5 Reviews and Ratings
Software Developer
79 salaries
unlock blur

₹4 L/yr - ₹15.6 L/yr

Senior Software Developer
56 salaries
unlock blur

₹5.1 L/yr - ₹17 L/yr

Member Technical Staff
39 salaries
unlock blur

₹3 L/yr - ₹7 L/yr

BIM Engineer
21 salaries
unlock blur

₹4.1 L/yr - ₹7.5 L/yr

BIM Modeller
19 salaries
unlock blur

₹3 L/yr - ₹6.5 L/yr

Explore more salaries
Compare nCircle Tech with

Cyfuture

3.0
Compare

Maxgen Technologies

4.6
Compare

JoulestoWatts Business Solutions

3.1
Compare

Value Point Systems

3.6
Compare
write
Share an Interview