C Developer sollicitatievragen
3K
Sollicitatievragen voor C Developer gedeeld door sollicitantenMeest gestelde sollicitatievragen
Very simply question of inserting latest 5000 records in container along with timestamp and retrieve them as needed and discard which are older then 5000.
4 antwoorden↳
Isn’t it true that you should pass 3/3?
↳
They gave me the same test on HackerRank which I did successfully (it passed all test cases). Yet my candidacy was rejected. I used a map container. I couldn't find any container suitable for the job. There may be a better solution which I am was not able to figure out. After reading this post, I am also feeling that they are biased :( Minder
↳
I'm curious about the "racially charged" - that's pretty bad. Since you mentioned 20 years it could be more a case of age discrimination (rampant in IT unfortunately) than racial bias. Minder
As the bond they asked me to submit them my original document (10th 12th and birth certificate) Also if i leave in probationary period i will have to submit 20K
4 antwoorden↳
if they caught me red handed babe then why did they called me for the third round??? he was just trying make him superior that's all Minder
↳
Are you sure that they asked for your birth certificate ? because no company asks for birth certificate.. I have to face an interview in next 2 days.. so please reply. Minder
↳
They asked for 4 documents fourth one I don't remember and even if they didn't ask for birth certificate, it is illegal to ask for any original document and never do submit at any cost. Minder
How do you find the biggest number ?
4 antwoorden↳
If you sorted the list of numbers why would you have to binary search to pick it out? It should either be the first or last one in the list depending on what you past as your comparator. And sorting is slow for this kind of question, since you will be removing and inserting items to figure out which one is the biggest. What they probably wanted to hear is if they didn't want it optimized was a single for-loop with a comparator. This should get done in O(n). If they wanted it optimized, a divide and conquer strategy will find the answer in lesser number of comparisons. If you're looking for a STD solution it's "std::minmax_element(first, last);" Minder
↳
You are so right ! Now I can't remember whether the question was to find a target number, or the biggest. If the latter, then for sure that would be the killer reason I failed the interview! Thanks very much for the solution. Minder
↳
Sorting + Binary search = O(n log n) + O(log n) Linear search = O(n) ???
Sequence of numbers in random order and 1 of them is missing how to find that out...
4 antwoorden↳
If the sequence is guaranteed to contain only positive integers, it can be done like so: Read in the sequence, noting the MIN and MAX numbers. The sum IF it started from 1 would be MAX(MAX-1)/2. The sum of the 'missing' numbers (from 1 up to where the sequence actually starts) is (MIN-1)*MIN/2. The missing number is given by taking the difference between the two: X = [MAX*(MAX-1) - (MIN-1)*MIN]/2. Minder
↳
Oops, in addition to what I put above there is a final step to get the actual answer. The missing number is equal to X minus the sum of the numbers given. Minder
↳
N(N+1)/2 - sum of the input = missing number
Q: Write a program for this: I/P: aaaccedddd O/P: 3a2c1e4d
3 antwoorden↳
string str; getline(cin,str) unordered_map charcountMap; for(int i=0;i
↳
string str; getline(cin,str) unordered_map charcountMap; for(int i=0;i
↳
string str; getline(cin,str) unordered_map charcountMap; for(int i=0;i
New shares report data on a minute to minute basis with additional information. Please describe how to perform this change without affecting old shares data
3 antwoorden↳
If you need help passing the CCAT (hardest part of the process in my opinon) I passed it by studying ruthlessly. I found this site that has the same CCAT as crossovers and just took that a bunch of times. crossoverccat[DOT]com I recommend this for anyone that has the proctored CCAT coming up. The salary is $15 / hr which is really good in my country. 40 hours a week min/max. Minder
↳
If you need help passing the CCAT (hardest part of the process in my opinion) I passed it by studying ruthlessly. I found this site that has EXACTLY the SAME CCAT as crossovers and just took that a bunch of times. CROSSOVERCCAT(dot)COM I recommend this for anyone that has the proctored CCAT coming up. It is the SAME test as CROSSOVER for WORK I woulden’t have been able to pass without it! Minder
↳
Hello, i have some questions regarding the writing code assessments for the software engineer position. It will be Data structure and Algorithms. would anyone give me advice about how to study for it? Minder
basics oops questions
2 antwoorden↳
Inheritance polymorphism encapsulation abstraction
↳
Inheritance=Inheritance allows use to define The class from which the new class in herits properties data memberand member function is called vase classs and the new created class is clled derived class syntax class derived classs accesss. // data member and member function of derived classs: Polymorphism In simple words we can define polmorpsism as the ability of a meesage to be displayed in more than one from polymorphism important and basic concept of oops. polymorphism in manily divided in to types 1= compile time polmorphism compile time 1 function overloading 2 opertor overloading template 2=rum time polymorphism 1 function overloading Encapsulation= it is one of the most important feature of oops that used to rapping the data and function in to a single unit. The data of class is not accessible to outside the class 4 =Abstraction is the one of the most important feature of oops which is showing only the essential information to the out side would and hiding the intend details abstraction Minder
OOPS Concepts, Writing a program Code to print the sum of digits of a number
2 antwoorden↳
Search the answers in Google. Readily available there.
↳
int k,num; int sum=0; k=num; while (k>0) { sum+=k%10; k/=10; } return sum; Minder
Implement a data structure the support the following interface void push(Integer) - O(1) Integer pop() - O(1) - pop the last element that inserted Integer get_middle() - O(1) - get the middle element value get_k(k) - O(K) - get the first k elements values.
2 antwoorden↳
A linked list with next an prev pointers pointer to the head of the list , pointer to the tail of the list, and pointer to the middle. also keep a variable that has the size of the list. every push if the size is even move the middle pointer to the next node , otherwise do nothing. keep in mind to move the tail pointer also in every push or pop. Minder
↳
class Node { public: int val; Node* prev= nullptr; Node* next= nullptr; }; class LinkedList { Node* root; Node* last; Node* middle; int count = 0; public: void Push(int val) { Node * n= new Node; n->val = val; if (root == nullptr) { root = n; last = root; middle = root; } else { n->next = root; root->prev=n; root = n; if (count % 2 == 0) { middle = middle->prev; } } count++; } int pop() { if (root == nullptr) { return -1; } Node tmp = *root; root = root->next; //free(tmp); count--; if (count != 0 && count != 1 && count % 2 == 0) { middle = middle->next; } return tmp.val; } int Get_Middle() { return middle->val; } int Get_K(int k) { k = k > count ? count : k; Node * nk = last; for (int i = 0; i prev; } return nk->val; } }; Minder