u/Flat-Ad7982

Helloo guys I recently had a palm reading and the reader said Mars control every line on my palm. Be it impatience, impulsivity, intolerance, frustration, jealousy, and all the levels of wrath from annoyance and eye rolls to fury steal my energy (a finite commodity) to do damage.
Im trying to understand how can I fix these issues and would love if yall could suggest some remedies for it

A random unknown added my friend and took public profile pics of her and morphed it into videos and images(sexual ones yes), I know the correct course of action is to block them but i fear if he finds mutuals of my friend he would start sending it to them. I want to ask is there a way to prevent the guy from finding her mutuals after blocking him?
And also i want to mention that he isnt even from our country

My friend added a guy on snapchat(complete random not even from our country) and then he later morphed her pics into nude images and videos, how should we deal with this? He said he would leak it. Im down to tell more details about the whole situation. Should we just block him and move on? If yes how can i convince my friend to block him without having to negotiate?

My friend added a guy on snapchat(complete random not even from our country) and then he later morphed her pics into nude images and videos, how should we deal with this? He said he would leak it. Im down to tell more details about the whole situation. Should we just block him and move on? If yes how can i convince my friend to block him without having to negotiate?

Hey everyone,

After months of putting it off and after GATE is done without much success, I’m officially starting my LeetCode journey with the NeetCode 150 list.

Here's where I'm at:

• I know most DSA concepts (arrays, trees, graphs, backtracking, DP, etc.) at an abstract/theoretical level – how they work, trade-offs, complexity analysis, when to apply which.
• But when I sit down to actually code them out from scratch? Complete mental block. I understand the algorithm, but translating it into working code is a struggle.

So basically: I can explain merge sort or BFS on a whiteboard, but ask me to implement it without a reference, and I freeze.

For those who’ve been through this phase:

1. How did you bridge the gap between knowing an algorithm and coding it reliably?
2. Do you recommend writing pseudocode first, or just brute-force trying to write real code even if it's broken?
3. Any specific strategies to avoid immediately peeking at solutions when I get stuck?
4. Should I start with easier problems (Arrays, Two Pointers, etc.) to build muscle memory, or follow NeetCode 150 in order?

Hey everyone,

After months of putting it off, I’m officially starting my LeetCode journey with the NeetCode 150 list.

Here's where I'm at:

• I know most DSA concepts (arrays, trees, graphs, backtracking, DP, etc.) at an abstract/theoretical level – how they work, trade-offs, complexity analysis, when to apply which.
• But when I sit down to actually code them out from scratch? Complete mental block. I understand the algorithm, but translating it into working code is a struggle.

So basically: I can explain merge sort or BFS on a whiteboard, but ask me to implement it without a reference, and I freeze.

For those who’ve been through this phase:

1. How did you bridge the gap between knowing an algorithm and coding it reliably?
2. Do you recommend writing pseudocode first, or just brute-force trying to write real code even if it's broken?
3. Any specific strategies to avoid immediately peeking at solutions when I get stuck?
4. Should I start with easier problems (Arrays, Two Pointers, etc.) to build muscle memory, or follow NeetCode 150 in order?

Hey everyone,

After months of putting it off, I’m officially starting my LeetCode journey with the NeetCode 150 list.

Here's where I'm at:

• I know most DSA concepts (arrays, trees, graphs, backtracking, DP, etc.) at an abstract/theoretical level – how they work, trade-offs, complexity analysis, when to apply which.
• But when I sit down to actually code them out from scratch? Complete mental block. I understand the algorithm, but translating it into working code is a struggle.

So basically: I can explain merge sort or BFS on a whiteboard, but ask me to implement it without a reference, and I freeze.

For those who’ve been through this phase:

1. How did you bridge the gap between knowing an algorithm and coding it reliably?
2. Do you recommend writing pseudocode first, or just brute-force trying to write real code even if it's broken?
3. Any specific strategies to avoid immediately peeking at solutions when I get stuck?
4. Should I start with easier problems (Arrays, Two Pointers, etc.) to build muscle memory, or follow NeetCode 150 in order?

Hey everyone,

After months of putting it off, I’m officially starting my LeetCode journey with the NeetCode 150 list.

Here's where I'm at:

• I know most DSA concepts (arrays, trees, graphs, backtracking, DP, etc.) at an abstract/theoretical level – how they work, trade-offs, complexity analysis, when to apply which.
• But when I sit down to actually code them out from scratch? Complete mental block. I understand the algorithm, but translating it into working code is a struggle.

So basically: I can explain merge sort or BFS on a whiteboard, but ask me to implement it without a reference, and I freeze.

For those who’ve been through this phase:

