Archishman Sengupta

BookMyShow's platform crashed today during the Coldplay India 2025 ticket sale, highlighting the challenges of handling high concurrency. As developers, we must focus on building systems that can withstand massive traffic surges to avoid such failures in the future. The critical needs are: 1.Scalable Infrastructure: Implement cloud-based auto-scaling to handle traffic spikes. 2.Load Balancing: Use tools like Nginx or AWS ELB to evenly distribute traffic. 3.Distributed Systems: Adopt microservices for independent scalability. 4.Caching: Utilize Redis or CDNs to reduce server load. 5.API Rate Limiting: Prevent system overload by capping API requests. 6.Load Testing: Regularly simulate high-concurrency scenarios with tools like JMeter. BookMyShow Zomato Paytm JavaScript Mastery freeCodeCamp #DevOps #ScalableSystems #Crash #LoadBalancing #Microservices #Caching #APIRateLimiting #LoadTesting #Coldplay2025 #BookMyShow #systemdesign

25

4 Comments

‼️KotlinConf 2024 Update‼️ Due to overwhelming enthusiasm, KotlinConf 2024 in Delhi NCR has been shifted to 22nd June. 🚀 Delhi Kotlin User Group We've introduced an exciting way to increase your chances of securing Confirmed Passes and Exclusive Swags:🥳 1. Register on HackQuest.io: - Use Invite Code "𝗞𝗼𝘁𝗹𝗶𝗻" during registration. - Complete your profile and verify your email. - Optional: Enroll in free learning tracks to earn rewards. 2. Register on OCID Platform: https://lnkd.in/gDgf6J23 - Use Invite Code "𝗛𝗖𝗞𝗤𝗦𝗧" if not pre-filled. - Complete your profile and verify your email. 3. 𝗦𝗲𝗻𝗱 𝗮𝗹𝗹 𝘁𝗵𝗲 𝗲𝗺𝗮𝗶𝗹𝘀: - 𝗗𝗠 𝗺𝗲 the 𝗲𝗺𝗮𝗶𝗹 𝗜𝗗𝘀 used for both registrations.📩 See you at KotlinConf Delhi NCR 2024! For any update contact your friendly neighborhood ambassador - SNEHA YADAV 😇

50

7 Comments

LeetCode Daily Challenge: IPO Problem Ever wondered how to maximize your capital while starting multiple projects? That's exactly what today's challenge, the LeetCode IPO problem, is all about! Problem: Given k projects with their respective profits and capital requirements, and an initial capital w, choose up to k projects to maximize your capital. Procedure: I dove into the problem head-first with a loop approach—adding feasible projects and sorting through options like a #CodeNinja. After some trial and error (and a few chai break☕), I had an aha moment : why not use a max heap? With the heap, I could efficiently manage and pick the most profitable project without reinventing the wheel (or in this case, the loop)! Steps: Step 1: Sorted through the available projects like a pro, figuring out which ones to tackle. Step 2: Finally, hit the jackpot with the max heap approach. Just like that, my capital started growing faster than a #SpaceX launch! Step 3: Ended up with a solution that's not just efficient, but also elegant (if I do say so myself). #CodingLife #TechSolutions #SoftwareEngineering #Heap #Algorithm #DataStructures #Programming #LeetCodeChallenge #IPOProblem

4

MrBeast's strategy for coming to India involves several key elements: 1. Collaboration with CarryMinati:- MrBeast is teaming up with one of India's biggest YouTubers, CarryMinati, to create a buzz and attract a large audience 2. Product Launch-: Mr Beast will be launching his chocolate brand, Feastables, in the Indian market 3. Fan Engagement-: By visiting India and participating in events, MrBeast aims to engage with his Indian fan base, creating memorable experiences and strengthening his connection with fans. 4. Promotion and Marketing-: The event is being heavily promoted on social media platforms, generating excitement and anticipation among fans 5. Strategic Partnerships-: MrBeast is also bringing other popular YouTubers like Logan Paul , KSI, and ishowspeed to India, creating a star-studded lineup that will draw even more attention and excitement. By combining these strategies, MrBeast aims to make a significant impact in India, both in terms of brand expansion and fan engagement. It's a smart move to leverage his popularity and create a memorable event for his fans. Does this align with what you had in mind, or is there something specific you'd like to know more about? #Mrbeast

