Update appNew update is available. Click here to update.
Graduate Trainee
Freshworks
upvote
share-icon
3 rounds | 5 Coding problems
views
0 views
comment
0 comments
upvote
5 upvotes
Interview preparation journey
expand-icon
Preparation
Duration: 3 months
Topics: Data Structures & Algorithms, Operating System, Object-Oriented Programming System, DBMS, CN
Tip
Tip

Tip 1 : Prepare DSA well and I personally recommend Coding Ninjas and GeeksForGeeks for interview preparation.
Tip 2 : Be confident & relaxed during the interview.
Tip 3 : Do revise your projects i.e how it works and what are its functionalities.

Application process
Where: Referral
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Make your resume short and try to make it one page only and mention all your skills that you are confident in.
Tip 2 : Do not put false things on your resume.

Interview rounds
01
Round
Medium
Online Coding Test
Duration90 minutes
Interview date26 May 2022
Problems2
Wildcard Pattern Matching

Given a text and a wildcard pattern of size N and M respectively, implement a wildcard pattern matching algorithm that finds if the wildcard pattern is matched...

view more
Problem approach

Try to use Dynamic programming

Try solving now
Longest Common Subsequence

Given two strings, 'S' and 'T' with lengths 'M' and 'N', find the length of the 'Longest Common Subsequence'.

view more
Problem approach

By using Memorization Approach

Try solving now
02
Round
Medium
Online Coding Test
Duration90 minutes
Interview date6 Jun 2022
Problems2
Left View Of Binary Tree

Given a binary tree. Print the Left View of the Tree.

Example :
If the input tree is as depicted in the picture: 

view more
Problem approach

By using Level Order traversal (BFS)

Try solving now
Ninja And Stops

Ninja wants to travel from his house to a given destination, which is ‘X’ miles from his hou...

view more
Problem approach

By Using Priority Queue

Try solving now
03
Round
Medium
Face to Face
Duration60 minutes
Interview date30 Jun 2022
Problems1
K-Palindrome

You are given a string ‘str’. You need to find out whether the string is a K-Palindrome or not.

A string is called a K-Palindrome if, after removing at mos...

view more
Problem approach

Solve this question by using Two Pointers
Interviewer also gave some hints.

Try solving now
Start a Discussion
Similar interview experiences
company logo
Software Developer
2 rounds | 4 problems
Interviewed by Freshworks
1120 views
0 comments
0 upvotes
company logo
Graduate Trainee
5 rounds | 10 problems
Interviewed by Freshworks
272 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 4 problems
Interviewed by Freshworks
0 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Freshworks
49 views
0 comments
0 upvotes
Companies with similar interview experiencs
company logo
Graduate Trainee
4 rounds | 4 problems
Interviewed by reliance jio platform
1084 views
0 comments
0 upvotes
company logo
Graduate Trainee
3 rounds | 7 problems
Interviewed by Tata Consultancy Services (TCS)
289 views
0 comments
0 upvotes
company logo
Graduate Trainee
3 rounds | 3 problems
Interviewed by Tata Consultancy Services (TCS)
0 views
0 comments
0 upvotes