Novopay Solutions Software Development Engineer 1 Interview Questions and Answers

MCQ Type - Basic Javascript and SQL questions
Platform - doSelect

Q1. NodeJS Event Loop
Add your answer
Q2. Coding Problem - Prime Number
Add your answer

Q1. SQL DB Indexing
Add your answer

Q1. Basic Company Fit Questions
Add your answer

Q1. Question around priority queue
Add your answer
Q2. Decode strings leetcode
Add your answer

Q1. System design questions scenario based
Add your answer

Q1. Questions on multidimensional tree
Add your answer

2 Leetcode Medium questions on hackerrank

Q1. Kadane algorithm based question
Add your answer
Q2. Leetcode medium
Add your answer
Q3. Resume based questions
Add your answer

Q1. Probability question math problem
Add your answer
Q2. Puzzle to solve
Add your answer
Q3. AI based question
Add your answer
Q4. 1 question to solve Leetcode medium
Add your answer

2 DSA questions Both are from DP

Q1. 2 Questions , 1 is DSA
Add your answer
Q2. Second question is Puzzle
Add your answer

Q1. Left view of BST
Ans. 
Left view of BST is the nodes visible when viewing the tree from the left side.
• The left view of a BST includes the leftmost node at each level.

• Use level order traversal to find the left view nodes.

• Example: For BST with nodes 1, 2, 3, 4, 5, the left view is 1, 2.
Answered by AI
Add your answer

Q1. Detect loop in a Linked List
Ans. 
Use Floyd's Tortoise and Hare algorithm to detect loop in a Linked List.
• Initialize two pointers, slow and fast, at the head of the Linked List.

• Move slow pointer by one step and fast pointer by two steps.

• If they meet at any point, there is a loop in the Linked List.
Answered by AI
Add your answer
Q2. Second largest salary from employee table
Add your answer

60 Minutes coding test was there

Q1. Worst experience ever, never apply for company in this, highly unstable company
Add your answer
Q2. Add two numbers in a linked list, don't apply
Ans. 
Traverse the linked list and add the values of each node without using additional data structures.
• Traverse the linked list while keeping track of the sum in a variable

• Update the sum by adding the value of each node as you traverse the list

• Handle carry over if the sum of two nodes is greater than 9
Answered by AI
Add your answer
Q3. Sort the array by using all sorting algorithms, don't join
Add your answer
Q4. Subset problem find all the subsets
Ans. 
To find all subsets of a given set, use recursion to generate all possible combinations.
• Use recursion to generate all possible combinations of including or excluding each element in the set.

• Start with an empty subset and recursively add each element to create new subsets.

• Each subset can be represented as an array of strings.
Answered by AI
Add your answer
Q5. LRU Cache problem, explain it and implement it
Ans. 
LRU Cache is a data structure that stores a fixed number of items and removes the least recently used item when the cache is full.
• LRU Cache uses a combination of a doubly linked list and a hashmap to efficiently store and retrieve items.

• When an item is accessed, it is moved to the front of the linked list to indicate it is the most recently used item.

• If the cache is full, the least recently used item at the end of the ...read more
Answered by AI
Add your answer

Q1. 2 rounds, 2 coding questions in each round. Managerial round.
Add your answer

Q1. What is Nodejs and how is it useful + 1 leetcode hard problem
Ans. 
Node.js is a runtime environment that allows you to run JavaScript on the server side, making it useful for building scalable network applications.
• Node.js is built on Chrome's V8 JavaScript engine and uses an event-driven, non-blocking I/O model, making it lightweight and efficient.

• It is commonly used for building web servers, APIs, real-time applications, and microservices.

• Node.js has a large ecosystem of libraries an...read more
Answered by AI
Add your answer