1

🚀 Understanding OTP Verification: A Tale of Two Approaches by Uber and Rapido 🚀 As a PM, I'm always fascinated by how different companies solve similar problems in unique ways. Today, let's delve into the world of OTP (One-Time Password) verification, specifically how Uber and Rapido handle this crucial step in their ride-hailing services. 🔍 The Two Approaches: Uber: Generates a new OTP for every ride. Rapido: Uses the same OTP for all rides. 👥 Consumer Perspective: Uber's Dynamic OTP: Security: Each ride gets a unique OTP, enhancing security by ensuring that the code can’t be reused. Trust: Builds consumer trust by showing a clear commitment to safety. Convenience: Might be seen as slightly less convenient because users have to deal with a new OTP every time. Rapido's Static OTP: Ease of Use: Users have one less step to worry about, making the experience more seamless. Speed: Faster onboarding for each ride since the verification step is reduced. Potential Risks: Reusing the same OTP might pose a security risk if the OTP is compromised. 💡 Technical Perspective: Uber's Dynamic OTP: Implementation: Requires a system that generates, sends, and verifies a new OTP for each ride. This involves more complex backend operations and SMS costs. Security: Higher level of security as each OTP is valid only for a single transaction, reducing the risk of misuse. Rapido's Static OTP: Implementation: Simpler backend logic, as the OTP generation and verification processes are less frequent. Efficiency: Reduced operational costs due to fewer OTP generation. Risk Management: Needs robust monitoring to detect and prevent misuse or fraudulent activities. 🔄 Balancing Act: Both approaches have their merits and trade-offs. The choice between dynamic and static OTP depends on the company's priorities: whether they emphasize top-tier security and consumer trust (Uber) or prioritize user convenience and operational efficiency (Rapido). 🔑 Key Takeaway: Understanding your user base and aligning your verification methods with your business goals is crucial. As product managers, we must continuously evaluate the impact of our security measures on both user experience and backend operations. #ProductManagement #UserExperience #CyberSecurity #TechInsights #Uber #Rapido #OTPVerification

169

14 Comments

A Billion Dollar B2C startup founder asking others to not hang out with people 🤷‍♂️. Other instances: 1. Tech Founder telling you writing code is unimportant. 2. VCs telling tech founders that they don't differentiate companies based on tech. Things you see only in Indian startup ecosystem.

19

2 Comments

**A Heartfelt Goodbye to Koo** It’s with a heavy heart that I share the news—Koo, India’s homegrown microblogging platform, is shutting down. Despite its incredible journey and the vibrant community of 10 million active users, Koo couldn’t secure the partnerships and funding needed to keep going. Koo was more than just a social media platform; it was a vision to democratize expression in multiple Indian languages. It attracted over 9000 celebrities, expanded to Brazil, and secured over $60 million in funding. However, the immense costs of running a social media platform, coupled with a prolonged funding winter, made it challenging to sustain growth. Looking back, it’s clear that Koo faced insurmountable challenges from the start. The cost of maintaining such a platform was always going to be high, and without significant and sustained investment, competing with well-funded global giants was a monumental task.  Just months away from surpassing Twitter in India in 2022, Koo needed more capital to maintain its momentum. Despite exploring partnerships with many companies, none materialized. Now, the team is considering turning Koo’s assets into a digital public good, sharing them with those who have a great vision for India’s social media landscape. As an enthusiast who has followed Koo's journey, I am incredibly proud of what the team achieved. I am deeply grateful to the team, investors, creators, users, and journalists who supported Koo along the way. Koo’s story is a testament to the power of innovation and the spirit of entrepreneurship in India. As we bid farewell to Koo, I remain hopeful and excited about the future of Indian startups and the dream of creating impactful, world-beating products from India. The little yellow bird says its final goodbye... #Koo #Startup #SocialMedia #TechJourney #IndianStartups #GoodbyeKoo #Innovation #Entrepreneurship #ThankYou

