"A clarifying question: Is this question asking about when I met a tight deadline in a project or how did I manage a project that had a tight deadline?
The answer uploaded to this question is good, I would also add 'creating a critical path from overall project schedule and then making sure that none of the deliverables in the critical path are sacrificed in order to meet the tight deadline' as an action taken."
Ushita S. - "A clarifying question: Is this question asking about when I met a tight deadline in a project or how did I manage a project that had a tight deadline?
The answer uploaded to this question is good, I would also add 'creating a critical path from overall project schedule and then making sure that none of the deliverables in the critical path are sacrificed in order to meet the tight deadline' as an action taken."See full answer
"As you know, this is the most important question for any interview. Here is a structure I like to follow,
Start with 'I'm currently a SDE/PM/TPM etc with XYZ company.... '
Mention how you got into PM/TPM/SDE field (explaining your journey)
Mention 1 or 2 accomplishments
Mention what you do outside work (blogging, volunteer etc)
Share why are you looking for a new role
Ask the interviewer if they have any questions or will like to dive deep into any of your experience"
Bipin R. - "As you know, this is the most important question for any interview. Here is a structure I like to follow,
Start with 'I'm currently a SDE/PM/TPM etc with XYZ company.... '
Mention how you got into PM/TPM/SDE field (explaining your journey)
Mention 1 or 2 accomplishments
Mention what you do outside work (blogging, volunteer etc)
Share why are you looking for a new role
Ask the interviewer if they have any questions or will like to dive deep into any of your experience"See full answer
"As a postgraduate student of computer science, one of my weaknesses might be that I sometimes focus too much on theoretical concepts, which can lead to delays in practical implementation. I also find that while I’m strong in certain areas like algorithms and data structures, I need to spend more time refining my skills in newer technologies or languages that aren't part of the core curriculum. Additionally, balancing research, coursework, and any side projects can be challenging, occasionally le"
Vipan K. - "As a postgraduate student of computer science, one of my weaknesses might be that I sometimes focus too much on theoretical concepts, which can lead to delays in practical implementation. I also find that while I’m strong in certain areas like algorithms and data structures, I need to spend more time refining my skills in newer technologies or languages that aren't part of the core curriculum. Additionally, balancing research, coursework, and any side projects can be challenging, occasionally le"See full answer
"Clarifying my assumptions first, i.e. "Technical contributions are not just writing or reviewing code".
Answer :
My contributions to any program I lead as a TPM are as follows :
Inputs towards design, architecture review, mapping requirements to the proposed design, reviewing the implementation strategy w.r.t scalable solution, Writing core user-centric test scenarios, Validating proposed design vs implementation estimates vs initial planning. etc...
Example :
Situation: We are a"
DM - "Clarifying my assumptions first, i.e. "Technical contributions are not just writing or reviewing code".
Answer :
My contributions to any program I lead as a TPM are as follows :
Inputs towards design, architecture review, mapping requirements to the proposed design, reviewing the implementation strategy w.r.t scalable solution, Writing core user-centric test scenarios, Validating proposed design vs implementation estimates vs initial planning. etc...
Example :
Situation: We are a"See full answer
"Binary search is commonly used for searching elements in a sorted array. Most searching algorithms take O(n) time, but binary search operates in O(log(n)) time complexity.
function binarySearch(arr, target) {
let first = 0;
let last = arr.length - 1; // Adjusted to correctly represent the last index
while (first target) {
last = mid - 1;
}
"
Satyam S. - "Binary search is commonly used for searching elements in a sorted array. Most searching algorithms take O(n) time, but binary search operates in O(log(n)) time complexity.
function binarySearch(arr, target) {
let first = 0;
let last = arr.length - 1; // Adjusted to correctly represent the last index
while (first target) {
last = mid - 1;
}
"See full answer
Asked at 
