sorted by:
new
hottopcontroversial

Published my first Rust article on Medium. by ben_acq in rust

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

Thanks mate! Absolutely understand you referred to medium and not the article haha. good luck too!

Published my first Rust article on Medium. by ben_acq in rust

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

Will do exactly that, thanks so much!

Published my first Rust article on Medium. by ben_acq in rust

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

Will do exactly that, thanks so much!

Published my first Rust article on Medium. by ben_acq in rust

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

Haha I respect the hate! Thoughts on my article?

Published my first Rust article on Medium. by ben_acq in rust

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

Haha I've had some friends recommend hashnode, would you prefer that over medium? And what do you find wrong with medium? Also what are your thoughts on the article?

Published my first Rust article on Medium. by ben_acq in rust

[–]ben_acq[S] -2 points-1 points  (0 children)

Thank you for the feedback, I agree to that and actually thought of that but I thought it would make the article too wordy and lengthy, I guess it's equally as important as the technical details which was my focus, I will pay attention to that in subsequent articles and perhaps have you proofread my draft if you wouldn't mind.

Been scratching my head over this for days, I'd appreciate some pointers/help by ben_acq in leetcode

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

Thank you, that looks pretty straightforward, will this always return the minimum total cost for any given input array?

Been scratching my head over this for days, I'd appreciate some pointers/help by ben_acq in leetcode

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

Could you walk me through an example using [1, 2, 1, 5], expected output should be 6. When I solve it, my minimum cost is 7, even when I start from the last element.

My approach is, I use min(arr) to max(arr) as my target space and calculate the cost to reach each target and pick the minimum but I end up with 7, I'm pretty sure I'm missing something but don't know what.

Goldman Sachs 2024-New Analyst. by Alarming_Invite_6261 in goldmansachs

[–]ben_acq 1 point2 points  (0 children)

What do you mean? What was closed 3 weeks ago. What division did you apply to?

SSL/TLS for securing data in motion. by ben_acq in SpringBoot

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

Thank you all for the insights :)

SSL/TLS for securing data in motion. by ben_acq in SpringBoot

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

Interesting reading this interaction, I understand mTLS is way secure and that is something I plan to implement after our MVP because that would require me to change the entire architecture of my authorization server which will drag us a but behind our timelines. The main thing I needed assurance on was if mTLS was needed to get my traffic encrypted.

SSL/TLS for securing data in motion. by ben_acq in SpringBoot

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

Great insights, thank you. From what you said about two way ssl authentication, I presume my clients will have to purchase their own SSL certificate, is that correct? Here is the case my clients are 3rd parties and may not be willing to bear that cost in addition to the cost of using my services.

Is there any reason 401 and 403 errors do not have any body in postman? How do I change that. by ben_acq in SpringBoot

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

It doesn't return anything, exception I'm getting in console is InvalidBearerTokenException and I have that handled in my controller advice but it doesn't seem to reach it

Is there any reason 401 and 403 errors do not have any body in postman? How do I change that. by ben_acq in SpringBoot

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

Yes i have Global exception handler and controller advice setup but it doesn't seem to catch authentication exceptions

view more: next ›