2

BookMyShow's platform crashed today during the Coldplay India 2025 ticket sale 🚨 This highlights a major issue many companies face—managing high concurrency during sudden traffic surges. As developers, it's crucial we focus on building robust, scalable systems to handle such spikes and avoid crashes. Here are key areas we need to focus on to future-proof our platforms: 1. Scalable Infrastructure: Utilize cloud-based auto-scaling to manage traffic fluctuations seamlessly. 2. Load Balancing: Implement tools like Nginx or AWS ELB to distribute traffic evenly across servers. 3. Distributed Systems: Shift to microservices architecture for flexible, independent scalability. 4. Caching: Leverage Redis or CDNs to reduce server load by caching frequent requests. 5. API Rate Limiting: Implement rate limiting to cap API requests and prevent overload. 6. Load Testing: Regularly simulate high-concurrency scenarios using tools like JMeter. In a world where millions of users can flood your platform at any moment, building for scale is non-negotiable. Let’s start preparing today to avoid future meltdowns. #BookMyShow #Zomato #Paytm #JavaScriptMastery #freeCodeCamp #WebDevelopment #Cloud #ScalableSystems #TechTalk

172

23 Comments

"Hello Developers, I need a folder inside folder option in Kaagaz App" We got this message from one of our users, and initially we were like - why does this user want to complicate his folders... After thinking & brainstorming on the suggestion, we realised that this is a problem with users who either want to maintain a lot of PDFs or PDFs of multiple people. We worked on the feature and launched it - and it became a go to feature for our power users. Have you ever used this feature in Kaagaz App? Do comment :) #Kaagaz #Updates #startup #build

82

9 Comments

CoinSwitch's parent company PeepalCo has launched a stockbroking platform called Lemonn. CoinSwitch does have more than 2 CR users on its platform they've raised more than $300 million from their investors and they're a unicorn as well but the company's Revenue has declined by more than 80% in FY 23 down to just 45.6 crores total from a high of almost 250 crores in fy22. so Lemonn may be an act of desperation on CoinSwitch's part they're just trying to survive here but there might still be an opportunity for them in this space because just 6% of Indians are investing in the stock market. Whether Lemonn can compete with established players like Zerodha and Groww depends on several factors: ✅ Market Potential: Since only a small percentage of Indians are investing in stocks, there's room for growth for new platforms like Lemonn. ✅ Brand Recognition: CoinSwitch's large user base could help Lemonn gain traction if they leverage their brand effectively. ✅ Product Differentiation: Lemonn needs to offer unique features, better user experience, or lower fees to attract users. ✅ Execution and Adaptability: Lemonn's success hinges on how well it's executed and how quickly it adapts to market changes and customer needs. ✅ Competition: The stockbroking market is competitive, but Lemonn could carve out a niche if it identifies specific market segments or offers innovative features. while the market may be competitive, there's still potential for Lemonn could succeed if it effectively uses CoinSwitch's resources, addresses market gaps, and provides value to investors. Do you believe CoinSwitch's Lemonn has the potential to compete with established players like Zerodha and Groww? Follow Naresh Purohit 🇮🇳 .😀 😊 LinkedIn Guide to Creating Guide to Networking for LinkedIn LinkedIn Guide to Networking LinkedIn News India LinkedIn #CoinSwitch #Lemonn #StockBroking #MarketAnalysis

11