1. How did you bridge the gap between knowing an algorithm and coding it reliably?
2. Do you recommend writing pseudocode first, or just brute-force trying to write real code even if it's broken?
3. Any specific strategies to avoid immediately peeking at solutions when I get stuck?
4. Should I start with easier problems (Arrays, Two Pointers, etc.) to build muscle memory, or follow NeetCode 150 in order?

Hey everyone,

After months of putting it off, I’m officially starting my LeetCode journey with the NeetCode 150 list.

Here's where I'm at:

• I know most DSA concepts (arrays, trees, graphs, backtracking, DP, etc.) at an abstract/theoretical level – how they work, trade-offs, complexity analysis, when to apply which.
• But when I sit down to actually code them out from scratch? Complete mental block. I understand the algorithm, but translating it into working code is a struggle.

So basically: I can explain merge sort or BFS on a whiteboard, but ask me to implement it without a reference, and I freeze.

For those who’ve been through this phase:

1. How did you bridge the gap between knowing an algorithm and coding it reliably?
2. Do you recommend writing pseudocode first, or just brute-force trying to write real code even if it's broken?
3. Any specific strategies to avoid immediately peeking at solutions when I get stuck?
4. Should I start with easier problems (Arrays, Two Pointers, etc.) to build muscle memory, or follow NeetCode 150 in order?

Hey everyone,

After months of putting it off, I’m officially starting my LeetCode journey with the NeetCode 150 list.

Here's where I'm at:

• I know most DSA concepts (arrays, trees, graphs, backtracking, DP, etc.) at an abstract/theoretical level – how they work, trade-offs, complexity analysis, when to apply which.
• But when I sit down to actually code them out from scratch? Complete mental block. I understand the algorithm, but translating it into working code is a struggle.

So basically: I can explain merge sort or BFS on a whiteboard, but ask me to implement it without a reference, and I freeze.

For those who’ve been through this phase:

1. How did you bridge the gap between knowing an algorithm and coding it reliably?
2. Do you recommend writing pseudocode first, or just brute-force trying to write real code even if it's broken?
3. Any specific strategies to avoid immediately peeking at solutions when I get stuck?
4. Should I start with easier problems (Arrays, Two Pointers, etc.) to build muscle memory, or follow NeetCode 150 in order?

Hey everyone,

After months of putting it off, I’m officially starting my LeetCode journey with the NeetCode 150 list.

Here's where I'm at:

• I know most DSA concepts (arrays, trees, graphs, backtracking, DP, etc.) at an abstract/theoretical level – how they work, trade-offs, complexity analysis, when to apply which.
• But when I sit down to actually code them out from scratch? Complete mental block. I understand the algorithm, but translating it into working code is a struggle.

So basically: I can explain merge sort or BFS on a whiteboard, but ask me to implement it without a reference, and I freeze.

For those who’ve been through this phase:

1. How did you bridge the gap between knowing an algorithm and coding it reliably?
2. Do you recommend writing pseudocode first, or just brute-force trying to write real code even if it's broken?
3. Any specific strategies to avoid immediately peeking at solutions when I get stuck?
4. Should I start with easier problems (Arrays, Two Pointers, etc.) to build muscle memory, or follow NeetCode 150 in order?

Hey everyone,

After months of putting it off, I’m officially starting my LeetCode journey with the NeetCode 150 list.

Here's where I'm at:

• I know most DSA concepts (arrays, trees, graphs, backtracking, DP, etc.) at an abstract/theoretical level – how they work, trade-offs, complexity analysis, when to apply which.
• But when I sit down to actually code them out from scratch? Complete mental block. I understand the algorithm, but translating it into working code is a struggle.

So basically: I can explain merge sort or BFS on a whiteboard, but ask me to implement it without a reference, and I freeze.

For those who’ve been through this phase:

1. How did you bridge the gap between knowing an algorithm and coding it reliably?
2. Do you recommend writing pseudocode first, or just brute-force trying to write real code even if it's broken?
3. Any specific strategies to avoid immediately peeking at solutions when I get stuck?
4. Should I start with easier problems (Arrays, Two Pointers, etc.) to build muscle memory, or follow NeetCode 150 in order?

Hey everyone,

After months of putting it off, I’m officially starting my LeetCode journey with the NeetCode 150 list.

Here's where I'm at:

• I know most DSA concepts (arrays, trees, graphs, backtracking, DP, etc.) at an abstract/theoretical level – how they work, trade-offs, complexity analysis, when to apply which.
• But when I sit down to actually code them out from scratch? Complete mental block. I understand the algorithm, but translating it into working code is a struggle.

So basically: I can explain merge sort or BFS on a whiteboard, but ask me to implement it without a reference, and I freeze.

For those who’ve been through this phase:

1. How did you bridge the gap between knowing an algorithm and coding it reliably?
2. Do you recommend writing pseudocode first, or just brute-force trying to write real code even if it's broken?
3. Any specific strategies to avoid immediately peeking at solutions when I get stuck?
4. Should I start with easier problems (Arrays, Two Pointers, etc.) to build muscle memory, or follow NeetCode 150 in order?

