AISWARYA ARUN

[AISWARYA ARUN @aishwwaryaaa]

Day 87 of #100DaysOfCode
Solved: Find if Digit Game Can Be Won
Analyzed strategies and conditions to determine the winning chances in a digit-based game.

[AISWARYA ARUN @aishwwaryaaa]

Day 86 of #100DaysOfCode
Solved: 3228. Maximum Number of Operations to Move Ones to the End
Optimized moves to rearrange binary arrays by shifting ones to the end.

[AISWARYA ARUN @aishwwaryaaa]

#leetcode

[AISWARYA ARUN @aishwwaryaaa]

Day 85 of #100DaysOfCode
Solved: Number of Bit Changes to Make Two Integers Equal
Minimized bit changes required for integer transformations.

[AISWARYA ARUN @aishwwaryaaa]

Day 84 of #100DaysOfCode
Solved: Maximum Score From Grid Operations
Maximized scores in grid-based operations with strategic planning.

[AISWARYA ARUN @aishwwaryaaa]

Day 83 of #100DaysOfCode
Solved: Minimum Array Changes to Make Differences Equal
Aligned array elements to achieve uniform differences with minimal changes.

[AISWARYA ARUN @aishwwaryaaa]

Day 82 of #100DaysOfCode
Solved: Minimum Cost for Cutting Cake II
Extended the cake-cutting problem to consider additional constraints.

[AISWARYA ARUN @aishwwaryaaa]

Day 81 of #100DaysOfCode
Solved: Minimum Cost for Cutting Cake I
Calculated the minimum cost of partitioning a cake with optimal cuts.

[AISWARYA ARUN @aishwwaryaaa]

Day 80 of #100DaysOfCode
Solved: Delete Nodes From Linked List Present in Array
Worked on removing specific nodes from linked lists based on array values.

[AISWARYA ARUN @aishwwaryaaa]

Day 79 of #100DaysOfCode
Solved: Minimum Length of String After Operations
Focused on reducing string lengths using operational constraints efficiently.

[AISWARYA ARUN @aishwwaryaaa]

Day 78 of #100DaysOfCode
Solved: Lexicographically Smallest String After a Swap
Mastered string manipulations for lexicographical order post-swap.

[AISWARYA ARUN @aishwwaryaaa]

Day 77 of #100DaysOfCode
Solved: Maximum Points After Enemy Battles
Maximized score strategies in simulated enemy battle scenarios.

[AISWARYA ARUN @aishwwaryaaa]

Day 76 of #100DaysOfCode
Solved: Construct String with Minimum Cost With Equal Frequency of X and Y
Balanced string construction with minimized cost and frequency matching.

[AISWARYA ARUN @aishwwaryaaa]

Day 75 of #100DaysOfCode
Solved: Count Submatrices
Tackled matrix traversal and submatrix counting using dynamic programming.

[AISWARYA ARUN @aishwwaryaaa]

Day 74 of #100DaysOfCode
Solved: Generate Binary Strings Without Adjacent Zeros
Generated unique binary sequences adhering to constraints.

[AISWARYA ARUN @aishwwaryaaa]

Day 73 of #100DaysOfCode
Solved: Number of Subarrays With AND Value of K
Dived into bitwise operations for subarray computations.

[AISWARYA ARUN @aishwwaryaaa]

Day 72 of #100DaysOfCode
Solved: Alternating Groups II ↔️
Explored array grouping and pattern alternations with advanced logic.

[AISWARYA ARUN @aishwwaryaaa]

Day 71 of #100DaysOfCode
Solved: Find the Encrypted String
Worked on encryption algorithms and string manipulations for secure data transmission.

[AISWARYA ARUN @aishwwaryaaa]

Day 70 of #100DaysOfCode
Solved: Find Minimum Diameter After Merging Two Trees
Focused on optimizing tree structures for minimal diameter post-merge.

[AISWARYA ARUN @aishwwaryaaa]

Day 69 of #100DaysOfCode
Worked on "Find Longest Special Substring That Occurs Thrice I" problem today!
#ProblemSolving #LeetCode