Accenture 10 Am Slot โ
Section 2 Critical Reasoning
Q- (18-35)
Q- (18-35)
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
DXC Hiring Technical Support Engineer โ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Global Payments
๐ Job Title: Intern
โ๐ป YOE: 2025/2026
โก๏ธ Apply
https://jobs.globalpayments.com/en/jobs/r0052202/intern/
๐ Job Title: Intern
โ๐ป YOE: 2025/2026
โก๏ธ Apply
https://jobs.globalpayments.com/en/jobs/r0052202/intern/
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Internship @ Cadence
Link to apply ๐
https://cadence.wd1.myworkdayjobs.com/External_Careers/job/NOIDA/Intern-Software-Engineering_R46779
Link to apply ๐
https://cadence.wd1.myworkdayjobs.com/External_Careers/job/NOIDA/Intern-Software-Engineering_R46779
public static int countUniqueCharacterSets(int N, String A) {
Set<Set<Character>> uniqueSets = new HashSet<>();
for (int i = 0; i < N; i++) {
Set<Character> currentSet = new HashSet<>();
for (int j = i; j < N; j++) {
currentSet.add(A.charAt(j));
uniqueSets.add(new HashSet<>(currentSet));
}
}
return uniqueSets.size();
}
Character Set Count โ
Set<Set<Character>> uniqueSets = new HashSet<>();
for (int i = 0; i < N; i++) {
Set<Character> currentSet = new HashSet<>();
for (int j = i; j < N; j++) {
currentSet.add(A.charAt(j));
uniqueSets.add(new HashSet<>(currentSet));
}
}
return uniqueSets.size();
}
Character Set Count โ
๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ
Photo
public static int solution(int N, int K, int[] cost, int[] sell) {
int maxProfit = 0;
List<Item> items = new ArrayList<>();
for (int i = 0; i < N; i++) {
items.add(new Item(cost[i], sell[i]));
}
Collections.sort(items, Comparator.comparingInt(Item::getSellPrice));
int low = 0, high = items.size() - 1;
while (low <= high) {
int mid = low + (high - low) / 2;
int buyingPrice = items.get(mid).getBuyPrice();
if (K >= buyingPrice) {
maxProfit = Math.max(maxProfit, items.get(mid).getSellPrice() - buyingPrice);
low = mid + 1;
} else {
high = mid - 1;
}
}
return maxProfit;
}
}
class Item {
private int buyPrice;
private int sellPrice;
public Item(int buyPrice, int sellPrice) {
this.buyPrice = buyPrice;
this.sellPrice = sellPrice;
}
public int getBuyPrice() {
return buyPrice;
}
public int getSellPrice() {
return sellPrice;
}
}
Profits โ
int maxProfit = 0;
List<Item> items = new ArrayList<>();
for (int i = 0; i < N; i++) {
items.add(new Item(cost[i], sell[i]));
}
Collections.sort(items, Comparator.comparingInt(Item::getSellPrice));
int low = 0, high = items.size() - 1;
while (low <= high) {
int mid = low + (high - low) / 2;
int buyingPrice = items.get(mid).getBuyPrice();
if (K >= buyingPrice) {
maxProfit = Math.max(maxProfit, items.get(mid).getSellPrice() - buyingPrice);
low = mid + 1;
} else {
high = mid - 1;
}
}
return maxProfit;
}
}
class Item {
private int buyPrice;
private int sellPrice;
public Item(int buyPrice, int sellPrice) {
this.buyPrice = buyPrice;
this.sellPrice = sellPrice;
}
public int getBuyPrice() {
return buyPrice;
}
public int getSellPrice() {
return sellPrice;
}
}
Profits โ
๐1
Critical Reasoning
Accenture 2pm slot โ
Accenture 2pm slot โ