2 results • Page 1 of 1
Showing : `Citadel`reset
2 results • Page 1 of 1

Recent Replies

Answer: Accenture | 26th September | Online Assessments | String Letter Search by Mayank Chouhan • 0
Solution 1: import java.util.*; public class Main {     public static void main(String[] args) {       &nb…
Answer: Tredence Analytics , Recently Asked Online Assessment Questions (1st October 202 by Yololo • 20
#include <bits/stdc++.h> using namespace std; int main() { string str; cin>>str;   set<char>st; …
Comment: Tredence Analytics , Recently Asked Online Assessment Questions (1st October 202 by Yololo • 20
#include using namespace std; int main() { string str; cin>>str; setst; for(auto i:str)st.insert(i); mapmp; int i=0,j=0; int len…
Answer: Hilabs SDE OA | Minimum Price by Ashutosh Saini • 10
Just simple brute force works: 1. Make the size of the array to 2*n by appending it to itself to avoid any circular array headache. 2. Fi…
Answer: Tredence Analytics , Recently Asked Online Assessment Questions (1st October 202 by JAYESH BHOJAWAT • 20
#include<bits/stdc++.h> using namespace std; int check(int f[30], int mx){ int temp = 0; for(int i=0; i<26; i++)if(f[i])temp++; re…
Answer: Tredence Analytics , Recently Asked Online Assessment Questions (1st October 202 by JAYESH BHOJAWAT • 20
#include <bits/stdc++.h> using namespace std; int A[30], B[30]; int main(int argc, char* argv[]) { if(argc == 2 or a…
Answer: Google | OA | MANIT Bhopal | July 15th (Set -1) | Finding arrays | Hybrid maximu by Pawan Kumar • 10
MEDIAN PATH  #include <bits/stdc++.h> using namespace std; void dfs(int node, int parent, vector<int> &val, vec…
Answer: Morgan Stanley | Online Assement by Pawan Kumar • 10
int bfs(int node, map<int, vector<pair<int, int>>> &adj) {     int in = 0;     for (auto i : adj)     {        …
Answer: Morgan Stanley | Online Assement by Pawan Kumar • 10
int bfs(int node, map>> &adj;) {     int in = 0;     for (auto i : adj)     {         for (auto j : i.second)         { …
Answer: Microsoft , Recent Online Assessment (18th August 2023) | Car Manufacturer | Li by Jai Khatri • 0
I am thinking of dp solution : dp[i][x][y] ->what will maximum number of cars manufactured if I am on ithcar with x hr remaining in X…
Comment: PhonePe | 9th October | Online Assessments by Rahul Dev Gurjar • 10
#include <bits/stdc++.h>   using namespace std;  class disjoint  {    private:    int nodes; &nb…
Answer: DE Shaw , Online Assessment | Array of N - Integers | Different Strings | NIT Su by Shishank Rawat • 0
C++ solution for Question 1: #include<bits/stdc++.h> using namespace std; #define ll long long int n; int arr[(int)1e5+5]; int m…