Sourcefuse Technologies Software Developer Intern Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Medium

This round consisted of a coding test containing 2 questions purely based on Data Structures and Algorithms.
One was a Dynamic Programming Problem, and 
the other one was a linked list question

Q1. 
Count Ways to Climb Stairs Problem
Given a staircase with a certain number of steps, you start at the 0th step, and your goal is to reach the Nth step. At every step, you have the option to move either on...read more
Ans. 
Count the number of distinct ways to climb stairs by moving either one step or two steps at a time.
• Use dynamic programming to solve the problem efficiently.

• Keep track of the number of ways to reach each step by considering the number of ways to reach the previous two steps.

• Return the result modulo 10^9+7 to handle large outputs.

• Example: For N=4, ways to climb are {0,1,2,3,4}, {0,1,3,4}, {0,2,4}. Total 3 ways.
Answered by AI
Add your answer
Q2. 
Merge Sort Linked List Problem Statement
You are given a singly linked list of integers. Your task is to sort the linked list using the merge sort algorithm.
Explanation:
Merge Sort is a divide and conq...read more
Ans. 
Implement merge sort algorithm for singly linked list of integers.
• Divide the linked list into two halves using slow and fast pointer technique.

• Recursively sort the two halves.

• Merge the sorted halves using a merge function.

• Ensure to handle edge cases like empty list or single node list.

• Example: Input: 3 1 2 -1, Output: 1 2 3 -1
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Introduction first
Tell me about your projects. He said you have done quite a few projects in JavaScript so tell me
Akshat what is es6 in JavaScript. I was not able to answer that.
What is bootstrap?
What is the difference between div and span tags in HTML?
How many handshakes will take place if there are 6 persons? I told him the P & C approach and then he said no please explain in the normal way so I said sir it's 1+ 2 + 3 + 4 + 5 = 15.
Reverse a String in optimal way
What is a preprocessor and preprocessor directive?
What is typedef?
Have you done exception handling? Explain
Polymorphism and inheritance and explain all types of both.
There were no questions asked on OS and DBMS in this round

Q1. 
Palindrome Substrings
Given a string STR, your objective is to determine the total count of palindromic substrings within it.
Input:
The first line contains an integer 't', the number of test cases. Eac...read more
Ans. 
Count the total number of palindromic substrings in a given string.
• Iterate through each character in the string and expand around it to find palindromic substrings.

• Use dynamic programming to optimize the solution by storing previously computed results.

• Consider both odd and even length palindromes while counting.

• Example: For input 'abbc', the output should be 5 (['a', 'b', 'b', 'c', 'bb']).
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Your intro.
Bubble sort algorithm
Remove a specific character from all positions in a given string (3 test cases given)
Explain runtime polymorphism
Find minimum number of insertions required to make a string palindrome (he said No DP to be used)

I was able to code and explain all of them.
Make ER diagram of your 4th semester Project
He asked me if I know abt normalization
He asked me a ques on normalization, I was not able to answer it, then he asked me to write an SQL query based on the same table, I answered that
Query -> Find the maximum salary in each department, wherein the department and salary fields were in two different tables
Then he asked, tell me the different pillars of OOPs.
He asked about my projects
He saw my resume.
He asked about how the online coding test was, what were the difficulties you faced.

Q1. 
Delete a Node from a Linked List
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
Input:
The first line co...read more
Ans. 
Implement a function to delete a node from a linked list at a specified position.
• Traverse the linked list to find the node at the specified position.

• Update the pointers of the previous and next nodes to skip the node to be deleted.

• Handle cases where the position is at the beginning or end of the linked list.

• Ensure to free the memory of the deleted node to avoid memory leaks.
Answered by AI
Add your answer