Tip 1: Make sure to solve at least 5-6 low-level design questions beforehand.
Tip 2: The variables should be self-defining in nature.
Tip 3: Revise core subjects.
Tip 1: Add only real achievements.
Tip 2: An in-depth understanding of the topic that you have written in your resume is a must.
Started with introduction about each other. Then started with Dynamic programming problem which eventually came to House Robber 2. And later, one more question was asked which is the lowest common ancestor in a binary tree.
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses in this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses are broken into on the same night.
Given an integer array nums representing the amount of money in each house, return the maximum amount of money you can rob tonight without alerting the police.
Tip 1: The answer always is the maximum of the take or not take value, which is basically whether a particular house should be robbed or skipped.
You may assume that given ‘X’ and ‘Y’ definitely exist in the given binary tree.
For the given binary tree
LCA of ‘X’ and ‘Y’ is highlighted in yellow colour.
Again started with introduction, project that built during college and previous internship experience. Then an LLD question of split wise asked. Expectation is class design, relationship, and schema.
Expense-sharing applications are used to log, track, and monitor the expenses of users with each other or in a group. The most famous example of such an application is Split-wise. Design Split-wise.
Proper schema design is expected, make sure to pick one step at a time and don't unnecessarily complicate this round by asking unwanted questions. Make sure to understand the necessary requirements and code them, then only opt for optional ones.
Started with introduction and previous internship experience. Then shared a Google Docs document which already had a problem statement stated. It's something related to designing a medical store where each medicine has its components and proportions needed in the mixture. Requirements were also given; we have to come up with an approach; no coding is required, only schema is needed. Then discussed the CAP theorem along with why CA is not possible in a distributed environment.
It's something related to designing a medical store where each medicine has its components and the proportion in which the mixture is needed. Requirements are also given; we have to come up with an approach. No coding is required; only a schema is required. Then CAP theorem, along with why CA is not possible in a distributed environment.
Even if you don't know about a particular topic, try to tackle the problem by solving it in pieces. The above problem is solved using graph-based databases like Neo database.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which traversal uses a queue as its primary data structure?