Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Curefit interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Curefit
upvote
share-icon
3 rounds | 5 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 4 Months
Topics: C, C++, Java Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, Operating System, Networking
Tip
Tip

Tip 1 : Must do Previously asked Interviews Questions.
Tip 2 : Prepare OS, DBMS, OOPs, Computer Networks well.
Tip 3 : Prepare well for one project mentioned in the resume, the interviewer may ask any question related to the project, especially about the networking part of the project.

Application process
Where: Referral
Eligibility: None
Resume Tip
Resume tip

Tip 1 : Practice atleast 200+ questions from leetcode.
Tip 2 : Have at least one project in the resume.
Tip 2 : Must mention every skill and certificate in the resume.
Tip 3 : Must have known every strong and intermediate skill mentioned in resume.

Interview rounds
01
Round
Medium
Online Coding Test
Duration60 Minutes
Interview date1 Apr 2022
Coding problem2

This was an online test on the hackerrank platform. The test consists of 2 coding questions to be solved in 60 mins.

1. 3Sum
Moderate
15m average time
85% success
0/80
Asked in companies
FacebookIntuitSnapdeal

You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

View more
Problem approach

class Solution {
public:
vector threeSum(vector& nums) {
int n = nums.size();
vector ans;
int lp, rp, rq;
sort(nums.begin(), nums.end());
for(int i = 0; i < (n -2); ++i){
if(i && nums[i] == nums[i-1]){
continue;
}
rq = -nums[i];
lp = i + 1;
rp = n - 1;
while(lp < rp){
if(nums[lp] + nums[rp] == rq){
vector v(3);
v[0] = nums[i];...

View more
Try solving now
2. Valid Parentheses
Easy
10m average time
80% success
0/40
Asked in companies
InfosysSamsungCurefit

You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .


Return true if the given string 'S' is balanced, else return false.

...

View more
Problem approach

public class Solution {
public bool IsValid(string s) {
Dictionary brackets = new Dictionary();
brackets.Add(')', '(');
brackets.Add('}', '{');
brackets.Add(']', '[');

Stack stack = new Stack();

for(int i = 0; i < s.Length; i++)
{
if(!brackets.ContainsKey(s[i]))
{
stack.Push(s[i]);
}
else
{
char topStack = stack.Count != 0 ? stack.Pop() : ...

View more
Try solving now
02
Round
Medium
Video Call
Duration60 Minutes
Interview date12 Apr 2022
Coding problem2

This was 1st technical round taken by the software engineer at curefit. Interviewer was very friendly, he started with his introduction and then asked me to introduce myself.

He asked about my project work in detail
What are OOPs concepts and its pillar
Is java support multiple inheritance or not
what are acid properties
Write a SQL query to find the 2nd largest salary from employee table

1. Add binary strings
Easy
15m average time
85% success
0/40
Asked in companies
FacebookMicrosoftAccenture

You have been given two binary strings ‘A’ and ‘B’. Your task is to find the sum of both strings in the form of a binary string.

View more
Problem approach

class Solution {
public:
string addBinary(string a, string b) {
reverse(a.begin(), a.end()); //Reversing both strings (if you get this, then you got the code very well)
reverse(b.begin(), b.end());

if(a.size()>b.size()){ //These two conditions are for making both strings equal sized by adding '0' to smaller string
for(int i=b.size(); i b.push_back('0');
}
}
els...

View more
Try solving now
2. Merge Intervals
Moderate
20m average time
80% success
0/80
Asked in companies
SalesforceSAP LabsAmazon

You are given N number of intervals, where each interval contains two integers denoting the start time and the end time for the interval.

View more
Problem approach

Sort intervals by beginning index. First we start with the laft most interval. After that for each interval we see if the beginning of the current left most interval. If not, we push the new interval and that becomes the left most interval. If the intervals overlap, we merge the currsent left most interval with the new interval. To do this, we pop the current left most interval. The lesft end p...

View more
Try solving now
03
Round
Medium
Video Call
Duration60 Minutes
Interview date19 Apr 2022
Coding problem1

It was the second technical round taken by the senior software developer. During the interview, the interviewer was very friendly and helpful whenever I had any questions. I was asked to introduce myself after he gave his introduction.

1. Palindrome Partitioning
Moderate
25m average time
75% success
0/80
Asked in companies
HSBCMicrosoftGoogle

You are given a string 'S'. Your task is to partition 'S' such that every substring of the partition is a palindrome. You need to return all possible palindrome partitioning of 'S'.

View more
Problem approach

We can solve this question using Recursion.
We can start iterate over the array and we will doing partition. Partition would mean that we will be generating sub strings and checking if each of the sub string is palindrome or not. After every partition, every sub string which is palindrome is pushed into a new array.

void f(int ind, string& s,vector>& ans,vector&path){

View more
Try solving now
Start a Discussion
Similar interview experiences
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Curefit
618 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 2 problems
Interviewed by Curefit
693 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 7 problems
Interviewed by Curefit
553 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Curefit
276 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
97236 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
45397 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
28416 views
6 comments
0 upvotes