Skip to content
Related Articles

Related Articles

Improve Article

Check if a cell can be visited more than once in a String

  • Last Updated : 21 May, 2021

Given a string which consists of either ‘.’ or any number. A ‘.’ in the string means that the cell is empty and if there is a number x in any cell, it means one can move x steps to right or left within the string.
The task is to check if any cell in the string can be visited more than once. If so, print YES otherwise print NO.
Examples: 
 

Input : str = ".2...2.."
Output: YES
The fourth cell can be visited twice. One way to reach 
the fourth cell is from 2nd cell by moving 2 steps to right
and another way to reach fourth cell is by moving 2 steps 
left from cell 6.

Input : str = ".2...1"
Output: NO
None of the cells in the given string 
can be visited more than once.

 

The idea is to take an array visited[] to keep track of the number of times i-th cell of the string can be visited. Now traverse the string and check if the current character is a ‘.’ or a number x . If the current character is a ‘.’ then do nothing otherwise if it is a number then increase the count of visits in the visited array within the range [i-x, i+x] by 1.
Finally, traverse the visited[] array and check if any cell is visited more than once.
Below is the implementation of the above approach: 
 

C++




// C++ program to check if any cell of the
// string can be visited more than once
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to check if any cell can be
// visited more than once
bool checkIfOverlap(string str)
{
    int len = str.length();
 
    // Array to mark cells
    int visited[len + 1] = { 0 };
 
    // Traverse the string
    for (int i = 0; i < len; i++) {
        if (str[i] == '.')
            continue;
 
        // Increase the visit count of the left and right
        // cells within the array which can be visited
        for (int j = max(0, i - str[i]); j <= min(len, i + str[i]); j++)
            visited[j]++;
    }
 
    for (int i = 0; i < len; i++) {
        // If any cell can be visited more than once
        // Return True
        if (visited[i] > 1) {
            return true;
        }
    }
 
    return false;
}
 
// Driver code
int main()
{
    string str = ".2..2.";
 
    if (checkIfOverlap(str))
        cout << "YES";
    else
        cout << "NO";
 
    return 0;
}
Java



// Java program to check if any cell of the
// string can be visited more than once
 
import java.io.*;
 
class GFG {
 
// Function to check if any cell can be
// visited more than once
static boolean checkIfOverlap(String str)
{
    int len = str.length();
 
    // Array to mark cells
    int []visited =  new int[len +1];
 
    // Traverse the string
    for (int i = 0; i < len; i++) {
        if (str.charAt(i)== '.')
            continue;
 
        // Increase the visit count of the left and right
        // cells within the array which can be visited
        for (int j = Math.max(0, i - str.charAt(i)); j <= Math.min(len, i + str.charAt(i)); j++)
            visited[j]++;
    }
 
    for (int i = 0; i < len; i++) {
        // If any cell can be visited more than once
        // Return True
        if (visited[i] > 1) {
            return true;
        }
    }
 
    return false;
}
 
// Driver code
 
    public static void main (String[] args) {
        String str = ".2..2.";
 
    if (checkIfOverlap(str))
        System.out.println("YES");
    else
        System.out.print("NO");
    }
}
 
// This code is contributed by inder_verma..
Python 3



# Python3 program to check if
# any cell of the string can
# be visited more than once
 
# Function to check if any cell
# can be visited more than once
def checkIfOverlap(str) :
 
    length = len(str)
 
    # Array to mark cells
    visited = [0] * (length + 1)
 
    # Traverse the string
    for i in range(length) :
        if str[i] == "." :
            continue
 
        # Increase the visit count
        # of the left and right cells
        # within the array which can
        # be visited
        for j in range(max(0, i - ord(str[i]),
                       min(length, i +
                       ord(str[i])) + 1)) :
            visited[j] += 1
 
    # If any cell can be visited
    # more than once, Return True
    for i in range(length) :
 
        if visited[i] > 1 :
            return True
 
    return False
 
# Driver code    
if __name__ == "__main__" :
 
    str = ".2..2."
 
    if checkIfOverlap(str) :
        print("YES")
                         
    else :
        print("NO")
                     
# This code is contributed
# by ANKITRAI1
C#



// C# program to check if any
// cell of the string can be
// visited more than once
using System;
 
class GFG
{
 
// Function to check if any cell
// can be visited more than once
static bool checkIfOverlap(String str)
{
    int len = str.Length;
 
    // Array to mark cells
    int[] visited = new int[len + 1];
 
    // Traverse the string
    for (int i = 0; i < len; i++)
    {
        if (str[i]== '.')
            continue;
 
        // Increase the visit count of
        // the left and right cells
        // within the array which can be visited
        for (int j = Math.Max(0, i - str[i]);
                 j <= Math.Min(len, i + str[i]); j++)
            visited[j]++;
    }
 
    for (int i = 0; i < len; i++)
    {
        // If any cell can be visited
        // more than once, Return True
        if (visited[i] > 1)
        {
            return true;
        }
    }
 
    return false;
}
 
// Driver code
public static void Main ()
{
    String str = ".2..2.";
 
    if (checkIfOverlap(str))
        Console.Write("YES");
    else
        Console.Write("NO");
}
}
 
