Cj DARCL logistics interview experience Real time questions & tips from candidates to crack your interview

Fullstack Developer

Cj DARCL logistics
upvote
share-icon
2 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Application story
I came across the opportunity at CJ Darcl Logistics through a job posting on LinkedIn. After reviewing the role and finding it aligned with my skills and interests, I applied directly through the platform with an updated resume. Within a few days, I received a response from the HR team and was invited to participate in the selection process. The process included an initial screening, followed by a technical assessment and one or more rounds of interviews focusing on my technical skills and problem-solving abilities. Throughout the process, I communicated directly with the company’s recruitment team — no external references were involved. After successfully clearing the interview rounds, I was offered a full-time position, which I gladly accepted. The entire process was smooth and professionally handled by the company.
Preparation
Duration: 3 Months
Topics: HTML, CSS, JS, React/Angular, Node, Express, MongoDB
Tip
Tip

Tip 1: Spend time on DSA: strings, arrays, and pointers are easy sections; stack/queue and heaps are intermediate; trees, graphs, and dynamic programming (DP) are important topics.
Tip 2: Make your project fully functional on your resume and have thorough knowledge of it.

Application process
Where: Linkedin
Eligibility: No criteria, (Salary Package - 5.5 LPA)
Resume Tip
Resume tip

Tip 1: Make a "Technical Skills" section with clear categories.
Tip 2: Showcase your experience: internships and projects.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 minutes
Interview date20 Mar 2025
Coding problem2

1. Intersection Of Two Sorted Arrays

Easy
10m average time
90% success
0/40
Asked in companies
IBMFacebookBig Basket

You are given two arrays 'A' and 'B' of size 'N' and 'M' respectively. Both these arrays are sorted in non-decreasing order. You have to find the intersection of these two arrays.

Intersection of two arrays is an array that consists of all the common elements occurring in both arrays.

Note :
1. The length of each array is greater than zero.
2. Both the arrays are sorted in non-decreasing order.
3. The output should be in the order of elements that occur in the original arrays.
4. If there is no intersection present then return an empty array.
Try solving now

2. Common Elements Present In All Rows Of Matrix

Moderate
25m average time
85% success
0/80
Asked in companies
AmazonCj DARCL logisticsMediaTek

You are given a 2-D Matrix 'MAT' having 'N' rows and 'M' columns, respectively. Your task is to find all elements which are present in each row of the matrix.

Note :
1. The output array can contain the elements in any particular order.

2. Even if a particular element appears more than once in each matrix row, it should still be present only once in the output array.
For Example :
Consider the matrix MAT [ [ 2, 3, 4, 7 ] , [ 0, 0, 3, 5 ] , [ 1, 3, 8, 9 ] ] having 3 rows and 4 columns respectively.
The output array should be [ 3 ] as 3 is the only element that is present in all three rows.
Try solving now
02
Round
Easy
Face to Face
Duration40 minutes
Interview date21 Mar 2025
Coding problem3

1. Find all occurrences

Moderate
35m average time
60% success
0/80
Asked in companies
Goldman SachsMicrosoftOracle

You are given a 'M' x 'N' matrix of characters, 'CHARACTER_MATRIX' and a string 'WORD'. Your task is to find and print all occurrences of the string in the given character matrix. You are allowed to search the string in all eight possible directions, i.e. North, South, East, West, North-East, North-West, South-East, South-West.

Note: There should not be any cycle in the output path. The entire string must lie inside the matrix boundary. You should not jump across boundaries, i.e. from row 'N' - 1 to 0 or column 'N' - 1 to 0 or vice versa.

Example:

Consider below matrix of characters,
[ 'D', 'E', 'X', 'X', 'X' ]
[ 'X', 'O', 'E', 'X', 'E' ] 
[ 'D', 'D', 'C', 'O', 'D' ]
[ 'E', 'X', 'E', 'D', 'X' ]
[ 'C', 'X', 'X', 'E', 'X' ]

If the given string is "CODE", below are all its occurrences in the matrix:

'C'(2, 2) 'O'(1, 1) 'D'(0, 0) 'E'(0, 1)
'C'(2, 2) 'O'(1, 1) 'D'(2, 0) 'E'(3, 0)
'C'(2, 2) 'O'(1, 1) 'D'(2, 1) 'E'(1, 2)
'C'(2, 2) 'O'(1, 1) 'D'(2, 1) 'E'(3, 0)
'C'(2, 2) 'O'(1, 1) 'D'(2, 1) 'E'(3, 2)
'C'(2, 2) 'O'(2, 3) 'D'(2, 4) 'E'(1, 4)
'C'(2, 2) 'O'(2, 3) 'D'(3, 3) 'E'(3, 2)
'C'(2, 2) 'O'(2, 3) 'D'(3, 3) 'E'(4, 3)
Try solving now

2. Operating System

  1. What is the difference between paging and segmentation? (Learn)
  2. What is the difference between a process and a thread?

3. DBMS

  1. What is a subquery in SQL? Provide an example.
  2. Explain the concept of a stored procedure in a DBMS.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
960 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3451 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Fullstack Developer
6 rounds | 5 problems
Interviewed by Microsoft
2222 views
0 comments
0 upvotes
company logo
Fullstack Developer
2 rounds | 2 problems
Interviewed by Samsung
2163 views
0 comments
0 upvotes
company logo
Fullstack Developer
2 rounds | 2 problems
Interviewed by Amdocs
1813 views
0 comments
0 upvotes