chubb oa 2023
Anonymous User
1258

So chubb took oa for all the colleges on one day... hackerrank platform
TBH alot of people copied from chatgpt even though we wrote from college and they got shortlisted😭
Even i should have copied :(
image

Everyone got different questions and people who got easy ones did them...people like me who got hard couldn't solve much and yes they selected based on number of questions you solved

As far as I remeber supposedly they have 3 "easy"and 2 "medium" questions...
but bro for me they are NOT at all easy
image

I will write the questions till what I remember:-

  1. They will give a url strings and valid which is vector of vector strings...You need to search if there is valid string in url if NO push INVALID in vector ans if yes push VALID and they gave some name=ads,sad.... smthg like that info so we need to push name ads sad also i.e key and value
    and return the ans...trust me its like helll

2.They will give a string say s="xxxxyy" you need to map it with a number less than or equal to 100 such that the xor is 0 and see that entire a-z alphabets xor is minimum...
return the numbers assigned from a-z.
eg:- x=36 y=37...xor of string s is 0... a-some number..b-some number....till z....from a to z the total xor of these numbers should be minimum

  1. string a string b is given .... return length of longest subsequence in a which is a substring of b

  2. int array is given...which shows the nodes in a network value k is given... you need to start from a position in array and can hop 'k' steps...you need to add the values in those positions...you need to get max sum as possible....array can have negative numbers....unsorted it is...

  3. I forgot the question but smthg related to 2 pointer we need to do

............................................................................................................................................................................................................................

What my classmates got were

  1. string a and b given check if anagrams or not
  2. string a is given see that aa or bb or ab is not there in it...i.e remove it from the string
  3. some dp easy question direct from gfg
  4. The goal is to make the array contain as many distinct elements as possible after performing some number of operations. In a single operation, x can choose any 3 elements from the array and remove the maximum and minimum among the three from the array. Determine the maximum number of elements remaining in the array when all of the elements are distinct.
Comments (2)