SDE - Intern

Initially considered generating all possible subarrays and calculating their sums.
This brute-force approach had O(N²) time complexity and was inefficient.
Observed that extending a subarray with a negative sum only decreases the total.
Applied Kadane’s Algorithm to track the maximum subarray ending at each index.
Maintained two variables: currentSum and maxSum.
At each step, chose the maximum between the current element and extending the previous subarray.
Updated maxSum whenever a higher sum was found.
Final solution runs in O(N) time and O(1) space.

First checked if the lengths of both strings are equal.
If lengths are different, they cannot be anagrams.
Used a frequency array / map to count characters of the first string.
Iterated over the second string and decreased the corresponding character count.
If any count became negative, the strings are not anagrams.
After processing both strings, verified all counts are zero.
This approach runs in O(N) time and uses O(1) space for fixed alphabets.

* First clearly understand the problem and users
* Identify minimum core features (don’t overbuild)
* Think about data needed (users, photos, actions)
* Decide basic flow (login → upload → view)
* Consider privacy and security early
* Separate image storage from metadata
* Think about scaling later, not first
* Handle edge cases(abuse, large uploads)
* Keep solution simple and explainable
* Explain trade-offs, not just choices

* Group the horses so each race gives maximum information
* First find winners inside small groups
* Use early races to eliminate clearly slower horses
* Compare only potential top candidates, not all horses
* Reuse race results to avoid redundant comparisons
* Narrow the problem step by step: 25 → group winners → top contenders
* Final race should involve only horses that can still be in top 3
* Always ask: “Can this horse still be top 3?”
* Stop racing once only 3 possible fastest horses remain

Be honest and consistent with your resume
Don’t blame teammates or tools
Keep answers structured (problem → action → result)
Show growth, curiosity, and maturity

Use simple, everyday comparisons
Avoid technical words and formulas
Explain with stories or objects (coin, light switch)
Compare with something the child already knows
Focus on idea, not accuracy
Keep it short and fun
Use curiosity, not complexity
End with a clear one-line summary