Skip to content

Create Sagato_distinct #114

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
SagatoSamanta wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Create Sagato_distinct #114

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
6c9f66c
Create Sagato_distinct
SagatoSamanta Oct 29, 2023
1d47802
Update Sagato_distinct
SagatoSamanta Oct 29, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 31 additions & 0 deletions Sagato_distinct
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
import java.util.*;
class distict
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String s = sc.nextLine();
Solution ob = new Solution();
System.out.println(ob.distinctSubsequences(s));
}
}

class Solution {
int distinctSubsequences(String S) {
HashMap<Character, Integer> map = new HashMap<>();
int mod = 1000000007;
int n = S.length();
int[] dp = new int[n + 1];
dp[0] = 1;

for (int i = 1; i <= n; i++)
{
dp[i] = (2 * dp[i - 1])%mod;
char curr = S.charAt(i - 1);
if (map.containsKey(curr))
dp[i] = (dp[i] - dp[map.get(curr)-1] + mod) % mod;
map.put(curr, i);
}
return dp[n];
}
}