6. Zigzag Conversion | Leetcode | Medium | Java | String | Google

"Zigzag Conversion" an intermediate-level problem on LeetCode serves as a foundational exercise for developing intuition in problem-solving, particularly for challenges that demand a keen understanding of patterns and logical reasoning. The crux of this question lies in recognizing the strategic necessity of utilizing multiple strings to construct the final string, which represents a sequence of rows. The intricacy of the zigzag pattern introduces the need for a methodical approach, wherein two distinct directions of traversal across the rows play a crucial role.
This problem not only tests one's ability to discern intricate patterns but also demands a strategic mindset to navigate through multiple rows in a zigzag fashion, ultimately leading to a comprehensive and efficient solution.
Link to the question: leetcode.com/problems/zigzag-...
Other problems for practice:
• 417. Pacific Atlantic ...
• 289. Game of Life | Le...
• 211. Design Add and Se...
• 36. Valid Sudoku | Lee...
• 399. Evaluate Division...
• 2332. The Latest Time ...
• 1110. Delete Nodes And...
• 797. All Paths From So...
• Minimum Height Trees |...

[@ShinAkuma]

Good solution. I'd use StringBuilder instead of String wherever lots of manipulation is required. It's faster and consumes less memory since extra objects are not being created every time you add a character.

[@Ybash2979]

i haven't seen much of your content , but the ones seen the solutions are too accurate and easy !!

[@algorithmsbyaditi]

Thank youu !

[@tanaysrivastava9303]

Nice explaination ma'am, but can you further explain the code in upcoming videos ,it would be helpful....

[@algorithmsbyaditi]

Will improve, Thanks.

[@naveennaik3705]

Great video🔥🔥 aapke videos dekh ke Mera DSA mein interest badh raha hai. Keep it up

[@algorithmsbyaditi]

Thank you so much 😊

[@motivationworld27]

Line mar ra hai aap par me bata hu clear aapko improve karna chye apko padhane ka way but knowledge hai apko

[@sushantnand3974]

Neetcode faltu me chada rakha h, 2min me samjhaya didi ne, thankss

[@algorithmsbyaditi]

Thank youu !

[@samchopra100]

Nice explanation! I got an idea from your video that how can we solve it. Optimised your solution to solve it with single iteration. Swift Code: func convert(_ s: String, _ numRows: Int) -> String { guard numRows != 1 else { return s } var temp = [String](repeating: "", count: numRows) var count: Int = 0 for (index, ele) in s.enumerated() { if (index + 1 + count) % numRows == 0 { count += 1 } let isBottom = count % 2 != 0 if isBottom { temp[numRows - 1 - ((index + count) % numRows)] = temp[numRows - 1 - ((index + count) % numRows)] + String(ele) } else { temp[(index + count) % numRows] = temp[(index + count) % numRows] + String(ele) } } return temp.reduce(into: "") { (p , c) in p += c } }

[@algorithmsbyaditi]

Great work !

[@Ayush37262]

Awesome explanation!!! How to think like that? I was solving this question using a matrix and storing every character in it 😢

[@algorithmsbyaditi]

Just need to think that the number of strings to be concatenated is equal to the number of rows.

[@user-of3ss6hb2l]

Great explanation 😮

[@Viratrohit184]

Please make video in English

[@gamewalabhai01]

mene khud ka code banaya alag uska runtime 15ms aa raha hai submit karne per.

[@shivam1gaur]

Radhe Radhe

[@meetpatel2720]

How many leetcode questions are enough for freshers? your linkedin?

[@amanisdreaming3914]

probably 250-300. also depends on your cognitive skills.

[@randomeverything8304]

150 are enough. baaki tension lene se kuch nhi hota. Enjoy life.

[@meetpatel2720]

@@randomeverything8304 gand fati padi he yahape apply karte karte

[@trendingYT80]

Kuch samjh mai nahi aaya jo aap samjha rahe ho

[@kumarshresth7511]

dhyaan thumbnail pe hoga,to kaha se aayega!