// This code is contributed
// by Akanksha Rai(Abby_akku)
PHP



<?php
// PHP program to check if any
// cell of the string can be
// visited more than once
 
// Function to check if any cell
// can be visited more than once
function checkIfOverlap($str)
{
    $len = strlen($str);
 
    // Array to mark cells
    $visited = array_fill(0, $len + 1, NULL);
 
    // Traverse the string
    for ($i = 0; $i < $len; $i++)
    {
        if ($str[$i] == '.')
            continue;
 
        // Increase the visit count of the
        // left and right cells within the
        // array which can be visited
        for ($j = max(0, $i - $str[$i]);
             $j <= min($len, $i + $str[$i]);
             $j++)
            $visited[$j]++;
    }
 
    for ($i = 0; $i < $len; $i++)
    {
        // If any cell can be visited
        // more than once, Return True
        if ($visited[$i] > 1)
        {
            return true;
        }
    }
 
    return false;
}
 
// Driver code
$str = ".2..2.";
 
if (checkIfOverlap($str))
    echo "YES";
else
    echo "NO";
 
// This code is contributed
// by ChitraNayal
?>
Javascript



<script>
 
// JavaScript program to check if any cell of the
// string can be visited more than once
     
    // Function to check if any cell can be
// visited more than once
    function checkIfOverlap(str)
    {
        let len = str.length;
   
    // Array to mark cells
    let visited =  new Array(len +1);
      for(let i=0;i<visited.length;i++)
    {
        visited[i]=0;
    }
     
    // Traverse the string
    for (let i = 0; i < len; i++) {
        if (str[i]== '.')
            continue;
   
        // Increase the visit count of the left and right
        // cells within the array which can be visited
        for (let j = Math.max(0, i - str[i]);
        j <= Math.min(len, i + str[i]); j++)
            visited[j]++;
    }
   
    for (let i = 0; i < len; i++) {
        // If any cell can be visited more than once
        // Return True
        if (visited[i] > 1) {
            return true;
        }
    }
   
    return false;
    }
     
    // Driver code
    let str = ".2..2.";
   
    if (checkIfOverlap(str))
        document.write("YES");
    else
        document.write("NO");
     
 
// This code is contributed by rag2127
 
</script>
Output: 
YES
 



My Personal Notes
arrow_drop_up
Previous
Find the k-th smallest divisor of a natural number N
Next

Placements (On-Campus, Off-Campus and Pool Campus)
Recommended Articles
Page :
Count positions in a chessboard that can be visited by the Queen which are not visited by the King
22, Oct 20
Minimum number of flips required such that the last cell of matrix can be reached from any other cell
18, Nov 20
Maximum of all distances to the nearest 1 cell from any 0 cell in a Binary matrix
04, May 20
Farthest cell from a given cell in a Matrix
22, Jan 21
Count the total number of squares that can be visited by Bishop in one move
05, Feb 19
Check if a Queen can attack a given cell on chessboard
11, Mar 19
Check if any square (with one colored cell) can be divided into two equal parts
13, Oct 18
Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell
14, Apr 20
Maximum cost path in an Undirected Graph such that no edge is visited twice in a row
03, Jul 20
Printing pre and post visited times in DFS of a graph
11, Jan 19
Count of elements in first Array greater than second Array with each element considered only once
07, May 20
Count of substrings in a Binary String that contains more 1s than 0s
20, Jul 21
C++ Program for GCD of more than two (or array) numbers
27, Mar 17
Prefixes with more a than b
21, May 18
Element which occurs consecutively in a given subarray more than or equal to K times
19, Jul 18
Remove elements from the array which appear more than k times
10, Nov 18
Ways to place 4 items in n^2 positions such that no row/column contains more than one
05, Mar 19
Print all array elements appearing more than N / K times
11, Dec 20
Minimize remaining array element by repeatedly replacing pairs by half of one more than their sum
09, Nov 20
Count of Numbers in Range where the number does not contain more than K non zero digits
27, Dec 18
How to store a very large number of more than 100 digits in C++
13, Jul 20
Smallest substring occurring only once in a given string
04, Mar 21
Find if string is K-Palindrome or not using all characters exactly once
24, Apr 20
Modify the string such that it contains all vowels at least once
25, Oct 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Bhashkar_P
@Bhashkar_P
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox