Upload Button Icon Add office photos

iMumz

Compare button icon Compare button icon Compare

Filter interviews by

iMumz Salesforce Developer Interview Questions and Answers

Updated 7 Jun 2024

iMumz Salesforce Developer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Share your best experience
  • Q2. What was your most difficult client

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
  • Q2. 

    Find the Second Largest Element

    Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.

    If a second largest element does not exist, return -1.

    Example:

    Input:
    ARR = [2,...
  • Ans. 

    Find the second largest element in an array of integers.

    • Iterate through the array to find the largest and second largest elements.

    • Handle cases where all elements are identical.

    • Return -1 if a second largest element does not exist.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

  • Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
  • Ans. 

    Design a scalable system for Twitter with key components and architecture.

    • Use microservices architecture for scalability and fault isolation.

    • Key components include user service, tweet service, timeline service, and notification service.

    • Use a distributed database like Cassandra for storing tweets and user data.

    • Implement a message queue like Kafka for handling real-time updates and notifications.

    • Use a caching layer like ...

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaResume shortlistingSwiggy interview preparation:Topics to prepare for the interview - OOPS, Data Structures, Core Java, Algorithms, DBMS, SQL,Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.

Application resume tips for other job seekers

Tip 1 : Mention what you know 
Tip 2 : Good previous work to showcase

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Thread,oops,sql,find character count
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Technical questions
  • Q2. Technical questions based on scenario

Interview Preparation Tips

Interview preparation tips for other job seekers - NA

I applied via Naukri.com and was interviewed in Apr 2022. There were 2 interview rounds.

Round 1 - Aptitude Test 

Simple Question Based On Time And Work, Trains Etc Easy To Crack.

Round 2 - Technical 

(1 Question)

  • Q1. Technical Round Basically Based On Your Resume And Your Experience.

Interview Preparation Tips

Interview preparation tips for other job seekers - Simple Question Asked And Go With Your Resume And Technical Staff Based On Your Experience.
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed before Jan 2023. There were 2 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Asked to make a dynamic button component
Round 2 - Technical 

(1 Question)

  • Q1. Asked to make an API call using debouncing

I applied via Naukri.com and was interviewed before Mar 2021. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Online aptitude test with general aptitude questions.

Round 3 - One-on-one 

(1 Question)

  • Q1. Basic js, ES6 features, Angular Questions, Node.js Lifecycle, event loop, mongodb questions, some HR questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare what you are going to appear for, means technologies!
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via unstop and was interviewed before Oct 2023. There were 3 interview rounds.

Round 1 - Coding Test 

It was medium to difficult level test

Round 2 - Technical 

(2 Questions)

  • Q1. Questions about core subjects like oops pillars
  • Q2. Questions about projects, technologies used
Round 3 - HR 

(2 Questions)

  • Q1. Why do you want to join this
  • Q2. Your previous experience and questions about your background
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I applied via Recruitment Consulltant and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Group Discussion 

Data structures, theoretical quesiton, past project discussion.

Round 2 - Coding Test 

Data structure medium problem asked in the interview

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

1 easy and 2 medium-hard DSA problems to solve

  • Q1. 

    Hurdle Game Problem Statement

    Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).

    Given the total number ...

  • Ans. 

    Given the total number of hurdles Kevin has jumped, determine how many levels he has cleared.

    • Iterate through levels while subtracting hurdles from total jumped until remaining hurdles are less than current level

    • Return the current level as the number of levels cleared

  • Answered by AI
  • Q2. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

    • Generate valid configurations recursively and backtrack when a solution is not possible.

  • Answered by AI
  • Q3. 

    Count Ways To Travel Triangular Pyramid

    Bob is given a triangular pyramid with vertices 'O', 'X', 'Y', and 'Z'. He is also provided with an integer 'N'. Bob can move to any adjacent vertex in a single ste...

  • Ans. 

    Calculate the number of ways Bob can complete a journey in a triangular pyramid after N steps.

    • Bob can move to any adjacent vertex in a single step

    • Bob must return to vertex 'O' after exactly 'N' steps

    • Calculate the number of different ways Bob can complete the journey

    • Return the result modulo 1000000007

    • Consider the constraints provided

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

2 DSA problems and computer subject questions

  • Q1. 

    Generate Binary Strings with No Consecutive 1s

    Given an integer K, your task is to produce all binary strings of length 'K' that do not contain consecutive '1's.

    Input:

    The input begins with an integer ...
  • Ans. 

    Generate all binary strings of length 'K' with no consecutive '1's in lexicographically increasing order.

    • Use backtracking to generate all possible binary strings of length 'K' with no consecutive '1's.

    • Start with an empty string and recursively add '0' or '1' based on the condition of no consecutive '1's.

    • Sort the generated strings in lexicographically increasing order before outputting them.

  • Answered by AI
  • Q2. 

    Shuffle Two Strings Problem Statement

    You are provided with three strings A, B, and C. The task is to determine if C is formed by interleaving A and B. C is considered an interleaving of A and B if:

    • T...
  • Ans. 

    Check if a string is formed by interleaving two other strings.

    • Iterate through characters of A, B, and C simultaneously to check if C is formed by interleaving A and B.

    • Use dynamic programming to efficiently solve the problem.

    • Handle edge cases like empty strings or unequal lengths of A, B, and C.

    • Example: A = 'aab', B = 'abc', C = 'aaabbc' should return True.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

DSA round

  • Q1. 

    Ninja and Intersection of Lines

    You are given coordinates for two lines on a 2D plane: Line 'AB' is defined by points 'A' and 'B', and Line 'PQ' is defined by points 'P' and 'Q'. Your task is to find the ...

  • Ans. 

    Find the intersection point of two lines on a 2D plane given their coordinates.

    • Calculate the slopes of both lines using the given coordinates.

    • Use the slope-intercept form of a line to find the equations of the two lines.

    • Solve the equations simultaneously to find the intersection point.

    • Return the coordinates of the intersection point with precision up to 6 decimal places.

  • Answered by AI
  • Q2. 

    Cycle Detection in Directed Graph

    Determine if a given directed graph contains a cycle. If the graph has at least one cycle, return true. Otherwise, return false.

    Input:

    The first line of input contains...
  • Ans. 

    Detect cycles in a directed graph and return true if a cycle exists, false otherwise.

    • Use Depth First Search (DFS) to detect cycles in the directed graph.

    • Maintain a visited array to keep track of visited vertices and a recursion stack to detect back edges.

    • If a vertex is visited and is present in the recursion stack, then a cycle exists.

    • Example: For the input 4 4, the graph has a cycle 0 -> 1 -> 2 -> 3 -> 1.

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

It is a managerial round

  • Q1. How does a URL work and what is a load balancer?
  • Ans. 

    A URL is a web address that specifies the location of a resource on the internet. A load balancer distributes incoming network traffic across multiple servers to ensure optimal resource utilization and prevent overload.

    • A URL (Uniform Resource Locator) is a reference to a web resource that specifies its location on a computer network and the mechanism for retrieving it.

    • URLs typically consist of a protocol (such as HTTP ...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Jalpaiguri Government Engineering College. Eligibility criteriaNASwiggy interview preparation:Topics to prepare for the interview - DSA, Networking, Operating Systems, DBMS, Spring JavaTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice Trees, Graphs, DP
Tip 2 : Be sure about your projects

Application resume tips for other job seekers

Tip 1 : Be genuine about your resume
Tip 2 : Have at least two projects on resume

Final outcome of the interviewSelected

Skills evaluated in this interview

iMumz Interview FAQs

How many rounds are there in iMumz Salesforce Developer interview?
iMumz interview process usually has 1 rounds. The most common rounds in the iMumz interview process are One-on-one Round.

Tell us how to improve this page.

iMumz Salesforce Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 428 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
CARS24 Interview Questions
3.5
 • 333 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Zepto Interview Questions
3.5
 • 221 Interviews
BlackBuck Interview Questions
3.8
 • 178 Interviews
FirstCry Interview Questions
3.6
 • 171 Interviews
AmbitionBox Interview Questions
4.9
 • 151 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
Digit Insurance Interview Questions
3.9
 • 142 Interviews
View all
Product Manager
3 salaries
unlock blur

₹14 L/yr - ₹18.5 L/yr

Chief Staff
3 salaries
unlock blur

₹10 L/yr - ₹10.5 L/yr

Explore more salaries
Compare iMumz with

FirstCry

3.6
Compare

MamaEarth

3.7
Compare

Nykaa

3.5
Compare

BabyChakra

3.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview