Upload Button Icon Add office photos

Filter interviews by

Editorialist YX Software Developer Intern Interview Questions, Process, and Tips for Freshers

Updated 29 Nov 2021

Editorialist YX Software Developer Intern Interview Experiences for Freshers

1 interview found

I appeared for an interview before Nov 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Proctored Online Test On Mettl.

  • Q1. 

    Chocolate Distribution Problem

    You are given an array/list CHOCOLATES of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...

  • Ans. 

    Distribute chocolates among students to minimize difference between largest and smallest packets.

    • Sort the array of chocolates packets.

    • Use sliding window technique to find the minimum difference between largest and smallest packets.

    • Return the minimum difference as the output.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

There were two Interviewers.
Interview started with an introduction.
Questions were asked from my projects.
Questions from Linked Lists, Trees, Graphs were asked.

  • Q1. 

    Palindrome Linked List Problem Statement

    You are provided with a singly linked list of integers. Your task is to determine whether the given singly linked list is a palindrome. Return true if it is a pali...

  • Ans. 

    Check if a given singly linked list is a palindrome or not.

    • Use two pointers approach to find the middle of the linked list

    • Reverse the second half of the linked list

    • Compare the first half with the reversed second half to determine if it's a palindrome

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

More questions from DSA were asked.
Questions from DBMS, SQL, OS were asked in the end.

  • Q1. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Use a combination of hashmap and doubly linked list to efficiently implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly when inserting new items.

    • Ensure to handle the capacity constraint by evicting the least recently used item when the cache is full.

    • Implement get(...

  • Answered by AI
  • Q2. 

    M-Coloring Problem Statement

    Given an undirected graph as an adjacency matrix and an integer M, determine whether you can color the vertices of the graph using at most M colors such that no two adjacent v...

  • Ans. 

    The M-Coloring Problem involves coloring the vertices of a graph using at most M colors such that no two adjacent vertices share the same color.

    • Check if the graph can be colored using at most M colors without any adjacent vertices sharing the same color.

    • Use backtracking or graph coloring algorithms to solve the problem efficiently.

    • Ensure that the number of colors used is less than or equal to M.

    • Consider the constraints...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 8.5 CGPAEditorialist YX interview preparation:Topics to prepare for the interview - C++, OOPS, Data Structures, Algorithms,OS, DBMS Quantitative AptitudeTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Learn Data Structures and Algorithms. Practice atleast 300 (150 Medium + 100 Easy + 50 Hard) coding questions from Geeksforgeeks or Leetcode.
Tip 2 : Learn OOPS, OS, DBMS.
Tip 3 : Do atleast 2 projects.

Application resume tips for other job seekers

Tip 1 : Don't mention unnecessary things on resume.
Tip 2 : Be precise and use good template.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview in Mar 2017.

Interview Questionnaire 

5 Questions

  • Q1. Related to semiconductors, processors etc. were asked.
  • Q2. Strength
  • Q3. Weaknesses
  • Q4. Hobby
  • Q5. If there are 200 fishes in an aquarium. 99% are red. How many fishes have to be removed to make the red fishes 98 % in the aquarium?
  • Ans. 

    To make the red fishes 98%, 50 fishes have to be removed from the aquarium.

    • Calculate 1% of 200 fishes, which is 2 fishes.

    • To make the red fishes 98%, subtract 1% (2 fishes) from 99% (198 fishes).

    • To find the number of fishes to be removed, divide the difference by 1% (2 fishes).

    • Therefore, 50 fishes have to be removed to make the red fishes 98%.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 40 aptitude questions of variable difficulty. More questions revolved around topics like time and work, distance, speed, time, profit loss, age etc.
Tips: A regular and prior preparation will go a long way in determining a good test score.
Use tricks to solve the questions and calculations should be fast.
Duration: 30 minutes
Total Questions: 40

Round: Test
Experience: The questions weren't that tough when it came to programming. An example would be conversion of temperature from Celsius to Fahrenheit and vice versa. This was a question in my paper. So I'm hoping the difficulty would be more or less the same.
Tips: Do certified programming courses. They help you a lot in cracking good jobs.
Duration: 45 minutes
Total Questions: 3

Round: Puzzle Interview
Tips: This can be tough if you can't imagine scenarios and situations. So make sure you inculcate critical problem solving thinking in your everyday life. I feel that's the best way to do things in this round.

Round: Technical Interview
Experience: This was a short interview so not much happened.
Tips: Whatever you do just know your stuff properly.

Round: HR Interview
Experience: It was a simple interview. Basic questions and their basic answers helped me get through it.
Tips: The tip would be to stay positive in your approach while answering the questions

Skills: Technical Skills, Interpersonal Communication, Aptitude
College Name: VIT Vellore

I appeared for an interview in Feb 2017.

Interview Preparation Tips

Round: Test
Experience: It was a simple aptitude test in which around 150 students cleared the test.
Duration: 1 hour
Total Questions: 40

Round: Test
Experience: Three programs were given and we had to write the code in either java ,c or c++ and get the required output.Around 90 students cleared this round.
Duration: 1 hour 30 minutes
Total Questions: 3

College Name: VIT Vellore

I appeared for an interview in Mar 2017.

Interview Questionnaire 

5 Questions

  • Q1. Related to semiconductors, processors etc. were asked.
  • Q2. Strength
  • Q3. Weaknesses
  • Q4. Hobbies
  • Q5. If there are 200 fishes in an aquarium. 99% are red. How many fishes have to be removed to make the red fishes 98 % in the aquarium?
  • Ans. 

    To make the red fishes 98%, 50 fishes have to be removed from the aquarium.

    • Calculate 1% of 200 fishes to find the number of red fishes.

    • Subtract the number of red fishes from 200 to find the number of non-red fishes.

    • Calculate 2% of the total number of fishes to find the desired number of red fishes.

    • Subtract the desired number of red fishes from the current number of red fishes to find the number of fishes to be removed.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 40 aptitude questions of variable difficulty. More questions revolved around topics like time and work, distance, speed, time, profit loss, age etc.
Tips: A regular and prior preparation will go a long way in determining a good test score.
Use tricks to solve the questions and calculations should be fast.
Duration: 30 minutes
Total Questions: 40

Round: Test
Experience: The questions weren't that tough when it came to programming. An example would be conversion of temperature from Celsius to Fahrenheit and vice versa. This was a question in my paper. So I'm hoping the difficulty would be more or less the same.
Tips: Do certified programming courses. They help you a lot in cracking good jobs.
Duration: 45 minutes
Total Questions: 3

Round: Puzzle Interview
Tips: This can be tough if you can't imagine scenarios and situations. So make sure you inculcate critical problem solving thinking in your everyday life. I feel that's the best way to do things in this round.

Round: Technical Interview
Experience: This was a short interview so not much happened.
Tips: Whatever you do just know your stuff properly.

Round: HR Interview
Experience: It was a simple interview. Basic questions and their basic answers helped me get through it.
Tips: The tip would be to stay positive in your approach while answering the questions

Skills: Technical Skill, Interpersonal Communication, Aptitude
College Name: VIT Vellore

I appeared for an interview before May 2016.

Interview Preparation Tips

Round: Test
Experience: The test was conducted through Cocubes. It was moderately difficult. Some of the questions are time taking. We need to be decisive in attempting such questions.
Tips: Need to manage time properly. Should assess and choose which questions to attempt and which ones to leave.
Duration: 1 hour
Total Questions: 30

Round: Test
Experience: The three questions are of three different levels.

1. You will be given two numbers. The first one is the starting point and the second one is the ending point of a range of integers. You have to count the number of integers in that range which are divisible by the first number.

Ex : INPUT : 3 18
OUTPUT : 6

2. You will be given a number. You have to find the sum of the digits. If the sum exceeds 9, you have to add the digits of the sum recursively until you a get a single digit sum.

EX : INPUT : 9999
OUTPUT : 9

Explanation: 9999 => 9 +9+9+9=36 => 3+6 =9

3. You will be given an array of characters which include ( L, R , or a number in the range '0' to '9'). A ball is kept on a line of integers initially kept at zero. The ball has to execute the instructions sequentially as follows:
(i) If an 'L' character is encountered, the ;position of the ball has to be decremented.
(ii) If an 'R' character is encountered, the position of the ball has to be incremented.
(iii) If an integer (in the range '0' to '9) is encountered , we have to go to that index in the array and execute the instruction present in that index.

Finally, after all the instructions are executed, you have to print the final position of the ball.

EX : INPUT :
Number of instruction : 5
Instructions: LR1R2

OUTPUT : 3

Explanation :
(i) Initially, the ball is at 0. Since the 0th index in the array is 'L' , the ball moves to 0-1= -1 position.
(ii) The 1st index is 'R' hence, the position of the ball is -1 +1 = 0 position.
(iii) The 2nd index is '1', hence we have to go to index 1 in the array which is 'R', hence the new position is 0+1 =1.
(iv) The 3rd index is 'R', hence the new position is 1 +1 =2.
(v) The 4th index is '2' , hence we have to go to 2nd index is '1' , hence we have to go again to 1st index , which is 'R' hence the final position is 2+1 =3.

Tips: We need to solve all the three the problems to have better chances of clearing this round.
Duration: 1 hour
Total Questions: 3

Round: Technical Interview
Experience: The interview was focussed majorly on coding. It went for about 45min with around 10 coding problems given to solve. Some basics of Computer networking are also tested in this round.
Tips: Be prepared with some basics of networking. As the company's main focus is on Telecom, good knowledge in telecom and networking would be a big advantage.

Round: Technical Interview
Experience: This round was focused on the aptitude and reasoning skills. Some puzzles were given in this round. These puzzles are of moderately complex and are more common ones in interviews. Like the (find the heavier ball among three balls using a balance in min no. of attempts).
Tips: Sometimes the interviewer tries to confuse. You need to be confident with your answers and explaination.

Round: HR Interview
Experience: The interview was more of a traditional HR round. Majorly concentrated on the final year project, personal strengths and weaknesses.

Skills: Coding Skills, Computer Networking, C Language Basics
College Name: G Pulla Reddy College of Engineering & Technology

I appeared for an interview in Mar 2017.

Interview Questionnaire 

5 Questions

  • Q1. Related to semiconductors, processors etc. were asked.
  • Q2. Weaknesses
  • Q3. Strength
  • Q4. Hobby
  • Q5. If there are 200 fishes in an aquarium. 99% are red. How many fishes have to be removed to make the red fishes 98 % in the aquarium?
  • Ans. 

    To make the red fishes 98%, 50 fishes have to be removed from the aquarium.

    • Calculate 1% of 200 fishes to find out how many fishes represent 1%.

    • Multiply the result by 2 to find out how many fishes represent 2%.

    • Subtract the result from 200 to find out how many fishes represent 98%.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 40 aptitude questions of variable difficulty. More questions revolved around topics like time and work, distance, speed, time, profit loss, age etc.
Tips: A regular and prior preparation will go a long way in determining a good test score.
Use tricks to solve the questions and calculations should be fast.
Duration: 30 minutes
Total Questions: 40

Round: Test
Experience: The questions weren't that tough when it came to programming. An example would be conversion of temperature from Celsius to Fahrenheit and vice versa. This was a question in my paper. So I'm hoping the difficulty would be more or less the same.
Tips: Do certified programming courses. They help you a lot in cracking good jobs.
Duration: 45 minutes
Total Questions: 3

Round: Puzzle Interview
Tips: This can be tough if you can't imagine scenarios and situations. So make sure you inculcate critical problem solving thinking in your everyday life. I feel that's the best way to do things in this round.

Round: Technical Interview
Experience: This was a short interview so not much happened.
Tips: Whatever you do just know your stuff properly.

Round: HR Interview
Experience: It was a simple interview. Basic questions and their basic answers helped me get through it.
Tips: The tip would be to stay positive in your approach while answering the questions

Skills: Technical Skill, Interpersonal Communication, Aptitude
College Name: VIT Vellore

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

This was a 2 hour round consisting of 5 mcqs and 2 codes. The mcqs were pretty much simple based on DS, DBMS, OS, OOP, and C.

  • Q1. 

    Rabbit Jumping Problem

    Consider 'n' carrots numbered from 1 to 'n' and 'k' rabbits. Each rabbit jumps to carrots only at multiples of its respective jumping factor Aj (i.e., Aj, 2Aj, 3Aj, ...), for all ra...

  • Ans. 

    Calculate uneaten carrots by rabbits with specific jumping factors.

    • Iterate through each carrot and check if any rabbit jumps on it.

    • Use the jumping factors to determine which carrots are eaten.

    • Subtract the eaten carrots from the total to get the uneaten count.

  • Answered by AI
  • Q2. 

    Flip Bits Problem Explanation

    Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...

  • Ans. 

    Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.

    • Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.

    • Consider flipping a sub-array from index i to j by changing 0s to 1s and vice versa.

    • Update the maximum count of 1s if the current count after flipping is greater.

    • Return the maximum count of 1s obtained by flipping a sub-array

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Started with a brief discussion on my projects and internships. A thorough discussion on whichever languages, frameworks I had used in my projects. Followed by discussion on coding questions. Apart from the codes there were some questions on OS, process stack, heap memory in Java, Garbage collection, OOP principles and comparison based sorting

  • Q1. 

    Sum of Maximum and Minimum Elements Problem Statement

    Given an array ARR of size N, your objective is to determine the sum of the largest and smallest elements within the array.

    Follow Up:

    Can you achie...

  • Ans. 

    Find sum of maximum and minimum elements in an array with least number of comparisons.

    • Iterate through the array and compare each element with current maximum and minimum to update them.

    • Initialize max as smallest possible value and min as largest possible value.

    • Return the sum of max and min after iterating through the array.

  • Answered by AI
  • Q2. 

    Invert a Binary Tree Problem Statement

    Given a Binary Tree and one of its leaf nodes, invert the binary tree by following these guidelines:

    • The given leaf node becomes the root after the inversion. • F...
  • Ans. 

    Invert a binary tree based on a given leaf node as the root.

    • Start by finding the leaf node in the binary tree.

    • Move the left child of the leaf node to the right side of the leaf node.

    • Make the parent of the leaf node the left child of the leaf node.

    • Repeat the process for each test case.

    • Return the inverted binary tree in level order format.

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Questions based on programming, DBMS and puzzles were asked in this round.

  • Q1. 

    Rearrange Array to Form Largest Number

    Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.

    ...

  • Ans. 

    Rearrange the array elements to form the largest possible number by concatenating them.

    • Sort the array elements in a custom way where the concatenation of two numbers results in a larger number.

    • Use a custom comparator function while sorting the array elements.

    • Convert the sorted array elements to a single string to get the largest possible number.

  • Answered by AI
  • Q2. What is indexing in the context of databases?
  • Ans. 

    Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.

    • Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.

    • They work similar to the index in a book, allowing the database to quickly find the relevant data without having to scan the entire table.

    • Examples of indexes include ...

  • Answered by AI
  • Q3. What are the advantages of B+ Trees in database management systems?
  • Ans. 

    B+ Trees are advantageous in database management systems due to their ability to efficiently store and retrieve data.

    • B+ Trees have a high fanout, allowing for more keys to be stored in each node, reducing the height of the tree and improving search performance.

    • B+ Trees are balanced trees, ensuring that operations like search, insertion, and deletion have a predictable time complexity of O(log n).

    • B+ Trees are optimized ...

  • Answered by AI
Round 4 - Video Call 

Round duration - 45 minutes
Round difficulty - Medium

Puzzles and HR based questions were asked in this round.
He asked questions like : what are my career goals, what do you look forward to in a boss , how do you see yourself in 5 years ,etc etc .

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMyntra interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more

Final outcome of the interviewRejected

Skills evaluated in this interview

Software Developer Interview Questions & Answers

Myntra user image Thommandru Vishnu

posted on 10 Mar 2015

Interview Questionnaire 

9 Questions

  • Q1. All the leaf nodes of tree are doubly linked,print only the leaf nodes of a tree
  • Ans. 

    Print only the leaf nodes of a doubly linked tree.

    • Traverse the tree and check if a node has no children and both left and right pointers are null.

    • If yes, then it is a leaf node and print it.

    • If no, then continue traversing the tree.

    • Use recursion to traverse the tree in a depth-first manner.

  • Answered by AI
  • Q2. LRU page Replacement Algorithm for large data
  • Ans. 

    LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.

    • LRU stands for Least Recently Used

    • It is a cache eviction algorithm

    • It is used to manage memory in operating systems

    • It works by keeping track of the pages that are used recently and the ones that are not

    • When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time

  • Answered by AI
  • Q3. Given a linked list with 2 parameters m,n. Now start reversing the m nodes and leave n nodes and continue it till u reach the end
  • Ans. 

    Reverse m nodes and leave n nodes in a linked list till the end.

    • Traverse the linked list till m nodes and reverse them

    • Traverse n nodes and continue reversing m nodes

    • Repeat the above step till the end of the linked list

    • Handle edge cases like m or n being greater than the length of the linked list

  • Answered by AI
  • Q4. Inorder Traversal of a tree
  • Ans. 

    Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.

    • Start at the root node

    • Traverse the left subtree recursively

    • Visit the root node

    • Traverse the right subtree recursively

    • Repeat until all nodes have been visited

  • Answered by AI
  • Q5. Inorder Travesal of a tree without recursion(write the code)
  • Ans. 

    Inorder traversal of a tree without recursion

    • Create an empty stack and initialize current node as root

    • Push the current node to stack and set current = current.left until current is NULL

    • If current is NULL and stack is not empty, pop the top item from stack, print it and set current = popped_item.right

    • Repeat step 2 and 3 until stack is empty

  • Answered by AI
  • Q6. Given an array of numbers in which duplicates are there and one triplicate is there. find that number
  • Ans. 

    Find the triplicate number in an array of duplicates.

    • Iterate through the array and keep track of the frequency of each number.

    • Return the number that appears three times.

    • If no number appears three times, return null.

  • Answered by AI
  • Q7. Explain all the serach algorithm you know with space and Time complexities
  • Ans. 

    Explanation of search algorithms with their space and time complexities.

    • Linear Search - O(n) time complexity, O(1) space complexity

    • Binary Search - O(log n) time complexity, O(1) space complexity

    • Jump Search - O(√n) time complexity, O(1) space complexity

    • Interpolation Search - O(log log n) time complexity, O(1) space complexity

    • Exponential Search - O(log n) time complexity, O(1) space complexity

    • Fibonacci Search - O(log n)

  • Answered by AI
  • Q8. Given a situation and asks you which search algorithm suits the best in that situation
  • Q9. Given an array of length n and in which numbers from 1-n will be there and each number can repeat any number of times find out which repeated more number of times
  • Ans. 

    Find the most repeated number in an array of length n with numbers 1-n.

    • Create a dictionary to store the count of each number in the array

    • Iterate through the array and update the count in the dictionary

    • Find the key with the highest count in the dictionary

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: Basically, it's not resume shortlist, it's a 9 pointer shortlist

Round: Test
Experience: The Entire Test is held in HackerRank Platform. it has
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
it took me 30 min for each coding questions.I was not known that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic c and c++ concepts
Duration: 120 minutes
Total Questions: 7

Round: Technical Interview
Experience: It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.There are 2 more questions which I haven't mentioned.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.

Round: Technical Interview
Experience: The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Tips: Go to the website -----/ and study all the interview questions and modules

Round: HR Interview
Experience: It's Technical+ HR interview all the technical questions went around resume. it went around 45 minutes they are very particular about what you wrote in the resume.HR questions are general like
whats your future plans
where will u see yourself in the office after 5 years?
Tips: please make sure that whatever you write in resume should be known to you very well.Don't write false things about yourself.And make sure you know completely about the projects you are going to write in resume(atleast the part you worked)

General Tips: Be sure of what you are saying. Don't be tensed and answer to your best.
Skills: Programming, Data Structures
College Name: VIT VELLORE

Skills evaluated in this interview

Interview Questionnaire 

12 Questions

  • Q1. What is the difference between get and post?
  • Ans. 

    GET is used to retrieve data from a server, while POST is used to send data to a server.

    • GET requests are idempotent, meaning they can be repeated without changing the result

    • POST requests are not idempotent and can have side effects on the server

    • GET requests can be cached by the browser, while POST requests cannot

    • GET requests have limitations on the amount of data that can be sent, while POST requests have no limitation...

  • Answered by AI
  • Q2. What is session in php?
  • Ans. 

    Session in PHP is a way to store and retrieve data for a user across multiple requests.

    • Sessions are used to maintain user-specific data on the server side.

    • A session is created for each user and is identified by a unique session ID.

    • Session data can be stored in server files or in a database.

    • Session variables can be accessed and modified throughout the user's session.

    • Sessions can be used to implement features like user a

  • Answered by AI
  • Q3. Where does session id is stored in php? How server identifies request has come from which client and many other related questions?
  • Ans. 

    Session ID is stored in PHP as a cookie or a query parameter.

    • Session ID can be stored as a cookie in the client's browser.

    • Session ID can also be stored as a query parameter in the URL.

    • The server identifies the client by retrieving the session ID from the cookie or query parameter.

    • The session ID is then used to retrieve the corresponding session data stored on the server.

    • The server can also use other methods like IP add

  • Answered by AI
  • Q4. Cookie in php? Size of the cookie, expiry etc?
  • Ans. 

    A cookie in PHP is a small piece of data stored on the client's computer. It has a size limit and an expiry date.

    • A cookie is used to store information on the client's computer for future use.

    • In PHP, cookies are set using the setcookie() function.

    • The size of a cookie is limited to 4KB.

    • Cookies can have an expiry date, after which they are no longer valid.

    • The expiry date can be set using the 'expires' parameter in the set...

  • Answered by AI
  • Q5. Memcache?
  • Q6. Myisam and Innnodb?
  • Q7. Triggers in mysql?
  • Ans. 

    Triggers in MySQL are database objects that are automatically executed in response to specified events.

    • Triggers are used to enforce business rules, maintain data integrity, and automate tasks.

    • They can be defined to execute before or after an INSERT, UPDATE, or DELETE operation.

    • Triggers can be written in SQL or in a programming language like PL/SQL.

    • Examples of trigger events include inserting a new record, updating a re...

  • Answered by AI
  • Q8. Overriding and Overloading?
  • Q9. Static class and static variable?
  • Q10. Singleton pattern and factory pattern?
  • Q11. Can constructor be declared as private?
  • Ans. 

    Yes, a constructor can be declared as private.

    • Declaring a constructor as private restricts its accessibility to only the class itself.

    • This can be useful in scenarios where you want to control the creation of objects of that class.

    • Private constructors are commonly used in singleton design pattern implementations.

    • Example: private constructor in a singleton class:

    • class Singleton { private Singleton() {} }

  • Answered by AI
  • Q12. Indexing in mysql?
  • Ans. 

    Indexing in MySQL improves the performance of database queries by creating a data structure that allows for faster data retrieval.

    • Indexes are created on one or more columns of a table.

    • They help in speeding up the search, sorting, and joining of data.

    • Indexes can be created using the CREATE INDEX statement.

    • Common types of indexes include B-tree, hash, and full-text indexes.

    • Indexes should be used judiciously as they consu...

  • Answered by AI

Interview Preparation Tips

Skills: PHP, Algorithm
College Name: NA

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP.
Tips : For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, I don't remember what it was but it was also pretty straight forward. For the test, I would recommend to solve problem from GFG. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.

  • Q1. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The task is to find the length of the longest common subsequence between two given strings.

    • Implement a function to find the longest common subsequence between two strings.

    • Use dynamic programming to solve this problem efficiently.

    • Iterate through the strings and build a matrix to store the lengths of common subsequences.

    • Return the length of the longest common subsequence found.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interview started off with questions on my general interest in Software Development. The first round had two coding questions, I was supposed to write the code on paper. 
For the questions, they asked me to code the solution first. And then gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.

  • Q1. 

    Add Two Numbers as Linked Lists

    You are given two singly linked lists, where each list represents a positive number without any leading zeros.

    Your task is to add these two numbers and return the sum as ...

  • Ans. 

    Add two numbers represented as linked lists and return the sum as a linked list.

    • Traverse both linked lists simultaneously while keeping track of carry from previous sum

    • Create a new linked list to store the sum, updating the value and carry as needed

    • Handle cases where one linked list is longer than the other by adding remaining digits with carry

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if I knew graph algorithms. Since I knew BFS and DFS, I told them. They asked the difference between the two. Then they asked me if I knew how to find the shortest distance between two points in a graph. I didn't know Dijkstra's properly but I knew it worked on the greedy approach so was able to tell that. Then they asked me how would I find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.

  • Q1. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal in a disconnected graph starting from vertex 0.

    • Use a queue to keep track of nodes to visit next in BFS traversal

    • Start traversal from vertex 0 and explore its neighbors first

    • Continue exploring neighbors level by level until all nodes are visited

    • Ensure to print connected nodes in numerical sort order

  • Answered by AI
  • Q2. 

    DFS Traversal Problem Statement

    Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...

  • Ans. 

    DFS traversal to find connected components in an undirected and disconnected graph.

    • Perform DFS traversal on each vertex to find connected components

    • Maintain a visited array to keep track of visited vertices

    • Print the vertices of each connected component in ascending order

  • Answered by AI
  • Q3. 

    Dijkstra's Shortest Path Problem

    Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.

    • Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Update the distances of neighboring nodes based on the current node's distance and edge weight...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA, Eligible branches : Computer Science & Engineering, Mathematics & Computing, Electrical Engineering and Electronics & Communication Engineering.Myntra interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Be thorough with Data Structures and Algorithms and also with your resume.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 4 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Tell us how to improve this page.

Interview Questions from Similar Companies

Myntra Interview Questions
4.0
 • 215 Interviews
AmbitionBox Interview Questions
4.9
 • 151 Interviews
HCL Infosystems Interview Questions
3.9
 • 140 Interviews
Shoppers Stop Interview Questions
4.1
 • 112 Interviews
Webdew Interview Questions
4.5
 • 106 Interviews
Data Entry Interview Questions
4.1
 • 97 Interviews
HyScaler Interview Questions
4.5
 • 91 Interviews
View all
QA Lead
8 salaries
unlock blur

₹19 L/yr - ₹25 L/yr

Operations Associate
7 salaries
unlock blur

₹5 L/yr - ₹7.2 L/yr

Senior Software Developer
4 salaries
unlock blur

₹22 L/yr - ₹53 L/yr

Senior Associate Operations
4 salaries
unlock blur

₹6.8 L/yr - ₹7.7 L/yr

Software Engineer
3 salaries
unlock blur

₹15 L/yr - ₹20 L/yr

Explore more salaries
Compare Editorialist YX with

Myntra

4.0
Compare

Koovs

4.2
Compare

Vogue

4.3
Compare

Elle India

4.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview