Blinkit Software Developer II Interview Questions and Answers for Freshers

Q1. Hard Stock sell problem
Ans. 
The hard stock sell problem involves determining the best time to sell stocks to maximize profit.
• Consider using dynamic programming to solve this problem efficiently.

• Keep track of the minimum stock price seen so far and calculate the maximum profit that can be made by selling at each day.

• The final answer will be the maximum profit that can be made by selling at the last day.
Answered by AI
Add your answer
Q2. Create a server without express
Ans. 
Creating a server without using Express framework
• Use Node.js built-in 'http' module to create a server

• Listen for incoming requests on a specific port

• Handle different routes and methods using 'http' module
Answered by AI
Add your answer
Q3. What is singleton class, write a usecase through code
Ans. 
Singleton class is a class that can only have one instance created throughout the application.
• Singleton class restricts the instantiation of a class to one object.

• It is often used for logging, caching, thread pools, database connections, etc.

• Example: Java implementation of Singleton class -

• public class Singleton { private static Singleton instance; private Singleton() {} public static Singleton getInstance() { if(insta...read more
Answered by AI
Add your answer

Easy to medium level of leet code

Q1. 1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
Ans. 
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
• For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.

• For Fibonacci series without recursion, use a loop to calculate the series.

• For string palindrome, compare characters from start and end of the string.

• To count all repeated numbers from the array, u
Answered by AI
View 2 more amswers

Q1. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the ...read more
Ans. 
Rotate array to find max sum of i*A[i]
• Rotate array to bring maximum element to front

• Calculate sum of i*A[i] for each rotation

• Keep track of maximum sum found
Answered by AI
Add your answer

Q1. 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion
Add your answer

1 Hour 2 Medium Coding Question and few DB OOPS OS Questions on Hackerearth

Q1. Coding 1 : 1 Round
Add your answer
Q2. 2 Sum, 3 Sum, Maximum Sum Subarray
Add your answer

Q1. Questions based on Resume, OOPS, Databases, OS
Add your answer
Q2. ACID Properties, Keys questions, Semaphore mutex
Add your answer

Q1. It was based on dynamic programming
Add your answer

It was a DSA ALGO Medium round

Q1. Design an analytics system
Ans. 
Designing an analytics system for data analysis and visualization
• Define the goals and objectives of the analytics system

• Identify the data sources and types of data to be collected

• Choose appropriate tools and technologies for data processing and analysis

• Design a data model and architecture for storing and accessing data

• Implement data visualization techniques for presenting insights to users
Answered by AI
Add your answer

Q1. General HR questions about salary, workstyle, motivation etc
Add your answer

Easy mcq questions basend on ur profile frontend or backend

Medium and easy dsa questions and tech stack related questions

Q1. Normal questions
Add your answer

Basic maths, logical resoning, puzzles

Competitive Programming on Dynamic Programming, Java code debug, SQL qurries