Blackfig Technologies Software Developer Intern Interview Questions and Answers

Dsa mostly from arrays,trees.

Q1. Intro of the candidate
Add your answer
Q2. What Do iKnow that is not written in my resume.
Add your answer

Moderate difficulty level questions were asked

High difficulty level questions were asked

DSA questions of array and strings

Q1. DSA on array advanced topics
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

Q1. Kth largest element in the unsorted array
You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.
E...read more
Ans. Brute Force
• The most obvious brute force approach would be to sort the array in descending order and return the ‘K’th element from the beginning of the array.
• Sort the array in descending order, for sorting most of the languages have their inbuilt sort methods which are usually very fast.
• After sorting, return the element arr['K'-1](i.e. element at index ‘K’-1, considering 0-based indexing).
Space Complexity: O(1)Explanati...read more
Answered by CodingNinjas
View 1 more answer
Q2. System Design Question
Draw E-R Diagram for Uber.
Add your answer
Q3. Maximum sum path from the leaf to root
You are given a binary tree of 'N' nodes.
Your task is to find the path from the leaf node to the root node which has the maximum path sum among all the roo...read more
Ans. Recursive Subproblem
The idea here is that we will do a recursive solution by asking the children of the current node for the max sum path and then choose the path with the max sum. 
 
The approach will be as follows:
1. Get the max sum path for the left subtree.
2. Get the max sum path for the right subtree.
3. Select the one with the max sum from both and insert current node's data into it.
4. Return the updated path.
    
Al...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 30 Minutes
Round difficulty - Easy

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

Q1. Technical Question
Given a file of 1 GB having data in form of digits, sort the file elements with 100 MB RAM available.
 
Add your answer
Q2. Add Two Numbers As Linked Lists
You are given two linked lists representing two non-negative numbers. The digits in the linked list are stored in reverse order, i.e. starting from least significant digit (...read more
Ans. Recursion
• A simple approach could be to recursively add the nodes of the linked list while keeping track of the carry generated.
• The idea behind this approach is the same as finding the sum of two numbers manually on a paper, where we start by adding the LSD and move on till the MSD. Also, keeping track of the carry generated in every iteration.
• As the linked lists represent the numbers in reverse order, the LSD occurs at...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 15 Minutes
Round difficulty - Easy

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.

Q1. Basic HR Questions
Who is your role model?
Where do you see yourself in 5 years?
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

It was in the morning. It had basic questions and 2 programming questions(1 string and 1 Data Structure)

Q1. Character Pattern
Print the following pattern for the given N number of rows.
Pattern for N = 4
A
BC
CDE
DEFG
Input format :
Integer N (Total no. of rows)
Output format :
Pattern in N lines
Const...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered by CodingNinjas
Add your answer
Q2. Stack using queue
Implement a Stack Data Structure specifically to store integer data using two Queues.
There should be two data members, both being Queues to store the data internally. You may use the i...read more
Ans. Approach 1
• This method ensures that every new element entered in the queue ‘q1’ is always at the front.
• Hence, during pop operation, we just dequeue from ‘q1’.
• For this, we need another queue ‘q2., which is used to keep every new element to the front of ‘q1’.
• During push operation :
  • Enqueue new element ‘x’ to queue ‘q2’.
  • One by one, dequeue everything from ‘q1’ and enqueue to ‘q2’.
  • Swap the names of ‘q1’ and ‘q2’.
• During pop o...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 60 minutes
Round difficulty - Medium

My interviewer asked me about my projects and the concepts involved in making it. Then he asked me to solve a string problem which was not very difficult followed by basic questions on array and it's properties. He also asked HTML tags.

Q1. Reverse the String
You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.
For example:
 If the given string is: STR...read more
Ans. Optimal Solution
• Traverse the string and swap the first character with the last character, the second character with the second last character and so on.
• Basically, you need to swap the i-th character with the (N-i-1)-th character where N is the length of the string and 0-based indexing is considered.
Space Complexity: O(1)Explanation:
O(1).
 
In the worst case, only constant extra space is required.
Time Complexity: O(...read more
Answered by CodingNinjas
Add your answer

Round duration - 150 minutes
Round difficulty - Easy

This round for Sapient was based on it's core values and how I've implemented these once or more in life. It mostly involved discussion around my leadership, team player, problem solving and innovative skills as a part of the clubs in college. Also, what are my expectations from Sapient and what I bring to them

Q1. Basic HR Questions
An instance where I resolved a conflict
An instance of my leadership skills
An instance where I brought or implemented a new idea and how it went
An instance where I made a mistake and what ...read more
Ans. 
Tip 1 : Be calm and support your skills with instances
Tip 2 : Make sure to tell the truth, lieing would lead to fumbling and loss of credibility
Tip 3 : Read their core values and remember it during the interview
Answered by CodingNinjas
Add your answer

Cf questions asked of rating 1400

Q1. What is ts & why we should use over js
Ans. 
TypeScript (ts) is a superset of JavaScript (js) that adds static typing and other features to improve code quality and maintainability.
• TypeScript provides static typing, which helps catch errors at compile time rather than runtime.

• TypeScript supports modern JavaScript features like classes, interfaces, and modules.

• TypeScript can be transpiled into JavaScript, making it compatible with all browsers and environments.

• Typ...read more
Answered by AI
Add your answer
Q2. System design question of Netflix
Add your answer

Asked single que which is dp

Q1. 1.Self introduction 2.question about my department(ex ECE) 3.oops (polymorphism,inheritance,encapsulation) 4.programming C language because i preferred factorial of given number using recursion ...read more
Add your answer

Q1. Just a formalities of checking address aadhar no mobile num thats all.
Add your answer