AVIN Systems Senior Engineer Interview Questions and Answers

Medium DSA questions

Q1. String subsequence based question
Add your answer
Q2. Only one question
Add your answer

2 dsa questions of easy/medium

Q1. Asked two dsa questions of leetcodeeasy/medium
Add your answer

Q1. Asked two dsa questions of leetcode easy/medium
Add your answer

Q1. Asked one dsa question on tree and discussion on resume and dbms os
Add your answer

Q1. Salary Discussion
Add your answer

Q1. Techical questions and coding questions related profile.
Add your answer
Q2. Basic concepts about your programming skills.
Add your answer

Q1. Delete nth node from end in linked list
Ans. 
To delete the nth node from the end in a linked list, we can use a two-pointer approach.
• Use two pointers, one to traverse the list and another to keep track of the nth node from the end.

• Move the second pointer n steps ahead of the first pointer.

• When the second pointer reaches the end of the list, the first pointer will be at the nth node from the end.

• Adjust the pointers to delete the nth node.
Answered by AI
Add your answer
Q2. Project discussion
Add your answer

Easy to medium, can solve with leetcode medium

Q1. Number of islands count
Ans. 
Count the number of islands in a grid of '1's and '0's
• Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited

• Increment the island count for each new island found

• Ensure to handle boundary cases and check for visited nodes
Answered by AI
Add your answer
Q2. First and last index of a particular element in an array
Ans. 
Find the first and last index of a specific element in an array of strings.
• Iterate through the array and keep track of the index of the first and last occurrence of the element.

• Return the first and last index once the iteration is complete.

• Example: Array ['apple', 'banana', 'apple', 'orange'], element 'apple' - First index: 0, Last index: 2.
Answered by AI
Add your answer

Q1. React, React Native Basics
Add your answer
Q2. Coding Arrays & Objects
Add your answer

Hard questions of graph and dp.

It was good and tough