Скачать или смотреть 838. Push Dominoes | Leetcode Daily 2 May 2025 | Java | Hindi

"838. Push Dominoes" is a medium-level problem and the LeetCode daily challenge (POTD) for 2 May 2025. The solution, written in Java, is explained with a dry-run on a blackboard, making it accessible to viewers with diverse programming backgrounds by focusing on the logic rather than language-specific details.

Intuition:
The problem involves simulating how dominoes fall over time based on their initial configuration. Each domino can either fall left (L), fall right (R), or remain upright (.). When a domino falls, it affects adjacent dominoes, and the goal is to compute the final state after all movements stabilize. A brute-force simulation would take multiple passes, but we can solve this efficiently in a single pass by analyzing segments between two non-dot characters.

We scan the string left to right, keeping track of the last non-dot character (L or R) and how many dots (.) we've seen since then. Depending on the combination of the last direction and the current direction, we fill in the segment:

If both sides are the same (RR or LL), all the dots in between fall in that direction.

If it's LR, the dots in between stay upright.

If it's RL, the forces meet in the middle — half fall right, half fall left, and if the number is odd, one remains upright in the center.
This greedy simulation avoids unnecessary time steps, giving us an efficient O(n) solution.

Link to the problem: https://leetcode.com/problems/push-do...

Link to the Java Code: https://github.com/AditiChourasia/Lee...

For doubts/queries, please reach out on [email protected]
Connect with me on Linkedin:   / aditi-chourasia-a2a572121  

Other problems for practice:

   • 2071. Maximum Number of Tasks You Can Assi...  
   • 1295. Find Numbers with Even Number of Dig...  
   • 2302. Count Subarrays With Score Less Than...  
   • 3392. Count Subarrays of Length Three With...  
   • 2444. Count Subarrays With Fixed Bounds | ...  
   • 2845. Count of Interesting Subarrays | Lee...  
   • 2799. Count Complete Subarrays in an Array...  
   • 1399. Count Largest Group | Leetcode Daily...  

#leetcodejava #leetcode #dailychallenge #potd #hindi