"class Solution:
def lengthOfLIS(self, nums: List[int]) -> int:
temp = [nums[0]]
for num in nums:
if temp[-1]< num:
temp.append(num)
else:
index = bisect_left(temp,num)
temp[index] = num
return len(temp)
"
Mahima M. - "class Solution:
def lengthOfLIS(self, nums: List[int]) -> int:
temp = [nums[0]]
for num in nums:
if temp[-1]< num:
temp.append(num)
else:
index = bisect_left(temp,num)
temp[index] = num
return len(temp)
"See full answer
"
The Situation
A few months ago, our trading platform started experiencing significant latency issues during peak trading hours. This latency was affecting our ability to process real-time market data and execute trades efficiently, potentially leading to substantial financial losses and missed opportunities.
Identifying the Problem
The first step was to identify the root cause of the latency. I organized a team meeting with our data engineers, DevOps, and network specialists to gather"
Scott S. - "
The Situation
A few months ago, our trading platform started experiencing significant latency issues during peak trading hours. This latency was affecting our ability to process real-time market data and execute trades efficiently, potentially leading to substantial financial losses and missed opportunities.
Identifying the Problem
The first step was to identify the root cause of the latency. I organized a team meeting with our data engineers, DevOps, and network specialists to gather"See full answer
Machine Learning Engineer
Behavioral
+3 more
🧠Want an expert answer to a question? Saving questions lets us know what content to make next.
"You can ask some clarifying questions like
1) Ask if the list is already sorted or not
2) is zero included in the list ?
3) Natural numbers are usually positive numbers ( clarify they are non negatives)
Solution :
1) If sorted use two pointers and sort them in O(N)
2) if not sorted , -ve / only +ve numbers in the list doesn't matter - the easiest solution is
Use a priority queue and push the number and its square in each iteration
Finally return the list returned by the priority Queue. N"
Bless M. - "You can ask some clarifying questions like
1) Ask if the list is already sorted or not
2) is zero included in the list ?
3) Natural numbers are usually positive numbers ( clarify they are non negatives)
Solution :
1) If sorted use two pointers and sort them in O(N)
2) if not sorted , -ve / only +ve numbers in the list doesn't matter - the easiest solution is
Use a priority queue and push the number and its square in each iteration
Finally return the list returned by the priority Queue. N"See full answer
"in simple words, linear regression helps in predicting the value whereas logistics regression helps in predicting the binary classification.
But lets talk through some example
Linear regression model: E-commerce website pricing recommendation engine is built on linear regression model where we do have some variables such as competitor price, internal economics and consumer demand etc when we put this in a supervised learning model, it helps in predicting prices
Logistics regression model"
Anonymous Aardvark - "in simple words, linear regression helps in predicting the value whereas logistics regression helps in predicting the binary classification.
But lets talk through some example
Linear regression model: E-commerce website pricing recommendation engine is built on linear regression model where we do have some variables such as competitor price, internal economics and consumer demand etc when we put this in a supervised learning model, it helps in predicting prices
Logistics regression model"See full answer
"this assumes that the dependency among courses is in a growing order:
0 -> 1 -> 2 -> ...
if not, then the code will not work"
Gabriele G. - "this assumes that the dependency among courses is in a growing order:
0 -> 1 -> 2 -> ...
if not, then the code will not work"See full answer
"
Functional Requirements
Content Ingestion\:
Ingest news articles from various sources (websites, social media, etc.).
Handle different types of content (text, images, videos).
Content Analysis\:
Extract and preprocess text from articles.
Analyze the content for potential indicators of fake news.
Model Training and Prediction\:
Use machine learning models to classify content as fake or real.
Continuously improve models with new data and f"
Scott S. - "
Functional Requirements
Content Ingestion\:
Ingest news articles from various sources (websites, social media, etc.).
Handle different types of content (text, images, videos).
Content Analysis\:
Extract and preprocess text from articles.
Analyze the content for potential indicators of fake news.
Model Training and Prediction\:
Use machine learning models to classify content as fake or real.
Continuously improve models with new data and f"See full answer
"There are couple of reasons for it -
Kind of role : Its a product manager role loaded with analytical work, So working with data in stringent regulatory guideline make it more exciting and thrilling.
Location & industry is like - Cherry on the cake, Bangalore weather and BFI is at its all time peak as people spending behavior is changing continuously, it will be interesting to see big giants like visa are managing it."
Nidhi S. - "There are couple of reasons for it -
Kind of role : Its a product manager role loaded with analytical work, So working with data in stringent regulatory guideline make it more exciting and thrilling.
Location & industry is like - Cherry on the cake, Bangalore weather and BFI is at its all time peak as people spending behavior is changing continuously, it will be interesting to see big giants like visa are managing it."See full answer
"Initialize left pointer: Set a left pointer left to 0.
Iterate through the array: Iterate through the array from left to right.
If the current element is not 0, swap it with the element at the left pointer and increment left.
Time complexity: O(n). The loop iterates through the entire array once, making it linear time.
Space complexity: O(1). The algorithm operates in-place, modifying the input array directly without using additional data structures.
"
Avon T. - "Initialize left pointer: Set a left pointer left to 0.
Iterate through the array: Iterate through the array from left to right.
If the current element is not 0, swap it with the element at the left pointer and increment left.
Time complexity: O(n). The loop iterates through the entire array once, making it linear time.
Space complexity: O(1). The algorithm operates in-place, modifying the input array directly without using additional data structures.
"See full answer
"Sharing the approach for functional requirements we tool to solve this question.
Functional Requirements
This is only for the Registered users
What is a "For You" page ?
Home page where you get suggestions based on
people you follow.
Interactions
like/share/comments (done by user)
Interests (shared by the user during registration or onboarding)
sports choices/ region choices/
Video sharing platform.
So how many videos should we s"
Anonymous Hare - "Sharing the approach for functional requirements we tool to solve this question.
Functional Requirements
This is only for the Registered users
What is a "For You" page ?
Home page where you get suggestions based on
people you follow.
Interactions
like/share/comments (done by user)
Interests (shared by the user during registration or onboarding)
sports choices/ region choices/
Video sharing platform.
So how many videos should we s"See full answer
"FN
Given text need to figure out is it following guidelines.
Should notify the user in case of not following guidelines.
Reason for failure
should have misleading/spam/adult filters.
NFN
High availability
High Scalability
Low latency of processing
Estimations
1M requests/min
text - 10kb => 9.5GB/min => 14TB/day
API
fetchmoderationscore(text)
score will be between 0 to 1
more than 0.8 => not following guidelines
fetchmoderationscore(text, filter)"
Deepak K. - "FN
Given text need to figure out is it following guidelines.
Should notify the user in case of not following guidelines.
Reason for failure
should have misleading/spam/adult filters.
NFN
High availability
High Scalability
Low latency of processing
Estimations
1M requests/min
text - 10kb => 9.5GB/min => 14TB/day
API
fetchmoderationscore(text)
score will be between 0 to 1
more than 0.8 => not following guidelines
fetchmoderationscore(text, filter)"See full answer
"Is it bad to get the answer a different way? Will they mark that as not knowing Bayes Theorem or just correct as it is an easier way to get the answer?
The way I went is to look at what happens when the factory makes 100 light bulbs. Machine A makes 60 of which 3 are faulty, Machine B makes 40 of which 1.2 are faulty. Therefore the pool of faulty lightbulbs is 3/4.2 = 5/7 from machine A and 1.2/4.2 = 3/7 from Machine B."
Will I. - "Is it bad to get the answer a different way? Will they mark that as not knowing Bayes Theorem or just correct as it is an easier way to get the answer?
The way I went is to look at what happens when the factory makes 100 light bulbs. Machine A makes 60 of which 3 are faulty, Machine B makes 40 of which 1.2 are faulty. Therefore the pool of faulty lightbulbs is 3/4.2 = 5/7 from machine A and 1.2/4.2 = 3/7 from Machine B."See full answer
"First of all, stack and heap memory are abstraction on top of the hardware by the compiler. The hardware is not aware of stack and heap memory. There is only a single piece of memory that a program has access to. The compiler creates the concepts of stack and heap memory to run the programs efficiently.
Programs use stack memory to store local variables and a few important register values such as frame pointer and return address for program counter. This makes it easier for the compiler to gene"
Stanley Y. - "First of all, stack and heap memory are abstraction on top of the hardware by the compiler. The hardware is not aware of stack and heap memory. There is only a single piece of memory that a program has access to. The compiler creates the concepts of stack and heap memory to run the programs efficiently.
Programs use stack memory to store local variables and a few important register values such as frame pointer and return address for program counter. This makes it easier for the compiler to gene"See full answer
"There is a faster approach that solves the problem in O(n) time:
def find_duplicates(arr1, arr2):
arr1 = set(arr1)
res = []
for num in arr2:
if num in arr1:
res.append(num)
return res
`"
Victor H. - "There is a faster approach that solves the problem in O(n) time:
def find_duplicates(arr1, arr2):
arr1 = set(arr1)
res = []
for num in arr2:
if num in arr1:
res.append(num)
return res
`"See full answer