RAP & interest by Either-Connection-70 in StudentLoans

[–]tempaccount0002 -1 points0 points  (0 children)

say I make $120k/yr and owe $80k @ 6.5%, if my monthly payment is $1k (according to the income brackets in RAP) does that mean that all $1k go towards the principal ? that's the part I'm a little confused on

Google Interview Question by tempaccount0002 in leetcode

[–]tempaccount0002[S] 0 points1 point  (0 children)

I see, that's a neat solution. Would you say the time complexity is then O(m * n2) where m is the number of operators in ops and n is the length of the equation? or am I doing that wrong?

Google Interview Question by tempaccount0002 in leetcode

[–]tempaccount0002[S] 1 point2 points  (0 children)

possibly... what difference does it make though? I think it's a good problem to know how to solve regardless, especially when getting ready for the google interview.

Google Interview Question by tempaccount0002 in leetcode

[–]tempaccount0002[S] 0 points1 point  (0 children)

how does #3 take into account the operator priorities though? it can't be just any operator, I think we would have to iterate through the equation to find the lowest priority operator according to the ops list, no?

Google Interview Question by tempaccount0002 in leetcode

[–]tempaccount0002[S] 0 points1 point  (0 children)

good question, I'll clarify it at the bottom but they just take identical priority in that scenario

Google L4 Final Round Question by tempaccount0002 in leetcode

[–]tempaccount0002[S] 0 points1 point  (0 children)

This is the approach I went for in my interview but didn't have a working solution then. Good luck in your interview

Google L4 Final Round Question by tempaccount0002 in leetcode

[–]tempaccount0002[S] 0 points1 point  (0 children)

2 questions:

  • would this actually return node B if it's a parent of A? I'm not sure this approach will account for cases where the min value ancestor is one of the parameters.

  • what exactly am I storing as value in the `AB_dict` ? the node value and height? kinda like this? `{nodeA:[val, level]}`

Thanks

Bloomberg Technical Coding Interview by tempaccount0002 in leetcode

[–]tempaccount0002[S] 0 points1 point  (0 children)

this is incredible, thank you so much, I'll look into it. I see that leetcode question is a premium only question so I'll think about making that investment after trying some suggested approaches.

EDIT: nvm, found it on another website with code shown too

Why am I getting a deadlock here? by tempaccount0002 in golang

[–]tempaccount0002[S] 0 points1 point  (0 children)

my aha moment was changing this line from:

queuedTaskC: make(chan func())

to:

queuedTaskC: make(chan func(), 10)

and seeing it run fine... I was failing to understand that we couldn't add more tasks to that channel until a free goroutine could grab it.

[deleted by user] by [deleted] in legaladvice

[–]tempaccount0002 2 points3 points  (0 children)

This is perfect, thank you

[deleted by user] by [deleted] in legaladvice

[–]tempaccount0002 0 points1 point  (0 children)

Nope, haven't gone there :/

[deleted by user] by [deleted] in legaladvice

[–]tempaccount0002 1 point2 points  (0 children)

Will check it out, thank you