🔸Here's Todays Leetcode Problem of the day : [ 🔥DAY 248 ] 🔸Name : IPO 🔸Description : Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increase its capital before the IPO. Since it has limited resources, it can only finish at most k distinct projects before the IPO. Help LeetCode design the best way to maximize its total capital after finishing at most k distinct projects. You are given n projects where the ith project has a pure profit profits[i] and a minimum capital of capital[i] is needed to start it. Initially, you have w capital. When you finish a project, you will obtain its pure profit and the profit will be added to your total capital. Pick a list of at most k distinct projects from given projects to maximize your final capital, and return the final maximized capital. The answer is guaranteed to fit in a 32-bit signed integer.   Example 1: Input: k = 2, w = 0, profits = [1,2,3], capital = [0,1,1] Output: 4 Explanation: Since your initial capital is 0, you can only start the project indexed 0. After finishing it you will obtain profit 1 and your capital becomes 1. With capital 1, you can either start the project indexed 1 or the project indexed 2. Since you can choose at most 2 projects, you need to finish the project indexed 2 to get the maximum capital. Therefore, output the final maximized capital, which is 0 + 1 + 3 = 4. Example 2: Input: k = 3, w = 0, profits = [1,2,3], capital = [0,1,2] Output: 6   Constraints: 1 <= k <= 105 0 <= w <= 109 n == profits.length n == capital.length 1 <= n <= 105 0 <= profits[i] <= 104 0 <= capital[i] <= 109 🔸Link: https://lnkd.in/dukK7_vU

8

Let's discuss the 4th problem of today's LeetCode Weekly Contest 414 ... It personally took me a lot of time to optimize it before getting AC but the problem was really good... Concepts => BFS + BitMaskDP Only reason I could think of BitMask was because the size of positions vector was atmax 15 so each mask can ideally represent the state of the board. Now we also need a state to show whose turn it is which can be 0/1 where 0 represents it's Alice's turn and 1 represents it's Bob's turn. We also need information of current position of Knight. Now your Knight can move across different boxes but we just need the information when the Knight is at the position where it kills any pawn because that's when the other player will take it's turn so it will be at max 16 boxes where 15 can be those from positions vector and 1 of the initial position of Knight. We will precompute the minimum distances between any two positions in grid (here min moves) using BFS or Dijkstra. Knight can move at max 8 adjacent positions . Also we don't need to find this for each box of grid , just find it for those 16 boxes which are of our concern. Now we can define the state of DP : dp[ind][mask][0] => minimum number of moves needed to kill all pawns which are remaining (the ones whose bit is set in mask) if we are standing at {x,y} => {position[ind][0], position[ind][1]} place in grid. dp[ind][mask][1] => maximum number of moves needed to kill all pawns which are remaining (the ones whose bit is set in mask) if we are standing at {x,y} => {position[ind][0], position[ind][1]} place in grid. State Transitions : We can kill any pawn and check for further states. Let's say our current Mask is : "mask", current index is : "ind" current turn = "turn" // turn = 1 for alice and turn = 0 for bob. if(mask==0) return 0; // all pawns are killed if(dp[ind][mask][turn]!=-1) return dp[ind][mask][turn]; int ans = (turn ? -1 : 1e10); for(int i = 0;i<15;i++) { if(mask&(1<<i)) => this means the pawn at {positions[i][0],positions[i][1]} is alive so we can kill this one and get answer for further state which is : int newMask = mask& (~(1<<i)); // unset i'th bit int nextStateAns = solve(i,newMask, !turn); int currReqMoves = dist[ind][positions[i][0]][positions[i][1]]; if(turn==1) ans = max(ans, currReqMoves + nextStateAns); else ans = min(ans, currReqMoves + nextStateAns); } return dp[ind][mask][turn] = ans; You can set index of {kx,ky} as positions.size() ; Answer => dp[index of {kx,ky} ][all bits set][1]; Try to figure out the time and space complexity for this approach and mention it in comments below. Optimizations were required here just to be able to fit into ideal number of operations which are 1e7 or 1e8 at max in one second. My submission : https://lnkd.in/dAM9cpb4 #leetcode #leetcodecontest #codingcommunity #weeklycontest #competitiveprogramming #codingchallenge #cppprogramming #cpp #contest #approach #solutions #datastructures #algorithms

231

6 Comments

A post by X user Naveen Kopparam has gone viral, revealing that a dosa seller near his home earns over ₹20,000 daily, totaling ₹6 lakh a month, and takes home ₹3-3.5 lakh after expenses—all without paying income tax. This sparked debates on social media about the disparity between vendors and salaried employees in India. Kopparam noted that while the vendor pays no taxes, a salaried employee earning ₹60,000 monthly pays 10% as tax. The post raised broader concerns about income tax policies and tax evasion, with users questioning similar practices by professionals like doctors and traders. #ViralPost #DosaSeller #StreetFoodIndia #SocialMediaDebate #IndiaEconomy #EarningsDisparity #SmallBusinessStories #marketinggrowmatics #smallbusiness #smallbusinessowner #startups

