National Institute for Smart Government Vpn Engineer Interview Questions and Answers for Experienced

Q1. Longest Increasing Subsequence
Ans. 
Find the length of the longest increasing subsequence in an array.
• Use dynamic programming to solve this problem efficiently.

• Iterate through the array and keep track of the longest increasing subsequence ending at each index.

• Example: For array [10, 22, 9, 33, 21, 50, 41, 60, 80], the longest increasing subsequence is [10, 22, 33, 50, 60, 80] with length 6.
Answered by AI
Add your answer

Q1. UseEffect polyfill
Add your answer

Q1. .net questions, web api
Add your answer

Q1. Covering all Angular and front end concepts
Add your answer

Q1. Angular Concepts and live coding
Add your answer

Q1. Javascript concepts in-depth
Add your answer

Mix of coding, aptitude, java, javascript

Q1. Resume based questions on project
Add your answer
Q2. Basic SQL, Java streams questions
Add your answer

Q1. Project related questions
Add your answer
Q2. Internal working of hashmap
Ans. 
HashMap is a data structure that stores key-value pairs and uses hashing to quickly retrieve values based on keys.
• HashMap internally uses an array of linked lists to store key-value pairs.

• When a key-value pair is added, the key is hashed to determine the index in the array where the pair will be stored.

• If multiple keys hash to the same index, a collision occurs and the pairs are stored in a linked list at that index.

• To...read more
Answered by AI
Add your answer
Q3. Design patterns I've used
Ans. 
I have used design patterns such as Singleton, Factory, and Observer in my projects.
• Singleton pattern ensures a class has only one instance and provides a global point of access to it.

• Factory pattern creates objects without specifying the exact class of object that will be created.

• Observer pattern defines a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and
Answered by AI
Add your answer
Q4. Print whole Fibonacci series using recursion.
Ans. 
Print Fibonacci series using recursion
• Define a recursive function to calculate Fibonacci numbers

• Base case: return 0 if n is 0, return 1 if n is 1

• Recursive case: return sum of previous two Fibonacci numbers

• Print each Fibonacci number in the series
Answered by AI
Add your answer
Q5. Show my Github projects, and the interviewer didn't even properly looked into the code.
Add your answer

Revit tool test and questions related to BIM

Q1. Lighting design
Add your answer
Q2. Generator size and transformer size
Ans. 
Generator size and transformer size are determined based on the power requirements and load characteristics of the system.
• Generator size is determined by the power requirements of the system, taking into account factors such as peak load, average load, and efficiency.

• Transformer size is determined by the voltage and current requirements of the system, as well as the power factor and impedance of the load.

• It is importan...read more
Answered by AI
Add your answer

Q1. HVAC, FLS & Experience
Add your answer

Q1. Software Proficiency Test
Add your answer

Hacker Rank test with medium difficulty

Q1. Technical discussion mainly around system design, different architectures, problem solving and coding question may be asked.
Add your answer

A case study for a problem statement

Q1. The interviewer himself don't know anything He will ask only waste questions He only asked unnecessary questions
Add your answer
Q2. Little about python coding little about project details
Add your answer