B

https://telegram.me/+_hn3cBQVbGliYTI9

a = 115, b = 9

https://telegram.me/+_hn3cBQVbGliYTI9

60o

https://telegram.me/+_hn3cBQVbGliYTI9

A

https://telegram.me/+_hn3cBQVbGliYTI9

C

https://telegram.me/+_hn3cBQVbGliYTI9

-1

https://telegram.me/+_hn3cBQVbGliYTI9

✅ Goldman Sachs Exam 100% Correct Answers are uploaded here 👇🏻
https://youtu.be/BYwtNx7zaMg
https://youtu.be/BYwtNx7zaMg

Share with your friends 😇

Cognizant
Database Query Question
https://telegram.me/+Q_kf6B6EFexiNmU9

SELECT instructor.first_name AS "First Name", instructor.last_name AS "Last Name"
FROM instructor
WHERE instructor.type = 'full-time'
  AND instructor.last_name LIKE 'C%';

Cognizant
Database Query Question
https://telegram.me/PLACEMENTLELO

Bulk hiring is open for these 4 companies:

1. Capgemini
2. Accenture
3. Reliance
4. TCS

Last Date to Apply: 6 October

We have uploaded all the details in the LinkedIn post.

Post Link: https://bit.ly/mass_hiring

✅ Make sure to apply to all 4 opportunities.

Share this with your friends 😇

Leetcode Weekly 419
B
C++
https://telegram.me/+_hn3cBQVbGliYTI9

class Solution {
public:
pair<bool, int> checkPerfect(TreeNode* node) {
if (!node) return {true, 0};

auto leftResult = checkPerfect(node->left);
auto rightResult = checkPerfect(node->right);

if (leftResult.first && rightResult.first && leftResult.second == rightResult.second) {
return {true, leftResult.second + rightResult.second + 1};
}

return {false, 0};
}

void gatherPerfectSizes(TreeNode* node, vector<int>& subtreeSizes) {
if (!node) return;

auto result = checkPerfect(node);
if (result.first) {
subtreeSizes.push_back(result.second);
}

gatherPerfectSizes(node->left, subtreeSizes);
gatherPerfectSizes(node->right, subtreeSizes);
}

int kthLargestPerfectSubtree(TreeNode* root, int k) {
vector<int> subtreeSizes;
gatherPerfectSizes(root, subtreeSizes);

if (subtreeSizes.empty()) return -1;

sort(subtreeSizes.rbegin(), subtreeSizes.rend());

return (k <= subtreeSizes.size()) ? subtreeSizes[k - 1] : -1;
}
};

Leetcode Weekly 419
B
C++
https://telegram.me/+_hn3cBQVbGliYTI9

Leetcode Weekly 419
C
Python
https://telegram.me/+Q_kf6B6EFexiNmU9

MOD = 10**9 + 7

class Solution:
def countWinningSequences(self, s: str) -> int:
n = len(s)

win_against = {'F': 'W', 'W': 'E', 'E': 'F'}

memo = {}

def dp(i, last_bob_move, score_diff):
if i == n:
return 1 if score_diff > 0 else 0

if (i, last_bob_move, score_diff) in memo:
return memo[(i, last_bob_move, score_diff)]

total_ways = 0
alice_move = s[i]

for bob_move in 'FWE':
if bob_move == last_bob_move:
continue

new_score_diff = score_diff
if bob_move == win_against[alice_move]:
new_score_diff += 1
elif win_against[bob_move] == alice_move:
new_score_diff -= 1

total_ways = (total_ways + dp(i + 1, bob_move, new_score_diff)) % MOD

memo[(i, last_bob_move, score_diff)] = total_ways
return total_ways

return dp(0, None, 0)

Leetcode Weekly 419
C
Python
https://telegram.me/+Q_kf6B6EFexiNmU9