HashedIn by Deloitte
10+ NSE.IT Interview Questions and Answers
Q1. Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or two step...read more
Q2. Check if Two Trees are Mirror
Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
Explanation:
Two trees are considered mirror of each other if:
- The r...read more
Q3. Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make the c...read more
Q4. Increase Number By 1 Problem Statement
Given an array of integers NUM that consists of N elements, where the array represents the digits of a number, your task is to add 1 to this number. The number is positive...read more
Q5. Tic-Tac-Toe Design Problem
Design a 2-player Tic-Tac-Toe game played on an N * N grid where Player 1 uses ‘X’ and Player 2 uses ‘O’. A move is always valid and occupies an empty spot.
If a player places N of th...read more
Q6. Excel Column Number Conversion
Given a column title as it appears in an Excel sheet, your task is to return its corresponding column number.
Example:
Input:
S = "AB"
Output:
28
Explanation:
The sequence is as f...read more
Q7. Q1 - Pre order traversal without recursion. Q2 - Reverse a linked list.
Q1 - Pre order traversal without recursion. Q2 - Reverse a linked list.
Q1: Use a stack to keep track of nodes. Start with root, push it to stack. Pop top node, print it, push right and left children to stack.
Q2: Traverse the linked list and change the direction of the pointers. Set the head of the reversed list as the last node of the original list.
Q8. Q1 - Sort the string according to frequency of characters
Sort a string based on the frequency of its characters.
Create a hash table to store the frequency of each character.
Sort the characters based on their frequency using a sorting algorithm.
Reconstruct the string based on the sorted characters and their frequency.
Q9. What is sharding and how it can be implemented.
Sharding is a database partitioning technique to improve performance and scalability.
It involves dividing a large database into smaller, more manageable parts called shards.
Each shard contains a subset of the data and can be stored on a separate server.
Sharding can be implemented using different strategies such as range-based, hash-based, or round-robin.
It requires careful planning and coordination to ensure data consistency and availability.
Examples of sharding in popular da...read more
Q10. What are assymptotic notation
Asymptotic notation is a way to describe the performance of an algorithm in terms of its input size.
Asymptotic notation is used to analyze the efficiency of algorithms by focusing on how they behave as the input size approaches infinity.
Common notations include O (Big O), Ω (Big Omega), and Θ (Big Theta), which represent the worst-case, best-case, and average-case time complexity respectively.
For example, if an algorithm has a time complexity of O(n^2), it means that the algo...read more
Q11. System design of parking
Design a system for parking management
Use sensors to detect available parking spots
Implement a payment system for parking fees
Include a mobile app for users to find and reserve parking spots
Utilize cameras for security monitoring
Integrate with navigation apps for real-time parking availability updates
Q12. Project done in past
Developed a web application for tracking inventory and sales data
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express
Utilized MongoDB for database management
Interview Process at NSE.IT
Top Software Engineer Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
