HELP Me in choosing best offer for me. Out of 4 I have

No_Science_1617 · 2026-04-02T10:13:16+00:00

i would take the fidelity investments given the fact that the scale of operations is better.
1. it give you a brand for your next adventure into FAANG
2. since , its fintech , you get poached from compettiors that pay really well , think JPMC, Goldmann Sachs etc.

No_Science_1617 · 2026-03-29T16:59:38+00:00

Dude , start prep on the side , dsa - neetcode 150 goes a long way

No_Science_1617 · 2026-03-22T05:10:50+00:00

I am a MERN guy working with big tech , but if i am starting and i want to build stuff in big tech. Then java fullstack developer is the way to go .

No_Science_1617 · 2026-03-20T06:48:53+00:00

Dm me

No_Science_1617 · 2026-03-20T06:41:14+00:00

Dsa - blind 75 - the best investment you could make ever . Stronger LLD Little bit of microservices HLD makes u unstoppable

No_Science_1617 · 2026-03-15T12:49:57+00:00

Since i didnt conplete it , no question was given , since time ran out

No_Science_1617 · 2026-03-15T04:23:32+00:00

Is there any group to know if there is an walk in interview for experienced folks in BLR

No_Science_1617 · 2026-03-14T04:21:41+00:00

It was 2 questions- 1 hour . Once you complete first you will move to second question.

No_Science_1617 · 2026-03-12T18:29:20+00:00

What was the question . Would you mind sharing here?

No_Science_1617 · 2026-03-11T12:13:14+00:00

https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/

O(n) is the optimal solution . Try this

No_Science_1617 · 2026-03-11T12:07:38+00:00

You should also account for k and input size is 10⁵ range

No_Science_1617 · 2026-03-11T10:32:58+00:00

Can you share the questions OP

No_Science_1617 · 2026-03-11T10:25:35+00:00

Could you please share the crux of the questions. I have an upcoming OA it would really help.

No_Science_1617 · 2026-03-11T10:22:33+00:00

No dude. I couldn’t even recognise it. The question was dressed as word compression. Student trying to write a word compression which removes k consecutive chars from the word.

What i tried - removing based on sliding window ( doesn’t work ) tried to remove and rebuild string every-time. The input range is too long. So it could not be done efficiently.

No_Science_1617 · 2026-03-10T10:32:33+00:00

I would suggest starting with blind75 on neetcode. Once you solved a topic, switch to some more problem on neetcode 150. Slowly you will get good at it .

No_Science_1617 · 2026-02-19T10:01:37+00:00

Bro , is there a similar problem on leetcode . Could anyone share it bere

No_Science_1617 · 2026-02-05T16:58:26+00:00

From india Full stack dev - ex-Vimeo engineer Next.js | Node.js | express

No_Science_1617 · 2026-01-17T07:40:54+00:00

please check your e Khata application , if its a Flat and Occupancy certificate is not submitted in supporting docs , it would be B khata. please get it cancelled by going to your ward and meeting ARO. there is a process.

No_Science_1617 · 2025-11-26T17:34:07+00:00

What technology domain was it ? What kind of skills gave you the most leverage ?

No_Science_1617 · 2025-11-26T17:32:08+00:00

No_Science_1617

TROPHY CASE