# Check whether the binary equivalent of a number ends with given string or not

Given a positive integer N, the task is to check whether the binary equivalent of that integer ends with a given string str or not.
Print “Yes” if it ends in “str”. Otherwise, Print “No”.
Examples:

Input: N = 23, str = “111”
Output: Yes
Explanation:
Binary of 23 = 10111, which ends with “111”

Input: N = 5, str = “111”
Output: No

Approach: The idea is to find the Binary Equivalent of N and check if str is a Suffix of its Binary Equivalent.

Below is the implementation of above approach:

## C++

 `// C++ implementation of the ` `// above approach ` ` `  `#include ` `using` `namespace` `std; ` ` `  `// Function returns true if ` `// s1 is suffix of s2 ` `bool` `isSuffix(string s1, string s2) ` `{ ` `    ``int` `n1 = s1.length(); ` `    ``int` `n2 = s2.length(); ` `    ``if` `(n1 > n2) ` `        ``return` `false``; ` `    ``for` `(``int` `i = 0; i < n1; i++) ` `        ``if` `(s1[n1 - i - 1] != s2[n2 - i - 1]) ` `            ``return` `false``; ` `    ``return` `true``; ` `} ` ` `  `// Function to check if binary equivalent ` `// of a number ends in "111" or not ` `bool` `CheckBinaryEquivalent(``int` `N, string str) ` `{ ` ` `  `    ``// To store the binary ` `    ``// number ` `    ``int` `B_Number = 0; ` `    ``int` `cnt = 0; ` ` `  `    ``while` `(N != 0) { ` ` `  `        ``int` `rem = N % 2; ` `        ``int` `c = ``pow``(10, cnt); ` `        ``B_Number += rem * c; ` `        ``N /= 2; ` ` `  `        ``// Count used to store ` `        ``// exponent value ` `        ``cnt++; ` `    ``} ` ` `  `    ``string bin = to_string(B_Number); ` `    ``return` `isSuffix(str, bin); ` `} ` ` `  `// Driver code ` `int` `main() ` `{ ` ` `  `    ``int` `N = 23; ` `    ``string str = ``"111"``; ` `    ``if` `(CheckBinaryEquivalent(N, str)) ` `        ``cout << ``"Yes"``; ` `    ``else` `        ``cout << ``"No"``; ` ` `  `    ``return` `0; ` `}`

## Java

 `// Java implementation of the  ` `// above approach  ` `class` `GFG{  ` ` `  `// Function returns true if  ` `// s1 is suffix of s2  ` `static` `boolean` `isSuffix(String s1, String s2)  ` `{  ` `    ``int` `n1 = s1.length(),  ` `        ``n2 = s2.length();  ` `         `  `    ``if` `(n1 > n2)  ` `        ``return` `false``;  ` `         `  `    ``for``(``int` `i = ``0``; i < n1; i++)  ` `        ``if` `(s1.charAt(n1 - i - ``1``) !=  ` `            ``s2.charAt(n2 - i - ``1``))  ` `        ``return` `false``;  ` `         `  `    ``return` `true``;  ` `}  ` ` `  `// Function to check if binary equivalent ` `// of a number ends in "111" or not ` `static` `boolean` `CheckBinaryEquivalent(``int` `N, ` `                                     ``String str) ` `{ ` ` `  `    ``// To store the binary ` `    ``// number ` `    ``int` `B_Number = ``0``; ` `    ``int` `cnt = ``0``; ` ` `  `    ``while` `(N != ``0``) ` `    ``{ ` `        ``int` `rem = N % ``2``; ` `        ``int` `c = (``int``)Math.pow(``10``, cnt); ` `        ``B_Number += rem * c; ` `        ``N /= ``2``; ` ` `  `        ``// Count used to store ` `        ``// exponent value ` `        ``cnt++; ` `    ``} ` `     `  `    ``String bin = Integer.toString(B_Number); ` `    ``return` `isSuffix(str, bin); ` `} ` ` `  `// Driver code  ` `public` `static` `void` `main(String[] args)  ` `{  ` `    ``int` `N = ``23``; ` `    ``String str = ``"111"``; ` `     `  `    ``if` `(CheckBinaryEquivalent(N, str)) ` `        ``System.out.print(``"Yes\n"``); ` `    ``else` `        ``System.out.print(``"No\n"``);  ` `}  ` `}  ` ` `  `// This code is contributed by shubham  `

Output:

```Yes
```

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Improved By : shubham prakash 1