Syfe Interview Questions and Answers

First round was taken by interview vector on leetcode
1 question was based on binary search

Q1. Binary search(ship capacity leetcode)
Ans. 
Binary search for ship capacity involves finding the minimum capacity needed to transport all packages within a given time.
• Identify the range for ship capacity: min is max weight of packages, max is sum of all weights.

• Use binary search to find the minimum capacity that allows all packages to be shipped within the given time.

• Calculate the number of trips needed for a mid capacity: iterate through packages and sum weight...read more
Answered by AI
Add your answer
Q2. Twitter lld design (medium leetcode)
Ans. 
Design a simplified version of Twitter, focusing on user interactions and tweet management.
• Users can follow/unfollow each other, e.g., User A follows User B.

• Each user can post tweets, e.g., 'Hello World!' as a tweet.

• Users can view their feed, which shows tweets from followed users.

• Implement a timeline that retrieves the latest tweets, e.g., showing the 10 most recent tweets.

• Support retweets and likes for tweets, e.g., ...read more
Answered by AI
Add your answer

Q1. Count no. of islands using DFS
Ans. 
Count the number of islands in a grid using Depth First Search (DFS).
• Create a visited array to keep track of visited cells

• Iterate through each cell in the grid and perform DFS to explore neighboring cells

• Increment the count of islands whenever a new island is encountered
Answered by AI
Add your answer
Q2. Roman to Int
Ans. 
Convert Roman numerals to integers by mapping symbols to values and summing them based on specific rules.
• Roman numerals consist of symbols like I (1), V (5), X (10), L (50), C (100), D (500), M (1000).

• If a smaller numeral appears before a larger one, subtract it (e.g., IV = 4).

• If a smaller numeral appears after a larger one, add it (e.g., VI = 6).

• Example: 'MCMXCIV' = 1000 + (1000 - 100) + (1000 - 10) + 5 = 1994.
Answered by AI
Add your answer

By interview Vector , 2 coding questions

Q1. LLD Stock exchange
Add your answer

Q1. HLD Zomato like
Add your answer

Round 1

First question 30 mins, write a working modular code
Buy and sell stock 2 like Problem from leetcode.
Given an array of stock prices each day you can buy or sell stock. you can hold almost 1 stock at any time. return maximum profit you can achieve

2. Dp, maximum points from a card (30min
Several cards are arranged in a row and each card has one number. you can take a total K cards from the beginning or at the end. Your score is the sum of points on the cards you have picked.
eg: [1,2,3,4,5,6,1] k = 3 -> Ans 12