Growtomation interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Growtomation
1 rounds | 2 Coding
problems
Rejected
Interview preparation journey
Journey
I kept my preparation consistent by making multiple projects and solving questions on the Code360 platform. Alongside this, I revised my DSA concepts every week to strengthen my fundamentals and made sure to solve 2–3 coding questions every few days. This regular cycle of building, revising, and practicing helped me steadily improve both my problem-solving skills and overall confidence.
Preparation
Topics: DSA, Python, Javascript, NoSQL
Application process
Where: Coding Ninjas Placement Cell
Eligibility: NA, (Salary range: 7-12 LPA)
Interview rounds
01
Round
Medium
Online Coding Interview
Duration
Interview date24 Mar 2025
Coding problem2
1. Find the Longest Repeating Substring That Forms the Given String
You are given a string s. Write a function that determines if there exists a substring k that can be repeated more than once to form the string s exactly as it appears. If such a substring exists, return the longest possible substring k. Otherwise, return -1.
Problem approach
- Find the length of the string.
- Loop from 1 to half the length of the string (since a repeating substring can’t be longer than half).
- For each iteration i:
- Take the substring from 0 to i.
- Calculate the repeat count = string.length / i.
- Check if repeat count is an integer.
- Use JavaScript’s .repeat() method to repeat the substring.
- If the repeated result equals the original string → return this substring.
- If no valid substring is found, return -1.
2. Find First Non-Repeating Character
Write a function that receives a string consisting only of alphabetical characters. The function should return the first non-repeating character from the string.
- The string will always contain at least one character.
- There will always be at least one non-repeating character.
Problem approach
- Create an object (hash map):
- Loop through each character of the string.
- Store the character as the key and its frequency as the value.
- Check for first non-repeating character:
- Loop again over the string in the same order.
- For each character, check if its frequency in the object is 1.
- Return that character immediately once found.
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
4 rounds | 8 problems
Interviewed by Amazon
Selected 
8518 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3320 views
0 comments
0 upvotes
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
Selected 2581 views
0 comments
0 upvotes
Frontend Developer
2 rounds | 6 problems
Interviewed by Growtomation
Rejected
22 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
Selected 7874 views
1 comments
0 upvotes
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
Selected 9973 views
1 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
Selected 4310 views
1 comments
0 upvotes