NICE Associate Software Engineer Interview Questions and Answers

Easy 1 dsa and 35 mcqs

Q1. All oops concepts in detail
Ans. 
Object-oriented programming concepts like inheritance, encapsulation, polymorphism, and abstraction.
• Inheritance: Allows a class to inherit properties and behavior from another class.

• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Polymorphism: Ability to present the same interface for different data types.

• Abstraction: Hiding the complex implementation details and showing only the ne
Answered by AI
Add your answer
Q2. Linked list implementation and some questions
Add your answer

20 Mcqs and 2 coding questions

Q1. Sort zeroes to end of array
Ans. 
Sort zeroes to end of array
• Iterate through the array and move all zeroes to the end

• Use two pointers approach to swap elements

• Maintain a count of zeroes encountered
Answered by AI
Add your answer
Q2. Questions on oops
Add your answer

2 questions Based on arrays level of medium

Q1. 2 questions based on array and linked list
Add your answer

Q1. Question based on metrix
Add your answer

Q1. Behavioural questions
Add your answer

It was c++ coding test

Q1. Coding questions
Add your answer

Q1. Network related questions
Add your answer

Q1. About myself and other details
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Timing - flexible 12 hours window to take the test. (9AM - 9PM)
Test was proctored

Q1. 
Combination Sum Problem Statement
Given three integers X, Y, and Z, calculate the sum of all numbers that can be formed using the digits 3, 4, and 5. Each digit can be used up to a maximum of X, Y, and Z ...read more
Add your answer
Q2. 
Longest Path In Directed Graph Problem Statement
Given a Weighted Directed Acyclic Graph (DAG) comprising 'N' nodes and 'E' directed edges, where nodes are numbered from 0 to N-1, and a source node 'Src'....read more
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Timing - 9:00 AM - 9:40 AM

Q1. 
Factorial Trailing Zeros Problem
You are provided with a positive integer N. Your goal is to determine the smallest number whose factorial has at least N trailing zeros.
Example:
Input:
N = 1
Output:
...read more
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, your task is to return the head of the reversed linked list.
Example:
Input:
The given linked list is 1 -> 2 -> 3 -&g...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Timing - 12:00 Pm to 12:40 PM

Q1. 
Implementing a Priority Queue Using Heap
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...read more
Add your answer
Q2. 
Largest BST Subtree Problem
Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree).
Input:
The first line contains an integer 'T', represen...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Timing - 6:00 PM - 6:30 PM

Q1. Can you design a system similar to Splitwise and identify three features that you would change or improve?
Add your answer

First round was online assessment consisting of aptitude and coding questions.

Q1. First round consisted of coding 3 questions. String reversal , binary to decimal, finding index of word "golden" in given sentence.
Add your answer

Q1. It involved questions related to my resume and computer networks and basics of c++.
Add your answer