1

CRED’s Genius Marketing Strategy Hidden in Plain Sight Today, while going through my Google Pay transaction history, I noticed something interesting. For payments made via CRED, it mentions “Paid via CRED and got cashback.” This really made me think about how brilliantly CRED is marketing itself. By integrating cashback mentions into payment platforms like Google Pay, they’re not just rewarding their users but also subtly promoting their brand to a wider audience. Such strategies not only build trust but also encourage more people to explore the platform. A simple yet impactful way to stay on top of people’s minds! What are your thoughts on such creative marketing techniques? #MarketingStrategy #CRED #DigitalMarketing #Branding #Innovation #UserExperience #FinTech #CustomerEngagement #GrowthHacking CRED CRED support Kunal Shah

33

Today I became a knight on leetcode...✨ My Learnings, 1. Find Patterns: Look for Common patterns in questions.This will help to solve similar problems more easily in future . 2.Making Notes: Whenever I learn a new concept ,write it down.This will help to review later 3.Solve the striver SDE Sheet:It covers a lot of important topics 4.Join Contest:I have joined the Contest regularly since the first year and got the badge in my 74th contest 5.Solve Problems After the Contests: After each contest upsolve the problem whose concept will be studied but at the time of contest not solved. 6.Learn advanced Topics: Make sure you know advanced topics like Bit masking,Binary Search,Dynamic programming.These are important topics for solving harder problems . I would like to Thank Abhay Singh Manan Jain Amit Maity Ashish Khurana sir for their constant support . #leetcode #knight #contest #problem

490

74 Comments

🔸Here's Todays Leetcode Problem of the day : [ 🔥DAY 217 ] 🔸Name : Find the Safest Path in a Grid 🔸Description : You are given a 0-indexed 2D matrix grid of size n x n, where (r, c) represents: A cell containing a thief if grid[r][c] = 1 An empty cell if grid[r][c] = 0 You are initially positioned at cell (0, 0). In one move, you can move to any adjacent cell in the grid, including cells containing thieves. The safeness factor of a path on the grid is defined as the minimum manhattan distance from any cell in the path to any thief in the grid. Return the maximum safeness factor of all paths leading to cell (n - 1, n - 1). An adjacent cell of cell (r, c), is one of the cells (r, c + 1), (r, c - 1), (r + 1, c) and (r - 1, c) if it exists. The Manhattan distance between two cells (a, b) and (x, y) is equal to |a - x| + |b - y|, where |val| denotes the absolute value of val.   Example 1: IInput: grid = [[1,0,0],[0,0,0],[0,0,1]] Output: 0 Explanation: All paths from (0, 0) to (n - 1, n - 1) go through the thieves in cells (0, 0) and (n - 1, n - 1). Example 2: nInput: grid = [[0,0,1],[0,0,0],[0,0,0]] Output: 2 Explanation: The path depicted in the picture above has a safeness factor of 2 since: - The closest cell of the path to the thief at cell (0, 2) is cell (0, 0). The distance between them is | 0 - 0 | + | 0 - 2 | = 2. It can be shown that there are no other paths with a higher safeness factor. Example 3: Input: grid = [[0,0,0,1],[0,0,0,0],[0,0,0,0],[1,0,0,0]] Output: 2 Explanation: The path depicted in the picture above has a safeness factor of 2 since: - The closest cell of the path to the thief at cell (0, 3) is cell (1, 2). The distance between them is | 0 - 1 | + | 3 - 2 | = 2. - The closest cell of the path to the thief at cell (3, 0) is cell (3, 2). The distance between them is | 3 - 3 | + | 0 - 2 | = 2. It can be shown that there are no other paths with a higher safeness factor.   Constraints: 1 <= grid.length == n <= 400 grid[i].length == n grid[i][j] is either 0 or 1. There is at least one thief in the grid. 🔸Link: https://lnkd.in/d22PG5CB

5