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

Q1. Sort an array into group of K elements
Ans. 
Sort an array of strings into groups of K elements
• Iterate through the array and create subarrays of size K

• Use a loop to go through the array and add elements to the subarrays

• Handle cases where the array length is not divisible by K
Answered by AI
Add your answer
Q2. Reverse a linked list
Ans. 
Reverse a linked list by changing the next pointers of each node
• Start with three pointers: current, prev, and next

• Iterate through the list, updating the next pointer of each node to point to the previous node

• Update prev and current pointers for next iteration
Answered by AI
Add your answer

Q1. Android In depth
Ans. 
Android is a mobile operating system developed by Google, based on the Linux kernel and designed primarily for touchscreen devices.
• Android is open-source and allows developers to create applications using Java programming language.

• Android applications are distributed through the Google Play Store.

• Android supports a wide range of hardware devices from various manufacturers.

• Android provides a rich set of APIs for develop...read more
Answered by AI
Add your answer
Q2. OOPS related questions
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

Basic dsa questions and java spring boot questions

Q1. Bookmyshow design
Add your answer
Q2. Notification service design
Ans. 
Design a notification service for sending alerts to users.
• Use a scalable messaging system like Kafka or RabbitMQ to handle high volume of notifications.

• Implement a notification queue to ensure reliable delivery of notifications.

• Include support for different types of notifications such as email, SMS, and push notifications.

• Allow users to customize their notification preferences and frequency.

• Implement monitoring and log...read more
Answered by AI
Add your answer

Q1. Mimic Dataframe Merge
Ans. 
Implement a function to mimic the functionality of merging two DataFrames in Python.
• Create a function that takes two DataFrames as input.

• Merge the two DataFrames based on a common column or index.

• Handle different types of joins like inner, outer, left, and right joins.

• Return the merged DataFrame as output.
Answered by AI
Add your answer
Q2. Improve above case by case
Add your answer

1 hour - Find longest palindromic substring

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