Novopay Solutions Software Developer Intern Interview Questions and Answers

A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.

Q1. What is the index of the first occurrence where a pattern string matches with a text string?
Add your answer
Q2. Given a string, how can we find the minimum length substring whose sum is greater than or equal to a specified target?
Add your answer

Q1. Questions on DSA were asked by the interviewer at first.
Add your answer
Q2. Some theoretical questions from DBMS and oops and also asked to write some SQL queries.
Add your answer

Q1. This round was also similar to the first technical round at first given a DSA question.
Add your answer
Q2. After that I was asked to write some SQL queries and also questions from resume were asked.
Add your answer

Q1. This was managerial round which was was offline in person interview. At first he asked sone basic DBMS and oops questions.
Add your answer
Q2. Then gave me a question and asked me to write a complex SQL query.
Add your answer

There are 3 questions moderate one with topics like dp ( edit distance variant ), dequeue and hashing question. I cleared the test and move forward to interview round 1

Q1. Write code for Topological sort?
Ans. 
Topological sort is a linear ordering of vertices in a directed acyclic graph.
• Use Depth First Search (DFS) to visit each vertex and add it to the result list after visiting all its neighbors.

• Maintain a visited set to keep track of visited vertices and a result list to store the sorted order.

• If a cycle is detected during DFS, the graph is not a DAG and topological sort is not possible.
Answered by AI
Add your answer
Q2. A implementation Based question of a data structure on merging square with many constraints.
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

It consisted of 17 MCQ based on networking and 3 coding questions. Among those one coding question was on practical implementation.

Q1. 
Recycling Pens Problem Statement
Imagine you have a certain number of empty pens, and some money in your pocket. For each pen, you can choose to either recycle it for a reward or buy a refill to make it u...read more
Ans. Bruteforce
• We will iterate through all possible values of the usable pen, i.e from 0 to N and try to find out whether we can make these many usable pens or not.
• Let’s say we currently want to find whether we can make X usable pens or not. To do so we will require X refills and buy X refills we need X*C amount of money.
• We keep X pens and sell N - X pens. We will get (N-X)*K amount of money from selling it.
• So total money w...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

It was around 5-6 p.m. The interviewer was very easy to talk to. They went straight to the questions and asked me if I had any doubts in the end.

There were 3 questions in the online assessment.

1 - Binary Search
2 - DP
3 - Graphs

Q1. Implement a persistence stack with constant time operations
Ans. 
Implement a persistence stack with constant time operations
• Use a combination of a stack and a hashmap to achieve constant time operations for push, pop, and get operations

• Maintain a stack to store the elements and a hashmap to store the index of each element in the stack

• When pushing an element, add it to the stack and update its index in the hashmap

• When popping an element, remove it from the stack and also remove its i...read more
Answered by AI
Add your answer

Q1. Median of two sorted arrays and OOPs basics
Ans. 
Finding the median of two sorted arrays and discussing OOPs basics
• To find the median of two sorted arrays, merge the arrays and then calculate the median

• OOPs basics include concepts like encapsulation, inheritance, polymorphism, and abstraction

• Example: Median of [1, 3] and [2] is 2.0
Answered by AI
Add your answer

Q1. Technical round
Add your answer
Q2. Append element into Array question
Add your answer

Q1. Vector question on array
Add your answer

Q1. Vector based question less time complexity
Add your answer