Hey everyone,

After months of putting it off, I’m officially starting my LeetCode journey with the NeetCode 150 list.

Here's where I'm at:

• I know most DSA concepts (arrays, trees, graphs, backtracking, DP, etc.) at an abstract/theoretical level – how they work, trade-offs, complexity analysis, when to apply which.
• But when I sit down to actually code them out from scratch? Complete mental block. I understand the algorithm, but translating it into working code is a struggle.

So basically: I can explain merge sort or BFS on a whiteboard, but ask me to implement it without a reference, and I freeze.

For those who’ve been through this phase:

1. How did you bridge the gap between knowing an algorithm and coding it reliably?
2. Do you recommend writing pseudocode first, or just brute-force trying to write real code even if it's broken?
3. Any specific strategies to avoid immediately peeking at solutions when I get stuck?
4. Should I start with easier problems (Arrays, Two Pointers, etc.) to build muscle memory, or follow NeetCode 150 in order?

Hey everyone,

I have an upcoming in-person test for Infosys (second round) and I'm trying to figure out the best way to prepare. I've seen mixed information online and wanted to get some clarity from those who have recently been through the process.

My main questions:

1. What specific topics should I focus on for the second round? I've heard it includes coding problems, but what difficulty level - easy, medium, hard? Are we talking arrays, strings, recursion, DP, graphs, or something else?
2. Which programming language is best/safest to use? I'm comfortable with Python and Java - which one do they expect or allow? Any restrictions?
3. Where should I study from? Any specific resources, YouTube channels, or practice platforms that closely match Infosys question patterns?

If anyone has recently given the second round please share your experience. What kind of questions were asked? How many did you solve to get shortlisted?

Thanks in advance!

Hey everyone,

I have an upcoming in-person test for Infosys (second round) and I'm trying to figure out the best way to prepare. I've seen mixed information online and wanted to get some clarity from those who have recently been through the process.

My main questions:

1. What specific topics should I focus on for the second round? I've heard it includes coding problems, but what difficulty level - easy, medium, hard? Are we talking arrays, strings, recursion, DP, graphs, or something else?
2. Which programming language is best/safest to use? I'm comfortable with Python and Java - which one do they expect or allow? Any restrictions?
3. Where should I study from? Any specific resources, YouTube channels, or practice platforms that closely match Infosys question patterns?

If anyone has recently given the second round please share your experience. What kind of questions were asked? How many did you solve to get shortlisted?

Thanks in advance!

Hey everyone,

I have an upcoming in-person test for Infosys (second round) and I'm trying to figure out the best way to prepare. I've seen mixed information online and wanted to get some clarity from those who have recently been through the process.

My main questions:

1. What specific topics should I focus on for the second round? I've heard it includes coding problems, but what difficulty level - easy, medium, hard? Are we talking arrays, strings, recursion, DP, graphs, or something else?
2. Which programming language is best/safest to use? I'm comfortable with Python and Java - which one do they expect or allow? Any restrictions?
3. Where should I study from? Any specific resources, YouTube channels, or practice platforms that closely match Infosys question patterns?

If anyone has recently given the second round please share your experience. What kind of questions were asked? How many did you solve to get shortlisted?

Thanks in advance!

Hey everyone,

I have an upcoming in-person test for Infosys (second round) and I'm trying to figure out the best way to prepare. I've seen mixed information online and wanted to get some clarity from those who have recently been through the process.

My main questions:

1. What specific topics should I focus on for the second round? I've heard it includes coding problems, but what difficulty level - easy, medium, hard? Are we talking arrays, strings, recursion, DP, graphs, or something else?
2. Which programming language is best/safest to use? I'm comfortable with Python and Java - which one do they expect or allow? Any restrictions?
3. Where should I study from? Any specific resources, YouTube channels, or practice platforms that closely match Infosys question patterns?

If anyone has recently given the second round please share your experience. What kind of questions were asked? How many did you solve to get shortlisted?

Thanks in advance!

Hey everyone,

I have an upcoming in-person test for Infosys (second round) and I'm trying to figure out the best way to prepare. I've seen mixed information online and wanted to get some clarity from those who have recently been through the process.

My main questions:

1. What specific topics should I focus on for the second round? I've heard it includes coding problems, but what difficulty level - easy, medium, hard? Are we talking arrays, strings, recursion, DP, graphs, or something else?
2. Which programming language is best/safest to use? I'm comfortable with Python and Java - which one do they expect or allow? Any restrictions?
3. Where should I study from? Any specific resources, YouTube channels, or practice platforms that closely match Infosys question patterns?

If anyone has recently given the second round please share your experience. What kind of questions were asked? How many did you solve to get shortlisted?

Thanks in advance!