IBM Oa Help | Oa Exam Helper
رفتن به کانال در Telegram
We are here to clear All types of Exams Admin : @Codercpp001 (aka) KMK ✅ INTERVIEW HELP AVAILABLE 1-Coding Round 2-Aptitude and Reasoning Round 3-Communication round 4-Resume building 🎉Job updates will be posted here.
نمایش بیشتر1 163
مشترکین
اطلاعاتی وجود ندارد24 ساعت
-47 روز
+430 روز
آرشیو پست ها
int n = S.length();
unordered_map leftFreq, rightFreq;
unordered_set leftSet, rightSet;
// Initialize the rightFreq map and rightSet with the entire string S
for (char c : S) {
rightFreq[c]++;
rightSet.insert(c);
}
int maxX = 0;
// Traverse the string and adjust the left and right sets and maps
for (int i = 0; i < n - 1; ++i) {
char c = S[i];
leftFreq[c]++;
rightFreq[c]--;
if (rightFreq[c] == 0) {
rightSet.erase(c);
}
leftSet.insert(c);
int currentSum = leftSet.size() + rightSet.size();
maxX = max(maxX, currentSum);
}
return n - maxX;
#include <vector>
const int MOD = 1000000007;
int countPrettyPartitions(int N, int L, int R, std::vector<int>& A) {
std::vector<int> dp(N + 1, 0);
dp[0] = 1;
for (int i = 1; i <= N; ++i) {
int xor_value = 0;
for (int j = i; j >= 1; --j) {
xor_value ^= A[j - 1];
if (L <= xor_value && xor_value <= R) {
dp[i] = (dp[i] + dp[j - 1]) % MOD;
}
}
}
return dp[N];
} Dividing array
import java.util.*;
public class AnagramSubsequenceFinder {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String S = sc.nextLine();
int N = sc.nextInt();
sc.nextLine();
String[] W = new String[N];
for (int i = 0; i < N; i++) {
W[i] = sc.nextLine();
}
int[] freqS = getFrequency(S);
int count = 0;
for (String w : W) {
if (isValidAnagramSubsequence(freqS, w)) {
count++;
}
}
System.out.println(count);
}
private static int[] getFrequency(String S) {
int[] freq = new int[26];
for (char c : S.toCharArray()) {
freq[c - 'a']++;
}
return freq;
}
private static boolean isValidAnagramSubsequence(int[] freqS, String w) {
int[] freqW = new int[26];
for (char c : w.toCharArray()) {
freqW[c - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (freqW[i] > freqS[i]) {
return false;
}
}
return true;
}
}
// Minimal substring length
import java.io.*;
import java.util.*;
public class Main {
public static String trim(String str) {
return str.trim();
}
public static int solve(int N, List<Integer> A) {
int totalSum = A.stream().mapToInt(Integer::intValue).sum();
int leftSum = 0;
int equilibriumCount = 0;
for (int i = 0; i < N; ++i) {
int rightSum = totalSum - leftSum - A.get(i);
if (leftSum == rightSum) {
equilibriumCount++;
}
leftSum += A.get(i);
}
return equilibriumCount;
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String inputLine = br.readLine();
int N = Integer.parseInt(trim(inputLine));
List<Integer> A = new ArrayList<>();
for (int j = 0; j < N; j++) {
inputLine = br.readLine();
A.add(Integer.parseInt(trim(inputLine)));
}
int result = solve(N, A);
System.out.println(result);
}
}
//Equilbrium path (try)
long long solve(int n,vectorv){
long long ans=0;
sort(v.begin(),v.end());
for(int i=1;i
def twins(a, b):
result = []
for first, second in zip(a, b):
if sorted(first[::2]) == sorted(second[::2]) and sorted(first[1::2]) == sorted(second[1::2]):
result.append('Yes')
else:
result.append('No')
return result
Twin linked ✅
vectorfindSubsequence(vectorarr){
mapm;
vectorans;
int maxi=0;
int n=arr.size();
for(int i=0;i0){
if(arr[i]
#include <bits/stdc++.h>
using namespace std;
int equalzeroandone(vector<int>v){
int n=v.size();
for(int i=0;i<n;i++){
if(v[i]==0){
v[i]=-1;
}
}
int sum=0;
int ans=-1;
map<int,int>mp;
for(int i=0;i<n;i++){
sum+=v[i];
if(sum==0){
ans=i+1;
}
if(mp.find(sum)!=mp.end()){
ans=max(ans,i-mp[sum]);
}
else{
mp[sum]=i;
}
}
return ans;
}
int main() {
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
cout<<equalzeroandone(v);
}
Equal number of zero
Infosys
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll solve(string s1, string s2) {
ll m = s1.length();
ll n = s2.length();
vector<vector<ll>>dp(m+1,vector<ll>(n + 1));
for (ll i=1;i<= m;i++) {
dp[i][0]=i;
}
for (ll j = 1; j <= n;j++) {
dp[0][j] = j;
}
for (ll i = 1; i <= m; ++i)
{
for (ll j = 1; j <= n; ++j)
{
if (s1[i - 1] == s2[j - 1])
{
dp[i][j] = dp[i - 1][j - 1];
}
else
{
dp[i][j] = 1 + min(dp[i - 1][j], dp[i][j - 1]);
if (i > 1 && j > 1 && s1[i - 1] == s2[j - 2])
{
dp[i][j] = min(dp[i][j], 1 + dp[i - 1][j - 2]);
}
if (i > 1 && j > 1 && s1[i - 2] == s2[j - 1])
{
dp[i][j] = min(dp[i][j], 1 + dp[i - 2][j - 1]);
}
}
}
}
return dp[m][n];
}
signed main()
{
string s1,s2; cin>>s1>>s2;
cout<<solve(s1,s2)<<endl;
return 0;
}#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD=1e9+7;
struct FenwickTree {
vector<ll> bit;
ll n;
FenwickTree(ll size) {
n = size;
bit.assign(n + 1, 0);
}
void update(ll idx, ll val) {
for (; idx <= n; idx += idx & -idx)
bit[idx] = max(bit[idx], val);
}
ll query(ll idx) {
ll res = 0;
for (; idx > 0; idx -= idx & -idx)
res = max(res, bit[idx]);
return res;
}
};
ll solve(vector<ll>& a)
{
ll n=a.size();
vector<pair<ll,ll>>ia(n);
for (ll i=0;i<n;i++)
{
ia[i] = make_pair(a[i], i);
}
sort(ia.begin(),ia.end(),[](const pair<ll,ll>&p1,const pair<ll,ll>&p2) {
return p1.first<p2.first;
});
FenwickTree fenwick(n);
ll maxBeauty=0;
for (ll i=0;i<n;i++)
{
ll val=ia[i].first;
ll og=ia[i].second;
ll beauty=0;
for (ll j=og-1;j>=0;j--)
{
if (__gcd(abs(a[j]),abs(a[og]))>1) {
beauty=max(beauty,fenwick.query(j+1)+(a[og]-a[j])*(a[og]-a[j]) % MOD);
}
}
fenwick.update(og + 1, beauty);
maxBeauty = max(maxBeauty, beauty);
}
return maxBeauty;
}
signed main()
{
ll n; cin>>n;
vector<ll>a(n);
for (ll i=0;i<n;i++) cin>>a[i];
cout<<solve(a)<<endl;
return 0;
}