Startup Full Stack Developer Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

The test happened at 9 PM, and the duration was of 90 mins. The test was held on Codility platform.

Q1. 
Reach the Destination Problem Statement
You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mo...read more
Ans. Brute force approach
The naive approach to solve this problem is to consider each and every possible move until we reach the destination.
 
This can be done using recursion. Below is the algorithm:
 
• Check for the bases:
  • If the source and destination coordinates are the same, return true.
  • Return false, if the x (or y) coordinate of source point is greater than the x (or y) coordinate of the destination point. As the...read more
Answered Anonymously
Add your answer
Q2. 
Circular Move Problem Statement
You have a robot currently positioned at the origin (0, 0) on a two-dimensional grid, facing the north direction. You are given a sequence of moves in the form of a string ...read more
Ans. Optimal Approach
Initialize a variable ‘direction’ with 0 which means that the robot is initially facing towards the north.
direction: 0 -> Robot is facing towards the North
direction: 1 -> Robot is facing towards the West 
direction: 2 -> Robot is facing towards the South 
direction: 3 -> Robot is facing towards the West
 
Initialize two variables ‘x’ and ‘y’ as 0. They will represent the position ...read more
Answered Anonymously
Add your answer
Q3. 
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...read more
Ans. Recursion
This problem can be solved by solving its subproblems and then combining the solutions of the solved subproblems to solve the original problem. We will do this using recursion.
Basically, we have to buy the stock at the minimum possible price and sell at the maximum possible price, keeping in mind that we have to sell the stock before buying it again.
 
 
Below is the detailed algorithm: 
 
1. Call ...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The timing for this round was around 10 AM. How to optimize website assets loading? Explain Hoisting in javascript.

Q1. 
Count Pairs with Given Sum
Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
Input:
The first line c...read more
Ans. Brute Force Approach
• Initialize the ans = 0
• Run two loops first from i = 0 to n-1 and second from j = i+1 to  n-1 and if arr[i] + arr[j] == Sum then increase the ans by 1.
• Return ans
Space Complexity: O(1)Explanation:
O(1)
 
As constant extra space is used.
Time Complexity: O(n^2)Explanation:
O(N^2), where N is the size of the array.

As we are running two nested loops of size N.
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was a problem solving round and consisted of puzzles and mathematical problems.

Q1. They grind u in javascript,typescript
Add your answer
Q2. Html css, angular
Add your answer
Q3. Deep preparation needed
Add your answer

Q1. How are you today
Add your answer
Q2. What's the weather today
Ans. 
The weather today is sunny with a few clouds and a high of 75 degrees.
• Sunny weather with some clouds

• High temperature of 75 degrees

• Possibility of rain later in the day
Answered by AI
Add your answer
Q3. Why do you want to join
Ans. 
I am passionate about creating innovative software solutions and believe your company aligns with my values and goals.
• Passionate about software development

• Believe company aligns with values and goals
Answered by AI
Add your answer
Q4. What values do you have
Ans. 
I value continuous learning, collaboration, innovation, and integrity in my work as a software developer.
• Continuous learning: I believe in staying updated with the latest technologies and trends in the industry.

• Collaboration: I value working in a team and sharing knowledge and ideas with my colleagues.

• Innovation: I strive to find creative solutions to problems and improve processes.

• Integrity: I believe in honesty, tran...read more
Answered by AI
Add your answer
Q5. What do you like more, array or list
Ans. 
I prefer arrays for their fixed size and faster access, but lists for their flexibility and ease of manipulation.
• Arrays are preferred for their fixed size and faster access time, especially when random access is required.

• Lists are more flexible and easier to manipulate, especially when elements need to be added or removed frequently.

• Arrays are typically used when the size of the collection is known beforehand, while li...read more
Answered by AI
Add your answer

Question Related to the DP and the Graph

Q1. Kth Max Element in a Array
Ans. 
Find the Kth maximum element in an array of strings.
• Sort the array in descending order.

• Return the element at index K-1.
Answered by AI
Add your answer
Q2. Coin Change and optimization through DP
Ans. 
Coin change problem can be solved using dynamic programming to find the minimum number of coins needed to make a certain amount of change.
• Use dynamic programming to build up solutions for smaller subproblems

• Start by initializing an array to store the minimum number of coins needed for each amount from 0 to the target amount

• Iterate through each coin denomination and update the array with the minimum number of coins need
Answered by AI
Add your answer

Q1. Project include in your Resume
Add your answer
Q2. HR common question
Add your answer

MCQ test consisting of 70 mcqs in 75 minutes from aptitude english and cs fundamentals. If cleared next paper 2 coding qs medium level

Q1. Two sum leetcode problem
Add your answer
Q2. What problems you faced in your project
Ans. 
I faced challenges with integrating third-party APIs and debugging complex logic.
• Difficulty in understanding and implementing third-party APIs

• Issues with data synchronization between different systems

• Troubleshooting complex logic errors

• Managing dependencies and version conflicts

• Time constraints affecting problem-solving
Answered by AI
Add your answer

DP graphs strings it was good

Q1. Reverse a linkded list
Ans. 
Reverse a linked list by changing the direction of pointers
• Start with three pointers: current, previous, and next

• Iterate through the list, updating pointers to reverse the direction

• Return the new head of the reversed list
Answered by AI
Add your answer
Q2. Print fibonacci series
Ans. 
The Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.
• Start with two variables initialized to 0 and 1

• Loop through desired number of iterations, adding the previous two numbers to get the next number

• Print or store each number in the series
Answered by AI
Add your answer

Q1. DS & Algo topics
Add your answer
Q2. GoLang concepts
Add your answer

Q1. More on Server Architectural Questions
Add your answer
Q2. Questions related to database & all
Add your answer

Q1. Why are you switching the job
Add your answer
Q2. What is your goal in next 5years
Add your answer