Melorra Software Engineer Interview Questions and Answers for Experienced

Q1. Design Questions to build a scalable micro service
Add your answer
Q2. Salary Discussion
Add your answer

It was a 1 hour Technical screening round, coding question in java (you cna choose your own language). They asked a difficult version of regex matching question (Leetcode medium-hard).

Q1. General questions to understand about you
Add your answer

Had to build a mini web application in html css and angular given some requirements.

Q1. Questions regarding assessment
Add your answer

Q1. Html Css Basics
Add your answer

Palindrome and Pattern drawing question

Q1. Data Structure and Projects
Add your answer

Q1. Expectation of Salary
Add your answer

Q1. 2 DSA leetcode (1 medium , 1 hard)
Add your answer

Q1. Same round 1 2 DSA leetcode questions (1 hard , 1 medium)
Add your answer

Q1. It was the hiring manager round, it started with the LRU cache algorithm and went deep in the system design
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

C program, aptitude and english grammar test

Q1. C related topics
Add your answer

Q1. Related project and microcontroller
Add your answer

Q1. Personal information
Add your answer