Green Apple Solutions Pvt Ltd interview experience Real time questions & tips from candidates to crack your interview
Associate Software Engineer
Green Apple Solutions Pvt Ltd
3 rounds | 13 Coding
problems
Rejected
Interview preparation journey
Journey
I started my journey by getting admission to NSUT. After exploring different programming languages and seeking guidance from seniors, I began coding in C++ as it would help me at the competitive level. After mastering C++, I started learning full-stack development through Coding Ninjas. I have completed projects related to full-stack development.
Application story
I applied for the job through Naukri.com, and after a few days, I received an email confirming my shortlisting for the online assessment. Shortly after, I received another email for the technical round, which was conducted at the company's office.
Why selected/rejected for the role?
I was not selected after the CEO round, as I was unable to provide optimized solutions for the backend development questions.
Preparation
Duration: 1 months
Topics: HTML, CSS, React, SQL, Rest API, DSA, Java Script, MongoDB, NodeJS
Tip 1: Create interactive projects based on full-stack development.
Tip 2: Practice at least 250 DSA questions.
Tip 3: Do not include anything on your resume that you are not confident about.
Application process
Where: Naukri
Eligibility: 6.5 CGPA, (Salary Package: 6 LPA)
Tip 1: Keep your resume short.
Tip 2: Do not include false information on your resume.
Tip 3: Avoid adding irrelevant information to your resume.
Interview rounds
01
Round
Medium
Face to Face
Duration60 minutes
Interview date18 Nov 2024
Coding problem4
In this round, the interviewer gave me two coding questions to solve. He also asked me some theory-based DSA questions.
1. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach
The idea is to reverse the links of all nodes using three pointers:
prev: pointer to keep track of the previous node
curr: pointer to keep track of the current node
next: pointer to keep track of the next node
Starting from the first node, initialize curr with the head of the linked list and next with the next node of curr. Update the next pointer of curr with prev.
Finally, move the three-pointer by updating prev with curr and curr with next.
2. Unique Paths
Moderate
25m average time
80% success
0/80
Asked in companies
You are present at point ‘A’ which is the top-left cell of an M X N matrix, your destination is point ‘B’, which is the bottom-right cell of the same matrix. Your task is to find the total number of unique paths from point ‘A’ to point ‘B’.In other words, you will be given the dimensions of the matrix as integers ‘M’ and ‘N’, your task is to find the total number of unique paths from the cell MATRIX[0][0] to MATRIX['M' - 1]['N' - 1].
To traverse in the matrix, you can either move Right or Down at each step. For example in a given point MATRIX[i] [j], you can move to either MATRIX[i + 1][j] or MATRIX[i][j + 1].
Problem approach
I have solved this question using DP. I have maintained a dp[][] table such that dp[i][j] stores the countof all unique possible paths to reach the cell (i, j).
3. Merge Sort vs. Quicksort
Why is merge sort a better option than quicksort for linked lists?
4. Array vs Dictionary
What is the main difference between an Array and a Dictionary?
02
Round
Medium
Face to Face
Duration45 minutes
Interview date22 Nov 2024
Coding problem5
The interviewer was nice. He asked questions from my resume and also asked me questions related to backend development. He gave me a coding question to solve, where I was required to provide only the logic.
1. DBMS
- What is normalization? (Learn)
- What does a foreign key combined with a primary key create?
2. Remove Consecutive Duplicates
Easy
0/40
Asked in companies
You are given a string ‘str’ of size ‘N’. Your task is to remove consecutive duplicates from this string recursively.
For example:
If the input string is ‘str’ = ”aazbbby”, then your output will be “azby”.
Note that we are just removing adjacent duplicates.
Problem approach
The idea is to check if the current character is equal to the next character. If the current character is equal to the next, we’ll ignore it. When they are not equal, we will add the current character to our answer. Finally, add the last character.
Follow these steps to implement the idea:
- Create a string str to store the result.
- Iterate from index 0 to the length of the string minus 2.
- If the current character is not equal to the next character, add it to the answer string.
- Otherwise, continue.
- Return the string str.
5. MongoDB based
What are Replication and Sharding in MongoDB?
03
Round
Hard
Face to Face
Duration45 minutes
Interview date22 Nov 2024
Coding problem4
This was a CEO round in which I was given a question related to backend REST API design. He also asked me questions about my projects.
1. System Design
Design a backend REST API for a gym application where gym owners can upload workout plans, manage their own workouts within a single application, and add important training tips for each workout.
2. Project based
Please tell me about your major project.
4. Time Complexity of Sorting Algorithms
What is the time complexity of merge sort, quick sort, and insertion Sort? (Learn)
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
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4657 views
0 comments
0 upvotes
Java Developer
3 rounds | 14 problems
Interviewed by Green Apple Solutions Pvt Ltd
Rejected
1290 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6450 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3451 views
0 comments
0 upvotes
Companies with similar interview experiences
Associate Software Engineer
3 rounds | 10 problems
Interviewed by Amdocs
Selected 2370 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 2671 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 15 problems
Interviewed by Ernst & Young (EY)
Selected 2347 views
0 comments
0 upvotes