Wingify interview experience Real time questions & tips from candidates to crack your interview

Frontend Engineer Intern

Wingify
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I was looking for off-campus internship opportunities during the summer vacation and cold-emailed Wingify’s careers email with my profile and project experience. Shortly after, I received an OA to complete. I cleared the OA and then got subsequent interview calls. For the interviews, I specifically prepared JavaScript in depth, as the role was for a Frontend Intern.
Application story
I was looking for off-campus internship opportunities during the summer vacation and cold-emailed Wingify’s careers email with my profile and project experience. Shortly after, I received an OA to complete. I cleared the OA and then received subsequent interview calls. The first round was of medium difficulty, but I answered both problems. In the second round, a medium-level problem was asked, which I answered almost correctly. I was rejected in the second round.
Preparation
Duration: 1 month
Topics: JavaScript, HTML, CSS, DSA (Problem Solving)
Tip
Tip

Tip 1: Initially, focus on mastering JavaScript fundamentals.

Tip 2: Gradually learn TypeScript and other relevant libraries.

Application process
Where: Company Website
Eligibility: You need a few development projects on your resume. (Stipend: 25K per month)
Resume Tip
Resume tip

Tip 1: Have at least one strong web development project on your resume.

Tip 2: Do not include anything on your resume that you cannot explain.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 minutes
Interview date28 Jun 2025
Coding problem2

1. Check Is Fibonacci Number

Easy
20m average time
80% success
0/40
Asked in companies
AmazonTwitterMakeMyTrip

You are given an integer, all you have to do is to find whether this number is a Fibonacci number or not.

Fn is said to be a Fibonacci sequence such that each number in Fn is the sum of its two preceding numbers, starting with 0 and 1.

Fn = F(n-1) + F(n-2)

fn is said to be a Fibonacci number if it is a part of the Fn/Fibonacci sequence.

Try solving now

2. Reformat Date

Easy
15m average time
85% success
0/40
Asked in companies
Expedia GroupIntuitWingify

You are given a string ‘S’ representing a date in the “Day Month Year” format, where:

1. Day is represented as {"1st", "2nd", "3rd", "4th",”5th”, ...,”29th”, "30th", "31st"}.

2. Month is represented as {"Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"}.

3. Year is represented as {2020,2021 etc}
Your task is to convert the given date into “YYYY-MM-DD” format, where:
1. YYYY is a 4 digit year.

2. MM is a 2 digit month.

3. DD is a 2 digit day.

Note:

1. The given dates are guaranteed to be valid.

2. If you can’t represent a month in 2 digits then append  0 in front of the month. Eg: if the month is Jan, represent it as 01 and not as 1 in the answer.

3. If you can’t represent a day in 2 digits then append 0 in front of the day. Eg: if the day is 5, represent it as 05 and not as 5 in the answer.
Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date2 Jul 2025
Coding problem2

1. Promise Retry

Implement a function in JavaScript that retries a promise N times with a delay between each attempt.

Create a retryWithDelay function that repeatedly calls an API until the promise resolves or the maximum retry limit is reached. A delay should be applied between each retry.

Function Signature:
retryWithDelay(apiCall, maxRetries, delay)

Parameters:

  • apiCall → A function that returns a Promise
  • maxRetries → Maximum number of retry attempts (integer)
  • delay → Delay in milliseconds between retries (integer)

Return Value:

  • Returns a Promise
  • Resolves with the result of apiCall if it succeeds
  • Rejects if all retry attempts are exhausted

2. Number of occurrence

Moderate
26m average time
0/80
Asked in companies
DirectiSAP LabsAmazon

You have been given a sorted array/list of integers 'arr' of size 'n' and an integer 'x'.


Find the total number of occurrences of 'x' in the array/list.


Example:
Input: 'n' = 7, 'x' = 3
'arr' = [1, 1, 1, 2, 2, 3, 3]

Output: 2

Explanation: Total occurrences of '3' in the array 'arr' is 2.


Try solving now
03
Round
Medium
Face to Face
Duration30 minutes
Interview date17 Jul 2025
Coding problem1

1. Batch Execution

You are given an array of 1000 API functions, where each function returns a Promise.

Implement a function that executes these APIs in batches of a given size. All APIs in a batch must run in parallel, and the next batch should start only after the current batch completes. The results must be returned in the same order as the input APIs.

Function Signature:
async function callApisInBatches(apis, batchSize)

Parameters:

  • apis → An array of functions that return Promises
  • batchSize → Number of APIs to execute in each batch

Return Value:

  • Returns a Promise
  • Resolves to an array containing the results of all API calls in the same order as the input

Here's your problem of the day

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

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4898 views
0 comments
0 upvotes
company logo
Developer Engineer
2 rounds | 4 problems
Interviewed by Wingify
1810 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3639 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Wingify
337 views
0 comments
0 upvotes