i
NEC
Work with us
Filter interviews by
Coding round easy level ques and some of them is mcq
Top trending discussions
posted on 16 Sep 2021
posted on 2 Sep 2022
I applied via Naukri.com and was interviewed in Aug 2022. There was 1 interview round.
To check if a linked list is circular or linear, we need to traverse the list and check if it loops back to a previous node.
Traverse the linked list using two pointers, one moving one node at a time and the other moving two nodes at a time.
If the faster pointer catches up to the slower pointer, then the list is circular.
If the faster pointer reaches the end of the list without catching up to the slower pointer, then th...
Count the number of set bits in a given number.
Use bitwise AND operator with 1 to check if the rightmost bit is set.
Shift the number to right by 1 bit and repeat the process until the number becomes 0.
Keep a count of the number of set bits encountered.
Example: For number 5 (101 in binary), the answer is 2 as there are 2 set bits.
Example: For number 15 (1111 in binary), the answer is 4 as there are 4 set bits.
Segmentation fault is a type of error caused by accessing memory that “does not belong to you.”
It occurs when a program tries to access a memory location that it is not allowed to access.
It is often caused by programming errors such as accessing an array beyond its bounds.
It can also be caused by hardware problems such as faulty RAM or overheating.
Segmentation faults can be difficult to debug because they often occur i...
posted on 11 Apr 2023
Counting characters using streams in Java
Use the chars() method to convert the string to an IntStream of characters
Use the count() method to count the number of characters in the stream
I applied via Campus Placement and was interviewed in Dec 2020. There were 5 interview rounds.
Program to print a pattern and implement bubble sort on an array of strings.
For pattern printing, use nested loops to print the desired pattern.
For bubble sort, compare adjacent elements and swap if necessary.
Use a loop to iterate through the array until no more swaps are needed.
I applied via Campus Placement and was interviewed in Aug 2021. There were 2 interview rounds.
Mathematic
My strengths include problem-solving, attention to detail, and teamwork. My weaknesses include time management and public speaking.
Strengths: problem-solving, attention to detail, teamwork
Weaknesses: time management, public speaking
I am a software developer with experience in various programming languages and a passion for creating innovative solutions.
Experienced in Java, C++, and Python
Developed a mobile app using React Native
Worked on a team to build a web application using AngularJS
Strong problem-solving and analytical skills
I applied via Campus Placement and was interviewed before Nov 2020. There were 4 interview rounds.
NTT is a global technology services company that provides IT solutions and services to clients worldwide.
NTT offers a wide range of services including cloud computing, cybersecurity, data analytics, and IoT solutions.
The company operates in over 80 countries and has over 300,000 employees.
NTT is also involved in research and development in areas such as artificial intelligence and quantum computing.
Some of NTT's client...
Computer networking is the practice of connecting devices together to share resources and communicate with each other.
Computer networking involves the use of hardware and software to connect devices together, such as computers, printers, and servers.
Networking protocols, such as TCP/IP, are used to facilitate communication between devices.
Examples of computer networks include local area networks (LANs), wide area netwo...
I appeared for an interview before Oct 2020.
Round duration - 30 Minutes
Round difficulty - Medium
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 tw...
The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
Use dynamic programming to solve the problem efficiently.
The number of ways to reach the Nth stair is equal to the sum of ways to reach (N-1)th stair and (N-2)th stair.
Handle base cases for N=0 and N=1 separately.
Consider using modulo operation to avoid overflow for large values of N.
Round duration - 15 Minutes
Round difficulty - Easy
Tip 1 : learn oops concept on tips
Tip 2 : try to do fixing questions in any language
Tip 3 : try to practice for aptitude very well practice 50-100 questions daily
Tip 1 : must have 2 projects
Tip 2 : only write those things in your resume you are sure about them and have a very great knowledge about them
Member Technical Staff
279
salaries
| ₹3.8 L/yr - ₹8.5 L/yr |
Technical Lead
264
salaries
| ₹17 L/yr - ₹30.3 L/yr |
Senior Member of Technical Staff
247
salaries
| ₹4.6 L/yr - ₹18 L/yr |
Senior Software Engineer
168
salaries
| ₹11.6 L/yr - ₹22.9 L/yr |
Senior Technical Lead
159
salaries
| ₹19 L/yr - ₹33 L/yr |
Cognizant
DXC Technology
UST
Atos