NexTurn Security Engineer Interview Questions and Answers

Aptitude test was esay.i passed that

We have upload a vedio based on given topic

Q1. 1 coding questiin 3 logical apti question Dbms concepts
Add your answer
Q2. Foriegn key Primary key
Add your answer

General and basic data structure question

Q1. Coding over the video call
Add your answer
Q2. Java programs for strings , palindrome etc
Ans. 
Java programs for strings, palindrome, etc.
• Use the StringBuilder class to manipulate strings efficiently.

• To check if a string is a palindrome, compare it with its reverse.

• To count the occurrences of a substring in a string, use the indexOf method in a loop.

• To split a string into an array of substrings, use the split method.
Answered by AI
Add your answer
Q3. Projects questions on which you have worked
Add your answer
Q4. Explanation skill will also be considered
Add your answer

Python slq apti path json sksa

Q1. Problem solving in python
Add your answer
Q2. Solving problems in oython
Add your answer

Dp, trees and basic time complexity

Q1. Tell me about your self
Ans. 
I am a software engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
• 5 years of experience in software development

• Proficient in Java, Spring, and Angular

• Strong problem-solving skills

• Experience working in Agile development environment
Answered by AI
Add your answer
Q2. Projects and intership
Add your answer

Questions based or percentage, profit loss, ratio

Q1. Explain about stacks
Ans. 
Stacks are a data structure that follows the Last In First Out (LIFO) principle.
• Elements are added and removed from the top of the stack

• Common operations include push (add element) and pop (remove element)

• Stacks can be implemented using arrays or linked lists

• Examples of stack usage include function call stack and undo/redo functionality in text editors
Answered by AI
Add your answer
Q2. To find middle number in the linked list
Ans. 
To find the middle number in a linked list.
• Traverse the linked list using two pointers, one moving twice as fast as the other.

• When the fast pointer reaches the end, the slow pointer will be at the middle node.

• If the linked list has even number of nodes, there will be two middle nodes. Return either one.
Answered by AI
Add your answer

Q1. Introduction , hobbies, goals
Add your answer
Q2. Strength, weakness, short term and long term goals
Add your answer

Apptitude test is a mathematical reasoning in apptitude test there are many reasonings

It is based on programming on coding test.

Dsa problems dp and tress problem

Q1. Tell me about your self
Ans. 
I am a passionate software engineer with 5 years of experience in developing web applications using various technologies.
• 5 years of experience in software development

• Proficient in developing web applications

• Skilled in using various technologies

• Passionate about software engineering
Answered by AI
Add your answer
Q2. Projects and intership
Add your answer

The test was in hackerrank platform, it was moderate level.