Code_sagar
رفتن به کانال در Telegram
3 085
مشترکین
اطلاعاتی وجود ندارد24 ساعت
اطلاعاتی وجود ندارد7 روز
اطلاعاتی وجود ندارد30 روز
آرشیو پست ها
3 085
def getTotalExecutionTime(n, logs):
stack = []
result = [0] * n
prev_time = 0
for log in logs:
function_id, action, timestamp = map(str.split, [log[:-1]])[0]
function_id, timestamp = int(function_id), int(timestamp)
if action == "start":
if stack:
result[stack[-1]] += timestamp - prev_time
stack.append(function_id)
prev_time = timestamp
else:
result[stack.pop()] += timestamp - prev_time + 1
prev_time = timestamp + 1
return result
@code_sagar
3 085
import java.util.Scanner;
import java.lang.reflect.Array;
import java.util.*;
import java.util.Arrays;
public class guruc{
public static void check(String str)
{
String outstr="";
int i=0;
for( i=0;i<str.length();i++)
{
if(str.charAt(i)=='a' str.charAt(i)=='e' str.charAt(i)=='i' str.charAt(i)=='o' str.charAt(i)=='u')
{
outstr+=str.charAt(i);
}
}
char arr[]=outstr.toCharArray();
Arrays.sort(arr);
String kk=new String(arr);
char ch='a';
for( i=0;i<kk.length();i++)
{
if(kk.charAt(i)=='a' kk.charAt(i)=='e' kk.charAt(i)=='i' kk.charAt(i)=='o' kk.charAt(i)=='u')
{
ch=kk.charAt(i);
break;
}
}
int k=str.indexOf(ch);
if(k==-1)
{
kk+="NA-1";
}
else
{
kk+=k;
}
String y="";
for( i=0;i<str.length();i++)
{
if(str.charAt(i)!='a' && str.charAt(i)!='e'&& str.charAt(i)!='i' && str.charAt(i)!='o' && str.charAt(i)!='u')
{
y+=str.charAt(i);
}
}
char p[]=y.toCharArray();
Arrays.sort(p);
char j=p[p.length-1];
String h=new String(p);
StringBuffer sb=new StringBuffer(kk);
sb.append(h);
int rr=str.lastIndexOf(j);
sb.append(rr);
System.out.println(sb);
// gurucharan
}
public static void main(String[] args) {
Scanner sc=new Scanner(System. in);
String instr=sc.nextLine();
check(instr);
}
}
Cpu code
IBM
@code_sagar
3 085
void mark_left(vector<int> &t, int id, int n) //marks the immediate left unpicked product as 1
{
id--;
while (id >= 0)
{
if (t[id] == 0)
{
t[id] = 1;
return;
}
else
id--;
}
return;
}
void mark_right(vector<int> &t, int id, int n) //marks the immediate right unpicked product as 1
{
id++;
while (id < n)
{
if (t[id] == 0)
{
t[id] = 1;
return;
}
else
id++;
}
}
int solve(vector<int> w)
{
int n = w.size();
vector<pair<int, int>> v;
for (int i = 0; i < n; i++)
{
v.push_back({w[i], i});
}
sort(v.begin(), v.end());
vector<int> t(n);
int cnt = 0;
for (int i = 0; i < n; i++)
{
if (t[v[i].second])
continue;
cnt += v[i].first;
t[v[i].second] = 1;
mark_left(t, v[i].second, n);
mark_right(t, v[i].second, n);
}
return cnt;
}
Alice code in C++ for IBM
@code_sagar
3 085
def getTotalExecutionTime(n, logs):
stack = []
result = [0] * n
prev_time = 0
for log in logs:
function_id, action, timestamp = map(str.split, [log[:-1]])[0]
function_id, timestamp = int(function_id), int(timestamp)
if action == "start":
if stack:
result[stack[-1]] += timestamp - prev_time
stack.append(function_id)
prev_time = timestamp
else:
result[stack.pop()] += timestamp - prev_time + 1
prev_time = timestamp + 1
return result
3 085
int gcd(int a, int b) {
while (b != 0) {
int temp = b;
b = a % b;
a = temp;
}
return a;
}
vector<int> coprimeCount(vector<int>& A) {
int n = A.size();
vector<int> result;
for (int i = 0; i < n; ++i) {
int count = 0;
for (int j = 1; j <= A[i]; ++j) {
if (gcd(A[i], j) == 1) {
count++;
}
}
result.push_back(count);
}
return result;
}
@code_sagar
3 085
int gcd(int a, int b) {
while (b != 0) {
int temp = b;
b = a % b;
a = temp;
}
return a;
}
vector<int> coprimeCount(vector<int>& A) {
int n = A.size();
vector<int> result;
for (int i = 0; i < n; ++i) {
int count = 0;
for (int j = 1; j <= A[i]; ++j) {
if (gcd(A[i], j) == 1) {
count++;
}
}
result.push_back(count);
}
return result;
}
IBM
@code_sagar
3 085
Tcs codevita
Orchard
Mazerunner
Perfect Budget
Bouncing balls
Vinni the craftsman
All code available
@code_sagar
3 085
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const long long mod = 1e9 + 7;
long long count = 0;
long long count1 = 0;
int n;
void solve() {
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
reverse(arr.begin(), arr.end());
int ans = 0;
vector<int> dp(n, -1);
dp[0] = arr[0];
for (int i = 0; i < n; i++) {
dp[i] = arr[i];
for (int j = 0; j < i; j++) {
if (arr[j] < arr[i]) {
dp[i] = max(dp[i], dp[j] + arr[i]);
}
}
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
De shaw
@code_sagar
3 085
public static int maxPairs(int input1, int[] input2, int input3, int[] input4) {
Arrays.sort(input2);
Arrays.sort(input4);
int count = 0;
for (int i = 0; i < input3; i++) {
for (int j = 0; j < input1; j++) {
if (input4[i] >= input2[j]) {
count++;
} else {
break;
}
}
}
return count;
}
Ibm total weight code
3 085
LSEG Hiring Software Engineer
Apply Link:
https://refinitiv.wd3.myworkdayjobs.com/en-US/Careers/job/Software-Engineer_R0077490-2
3 085
class Result {
public static final int MOD = 1000000007;
public static int distinctStrings(String s) {
int n = s.length();
int[] dp = new int[n + 1];
dp[0] = 1;
for (int i = 1; i <= n; i++) {
dp[i] = (dp[i - 1] * 2) % MOD;
int prevIndex = findPreviousIndex(s, i);
if (prevIndex != -1) {
dp[i] = (dp[i] - dp[prevIndex] + MOD) % MOD;
}
}
return dp[n];
}
private static int findPreviousIndex(String s, int index) {
char currentChar = s.charAt(index - 1);
for (int i = index - 1; i >= 0; i--) { // Change here: start from index - 1
if (s.charAt(i) == currentChar) {
return i;
}
}
return -1;
}
}
Distinct string
@code_sagar
3 085
from collections import defaultdict
import heapq
def lexicographicallySmallestSequence(n, a, b):
# Write your code here
h = defaultdict(list)
for i,j in zip(a,b):
h[i].append(j)
h[j].append(i)
visited = set()
q = [1]
visited.add(1)
ans = []
while q:
node = heapq.heappop(q)
ans.append(node)
for j in h[node]:
if j not in visited:
visited.add(j)
heapq.heappush(q, j)
return ans
Wayfair code
@code_sagar
