{"status":true,"key":"12090017828306496212","created":"2026-11-06T16:31:13.994Z","expire":"2026-11-20T16:31:13.994Z","title":"Roo Hastebin","data":"# Find First Palindromic String in the Array (LeetCode 2108)\n\nFirst string equal to its reverse.\n\n## Approach\n\n```python\ndef firstPalindrome(words):\n    for w in words:\n        if w == w[::-1]:\n            return w\n    return \"\"\n```\n\n## Complexity\n\n- Time / space depend on the scan above; keep the solution linear when possible.\n\n## Interview tip\n\nNarrate the invariant before coding. I drill these patterns with [Linkjob AI copilot](https://www.linkjob.ai/) ahead of OA rounds.\n\n*Disclosure: I work on Linkjob AI, an interview copilot. The algorithm above stands on its own.*\n"}