Blackfig Technologies Software Developer Intern Interview Questions and Answers

It had mcq and 1 hard coding question

Q1. They asked me about backtracking and dp series problem and also to solve the given question
Add your answer
Q2. Java and in depth about different pillars of java
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 Problem
Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.
Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...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 Anonymously
Add your answer
Q2. Can you draw an E-R Diagram for Uber?
Add your answer
Q3. 
Maximum Sum Path from Leaf to Root
Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.
Example:
All the possibl...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 Anonymously
Add your 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. 
Add Two Numbers Represented as Linked Lists
Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...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 Anonymously
Add your answer

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.

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 Problem Statement
Generate a pattern based on the input number of rows N. Each row i should start with the i-th letter of the alphabet, and the number of letters in the row should match ...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer
Q2. 
Stack using Two Queues Problem Statement
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Explanation:
...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 Anonymously
Add your answer

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 Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...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 Anonymously
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

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

It was a 2hr test. It had two sections. 1)Quantitative aptitude and verbal ability and 2) Technical aptitude.

Q1. It was for 45 min. Asked some OOPs concepts, CN fundamentals. Questions were asked on arrays and linked lists. also on OS
Add your answer

Q1. It was for 5 min. Asked on why I wanted to join Optum
Add your answer