Two Pointers/Easy

Valid PalindromeFREE TRACK

Time: O(N)Space: O(1)

Array is sorted. Set left pointer L=0 (val 1) and right pointer R=4 (val 1).

Array Elements & Pointers

[1]

[2]

[3]

Live Variables & Invariants

target:4

left:0

right:4

sum:2

Step 1 / 714%

Solution Code

function isPalindrome(s: string): boolean {

  let l = 0, r = s.length - 1;

  while (l < r) {

    if (s[l] !== s[r]) return false;

    l++; r--;

  return true;

Input your custom values and visualize step-by-step trace

Array Input (comma separated):

Target Number:

Quick Presets:

Contextual Tutor for Valid Palindrome

Hello! I am your AI DSA Tutor for **Valid Palindrome** (Two Pointers). Ask me anything about this algorithm, time complexity, or request a step hint!