"Situation.
Initially, my team consisted of young guys who were hired by team leaders based on hardskills. Previously, the company had just begun the transition from a process-based to a product-based approach. In the process of searching and selecting candidates, the interests of the team and the product owner were not taken into account. The candidate didn't pass a behavioral interview on soft skills. Thus, the team consisted of diverse and talented guys, but not very interested in fast wor"
Anna D. - "Situation.
Initially, my team consisted of young guys who were hired by team leaders based on hardskills. Previously, the company had just begun the transition from a process-based to a product-based approach. In the process of searching and selecting candidates, the interests of the team and the product owner were not taken into account. The candidate didn't pass a behavioral interview on soft skills. Thus, the team consisted of diverse and talented guys, but not very interested in fast wor"See full answer
"Use a representative of each, e.g. sort the string and add it to the value of a hashmap> where we put all the words that belong to the same anagram together."
Gaston B. - "Use a representative of each, e.g. sort the string and add it to the value of a hashmap> where we put all the words that belong to the same anagram together."See full answer
"we can use two pointer + set like maintain i,j and also insert jth character to set like while set size is equal to our window j-i+1 then maximize our answer and increase jth pointer till last index"
Kishor J. - "we can use two pointer + set like maintain i,j and also insert jth character to set like while set size is equal to our window j-i+1 then maximize our answer and increase jth pointer till last index"See full answer
"I want to work at Meta because of its reputation as a company that consistently pushes the boundaries of technology, particularly in areas like AI, machine learning, and immersive technologies such as AR and VR. I admire Meta's mission to bring people closer together and create meaningful connections, as well as its focus on long-term innovation, such as the development of the metaverse.
As an AI engineer, I'm excited about the opportunity to work on cutting-edge projects that have a global impa"
Alan T. - "I want to work at Meta because of its reputation as a company that consistently pushes the boundaries of technology, particularly in areas like AI, machine learning, and immersive technologies such as AR and VR. I admire Meta's mission to bring people closer together and create meaningful connections, as well as its focus on long-term innovation, such as the development of the metaverse.
As an AI engineer, I'm excited about the opportunity to work on cutting-edge projects that have a global impa"See full answer
"I started asking some questions regarding the constrains of the system:
An antena is emitting a signal that says if the tagged device was out of the room where the interview was happening.
I was able to decide which would be the schema for the Antena's message.
The antena is sending the info of multiple users.
The system doesn't need to push notification to the users when the user left the device behind.
Upon reflection, this is what I recollected doing.
I propuse the json schema a"
Eduardo C. - "I started asking some questions regarding the constrains of the system:
An antena is emitting a signal that says if the tagged device was out of the room where the interview was happening.
I was able to decide which would be the schema for the Antena's message.
The antena is sending the info of multiple users.
The system doesn't need to push notification to the users when the user left the device behind.
Upon reflection, this is what I recollected doing.
I propuse the json schema a"See full answer
""""
Delete k th node from from last of LL
"""
from typing import List
class ListNode:
def init(self, val=None, next=None):
self.val = val
self.next = next
def delkthnode(start: ListNode, k: int)->ListNode:
"""
Returns success or failure
"""
have 2 pointers
#fast and slow ptr
we need to delete n-k th node
fast ptr - traverse k step
start slow ptr
remaining steps for fast ptr to cover the end is n-k
tha"
Rego Z. - """"
Delete k th node from from last of LL
"""
from typing import List
class ListNode:
def init(self, val=None, next=None):
self.val = val
self.next = next
def delkthnode(start: ListNode, k: int)->ListNode:
"""
Returns success or failure
"""
have 2 pointers
#fast and slow ptr
we need to delete n-k th node
fast ptr - traverse k step
start slow ptr
remaining steps for fast ptr to cover the end is n-k
tha"See full answer
"In order to earn team members trust you need to show -
1- You need to show them you trust them. Treat others the way you wanted to be treated.
2- Do what you say. Keep commitments.
3- Listen
4- Admit when you make mistakes
5- Consistently make good decisions
"
Ritu G. - "In order to earn team members trust you need to show -
1- You need to show them you trust them. Treat others the way you wanted to be treated.
2- Do what you say. Keep commitments.
3- Listen
4- Admit when you make mistakes
5- Consistently make good decisions
"See full answer
"Question: An array of n integers is given, and a positive integer k, where k << n. k indicates that the absolute difference between each element's current index (icurrent) and the index in the sorted array (isorted) is less than k (|icurr - isorted| < k).
Sort the given array.
The most common solution is with a Heap:
def solution(arr, k):
min_heap = []
result = []
for i in range(len(arr))
heapq.heappush(min_heap, arr[i])
"
Guilherme M. - "Question: An array of n integers is given, and a positive integer k, where k << n. k indicates that the absolute difference between each element's current index (icurrent) and the index in the sorted array (isorted) is less than k (|icurr - isorted| < k).
Sort the given array.
The most common solution is with a Heap:
def solution(arr, k):
min_heap = []
result = []
for i in range(len(arr))
heapq.heappush(min_heap, arr[i])
"See full answer
"bidirectional tranverse - the nearest seller is either on the left or right of each child
1 - tranverse from left to right,always record the latest seller si, and record the left nearest distance ki - si of current kid into leftarray
2 tranverse from right to left,always record the latest seller si, and record the left nearest distance si-ki of current kid into rightarray
3 find the maximum of the min(leftarray[i], rightarray[i]) of each kid
Time complexity: O(N+M) 3 passes of tra"
Yizhi T. - "bidirectional tranverse - the nearest seller is either on the left or right of each child
1 - tranverse from left to right,always record the latest seller si, and record the left nearest distance ki - si of current kid into leftarray
2 tranverse from right to left,always record the latest seller si, and record the left nearest distance si-ki of current kid into rightarray
3 find the maximum of the min(leftarray[i], rightarray[i]) of each kid
Time complexity: O(N+M) 3 passes of tra"See full answer
"The company culture is very supportive and collaborative. Googlers are encouraged to be creative and innovative, and there is a lot of freedom to explore new ideas.
The work is challenging and rewarding. Googlers have the opportunity to work on cutting-edge projects that have a real impact on the world.
The company is committed to diversity and inclusion. Google is a great place to work for people from all backgrounds and with all different perspectives.
I am confident that I would b"
Praful B. - "The company culture is very supportive and collaborative. Googlers are encouraged to be creative and innovative, and there is a lot of freedom to explore new ideas.
The work is challenging and rewarding. Googlers have the opportunity to work on cutting-edge projects that have a real impact on the world.
The company is committed to diversity and inclusion. Google is a great place to work for people from all backgrounds and with all different perspectives.
I am confident that I would b"See full answer
"Scoped out problem constraints - how much data to download, how many computers, and how much time, how you can be detected (decentralized load).
Designed a web crawler."
Faraz A. - "Scoped out problem constraints - how much data to download, how many computers, and how much time, how you can be detected (decentralized load).
Designed a web crawler."See full answer
"find total sum. assign that to rightsum
traverse from left to right: keep updating left sum and right sum, when they match return the index.
else if you reach end return -1 or not found"
Rahul J. - "find total sum. assign that to rightsum
traverse from left to right: keep updating left sum and right sum, when they match return the index.
else if you reach end return -1 or not found"See full answer