We will traverse the string from left to right. For each substring that contains the same characters, we calculate the sum of the costs and the maximum cost mx. We add sum-mx to the answer.
I have attached the code for reference:
class Solution {
public:
int minCost(string s, vector& cost) {
int i = 0, N = s.size(), ans = 0;
while (i < N) {
int j = i, sum = 0, mx = 1...

The problem requires us to calculate the longest path using an adjacency list and keeping a variable mx to keep a count of max. I have attached the code for reference:
#include

int longest_path(int node,int parent, bool odd,vector adj[])
{
if(odd &&(node%2==1))
return 0;
int mx=0;
for (auto adjNode:adj[node])
{
if(adjNode!=parent)
{
bool sOdd=odd| (n...

It was a very simple binary search problem, I initially told the interviewer about my approach. The first approach was Brute force that is linear seach after which he asked me to optimize it and then i told him about muy approach of linear search to reduce complexity and he asked me to code it.
I have attached it for reference:
bool isBadVersion(int version);

class Solution {
pu...