Jd Sports Fashion Plc DOT NET Developer Interview Questions and Answers

Round duration - 90 Minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.

Q1. 
Minimum Cost to Buy Oranges Problem Statement
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...read more
Ans. 
Find the minimum cost to buy a specific weight of oranges using given cost list.
• Iterate through the cost list and find the minimum cost to achieve the desired weight

• Keep track of the minimum cost while considering available packet weights

• Return -1 if it is not possible to buy exactly W kg of oranges
Answered by AI
Add your answer
Q2. 
K - Sum Path In A Binary Tree
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...read more
Ans. 
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
• Traverse the binary tree using DFS and keep track of the current path and its sum.

• At each node, check if the current sum equals 'K' and add the path to the result if true.

• Continue traversal to the left and right child nodes recursively.

• Return the list of paths that sum up to 'K'.
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

This round majorly focused on puzzles and some questions revolving around Computer Networks and the projects in my resume .

Q1. You have two wires of different lengths that take different times to burn. How can you measure a specific amount of time using these two wires?
Ans. 
Use two wires of different lengths to measure a specific amount of time by burning them simultaneously.
• Burn both wires at the same time, one wire will burn faster than the other.

• Measure the time it takes for the faster burning wire to completely burn.

• Calculate the specific amount of time by using the ratio of the lengths of the two wires.
Answered by AI
Add your answer
Q2. You have 3 ants located at the corners of a triangle. The challenge is to determine the movement pattern of the ants if they all start moving towards each other. What will be the outcome?
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. What do you know about the company?
Add your answer
Q2. Why should we hire you?
Add your answer

2 qns. Dp and backtracking. Problems were medium level.

Q1. Sql, big data, one coding question , os concepts.
Add your answer

Q1. How will u see you after 5 years. Why walmart. Is sql better or firebase better.
Add your answer

Q1. What is your name?
Add your answer
Q2. My is gurasala bhoomika
Add your answer
Q3. What is your hobbies?
Add your answer
Q4. Watching TV, listing music
Add your answer
Q5. Explain finally year study?
Add your answer
Q6. I have studying audisankara institute of technology in guduru
Add your answer
Q7. Explain about intermediate ?
Ans. 
Intermediate refers to a level of proficiency or knowledge that falls between beginner and advanced.
• Intermediate level typically involves a deeper understanding of concepts and the ability to apply them in practical scenarios.

• Individuals at an intermediate level may have some experience in the field but still have room for growth and learning.

• Examples of intermediate skills include proficiency in a programming language...read more
Answered by AI
Add your answer
Q8. I have completed my intermediate in Narayanganj junior college in tirupati
Add your answer
Q9. Explain about ur SCC ?
Ans. 
SCC stands for Source Code Control. It is a system used to manage and track changes to source code files.
• SCC helps developers collaborate on code by providing version control and tracking changes.

• Popular SCC tools include Git, SVN, and Mercurial.

• SCC allows developers to revert to previous versions of code, track changes made by team members, and merge code changes seamlessly.

• SCC helps in maintaining code integrity and ...read more
Answered by AI
View 1 more answer
Q10. I have studied in nice English medium school In VarAdaiahpalem
Add your answer
Q11. What is your favourite colour ?
Add your answer
Q12. Who is your favourite teacher?
Add your answer
Q13. My favourite teacher is prasanna sir
Add your answer
Q14. What is your short term goal?
Add your answer
Q15. I want become a software developer
Add your answer
Q16. What is achievement?
Add your answer
Q17. I have got prices in 8 th
Add your answer
Q18. Which topic do you get?
Add your answer
Q19. Story telling topic
Add your answer
Q20. What is ur strength ?
Ans. 
My strength lies in my problem-solving skills and ability to learn quickly.
• Strong problem-solving skills

• Quick learner

• Adaptability to new technologies

• Ability to work well under pressure
Answered by AI
Add your answer
Q21. My knowledge is my power Communication skills Smart work
Add your answer
Q22. What can support you?
Ans. 
Support from my team, access to resources, clear communication
• Support from my team helps me stay motivated and overcome challenges

• Access to resources such as training materials and tools enables me to perform my job effectively

• Clear communication ensures that I understand project requirements and expectations
Answered by AI
Add your answer
Q23. My teachers,my brother
Add your answer
Q24. What is popular temple in ur village?
Ans. 
The popular temple in my village is the Sri Ranganathaswamy Temple.
• Located in the heart of the village

• Dedicated to Lord Ranganatha

• Annual festivals and rituals attract devotees from neighboring villages
Answered by AI
Add your answer
Q25. The popular temple is god shiva
Add your answer
Q26. How many languages do know?
Ans. 
I am proficient in 5 programming languages including Java, Python, C++, JavaScript, and SQL.
• Java

• Python

• C++

• JavaScript

• SQL
Answered by AI
Add your answer
Q27. I know Telugu, hindi
Add your answer
Q28. What is the best in you?
Add your answer
Q29. I can do smart work
Add your answer
Q30. Why want hire you?
Add your answer
Q31. I can communicate with people well manner
Add your answer
Q32. What is the best memory in frist year?
Add your answer
Q33. My birthday can do well
Add your answer
Q34. What much salary expectations?
Add your answer
Q35. I expections 4000
Add your answer
Q36. What can do frist salary?
Add your answer
Q37. I enjoy my self.i go to my parents
Add your answer

Q1. Simple domain related knowledge and design some basic project
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were a bit lengthy but the implementation part was quite easy .

Q1. 
Encode the Message Problem Statement
Given a text message, your task is to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings, repres...read more
Ans. 
Implement a function to encode a text message using run-length encoding.
• Iterate through the message and count consecutive characters

• Append the character and its count to the encoded message

• Handle edge cases like single characters or empty message
Answered by AI
Add your answer
Q2. 
Make All Elements of the Array Distinct
Given an array/list ARR of integers with size 'N', your task is to determine the minimum number of increments needed to make all elements of the array distinct. You...read more
Ans. 
Find the minimum number of increments needed to make all elements of the array distinct by increasing any element by 1 in each operation.
• Iterate through the array and keep track of the frequency of each element.

• For each element with frequency greater than 1, increment it until it becomes distinct.

• Return the total number of operations needed to make all elements distinct.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

This Round was DS/Algo + Core round and it started with formal introduction, followed by 3 problems. We first dicussed the
approach the time complexity and proper code covering all cases for the 2 coding problems . The last question was related to OS and was a bit theoretical .

Q1. 
Distinct Characters Problem Statement
Given a string STR, return all possible non-empty subsequences with distinct characters. The order of the strings returned is not important.
Example:
Input:
STR = ...read more
Ans. 
Return all possible non-empty subsequences with distinct characters from a given string.
• Use a recursive approach to generate all possible subsequences with distinct characters.

• Keep track of the characters used in each subsequence to ensure uniqueness.

• Return the generated subsequences as an array of strings.
Answered by AI
Add your answer
Q2. 
Calculate Score of Balanced Parentheses
In this intellectual game, Ninja is provided with a string of balanced parentheses called STR. The aim is to calculate the score based on specific game rules. If Nin...read more
Ans. 
Calculate the score of a string of balanced parentheses based on specific game rules.
• Iterate through the string and keep track of the score based on the rules provided

• Use a stack to keep track of the scores of valid parentheses expressions

• For each '()', increment the score by 1; for '(x)', double the score of x

• Return the final computed score for the string
Answered by AI
Add your answer
Q3. Can you explain demand paging?
Ans. 
Demand paging is a memory management technique where pages are loaded into memory only when they are needed.
• Pages are loaded into memory on demand, rather than all at once.

• Helps in reducing the amount of physical memory needed.

• Improves overall system performance by allowing more processes to run simultaneously.

• Commonly used in modern operating systems like Linux and Windows.

• Example: When a program is executed, only the...read more
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

I was given 2 preety good questions of DSA in this round . One was related to Binary Trees and the other was a good DP problem in which I struggled a bit but with some hints I was able to solve this problem too . The last question was related to OOPS and was preety easy .

Q1. 
Binary Tree Construction from Traversals Problem
Given the POSTORDER and PREORDER traversals of a binary tree, where the tree consists of N nodes with each node representing a distinct positive integer fr...read more
Ans. 
Construct a binary tree from given POSTORDER and PREORDER traversals.
• Use the first element in PREORDER as the root node

• Find the root node in POSTORDER to divide the tree into left and right subtrees

• Recursively construct left and right subtrees using the divided traversals
Answered by AI
Add your answer
Q2. 
Minimum Cost to Buy Oranges Problem Statement
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...read more
Ans. 
Find the minimum cost to buy a specific weight of oranges given the cost of different weight packets.
• Iterate through the list of costs and find the minimum cost to achieve the desired weight.

• Keep track of the minimum cost for each weight up to the desired weight.

• Handle cases where a specific weight packet is unavailable by setting the cost to infinity.

• Return the minimum cost for the desired weight, or -1 if it is not p
Answered by AI
Add your answer
Q3. Can you explain the concepts of static and dynamic polymorphism in Object-Oriented Programming?
Ans. 
Static polymorphism is achieved at compile time through method overloading and overriding. Dynamic polymorphism is achieved at runtime through method overriding.
• Static polymorphism is also known as compile-time polymorphism.

• Dynamic polymorphism is also known as runtime polymorphism.

• Static polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.

• Dynamic poly...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. Why should we hire you?
Add your answer
Q2. What do you know about the company?
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The platform was HackerEarth time duration was 1 hour.
1.) 25 MCQs (Both Easy and Gate Level Based) 
2.) 1 Coding Question, that needs to be solved in O(logn) time. Program for Fibonacci numbers. The basic idea behind that question is we need to crack the pattern and then based on constraints we need to solve it.

Q1. 
Nth Fibonacci Number Problem Statement
Given an integer 'N', the task is to compute the N'th Fibonacci number using matrix exponentiation. Implement and return the Fibonacci value for the provided 'N'.
N...read more
Ans. 
Use matrix exponentiation to efficiently compute the Nth Fibonacci number modulo 10^9 + 7.
• Implement matrix exponentiation to calculate Fibonacci numbers efficiently.

• Use the formula F(n) = F(n-1) + F(n-2) with initial values F(1) = F(2) = 1.

• Return the result modulo 10^9 + 7 to handle large Fibonacci numbers.

• Optimize the solution to achieve better than O(N) time complexity.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

It was a technical round. The platform was Zoom time duration was 40 mins. Started with Tell me something about yourself.
 

Q1. 
Similar Strings Problem Statement
Determine whether two given strings, A and B, both of length N, are similar by returning a 1 if they are, otherwise return a 0.
Explanation:
String A is similar to stri...read more
Ans. 
Determine if two strings are similar based on given conditions.
• Check if the strings are equal first.

• Then check if the strings can be divided into two halves with similar patterns.

• Return 1 if the strings are similar, 0 otherwise.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom time duration was 1 hour 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms, so she was like let’s start with trees then.

 

Round duration - 30 minutes
Round difficulty - Medium

This was a Hiring Manager Round. The platform was Zoom time duration was 30 mins. Started with Tell me something about yourself.


 

Round duration - 20 minutes
Round difficulty - Easy

The platform was Zoom time duration was 20 mins. Asked me to give my introduction.

 

Round duration - 120 minutes
Round difficulty - Medium

This was the online round held at Hackerearth. All students who met the eligibility criteria were shared link for the online test on hackerearth.

Q1. 
Remove Consecutive Duplicates Problem Statement
Given a string str of size N, your task is to recursively remove consecutive duplicates from this string.
Input:
T (number of test cases)
N (length of the ...read more
Ans. 
Recursively remove consecutive duplicates from a given string.
• Use recursion to check for consecutive duplicates in the string.

• If current character is same as next character, skip the next character.

• Repeat the process until no consecutive duplicates are found.
Answered by AI
Add your answer
Q2. 
Deepest Leaves Sum Problem Statement
Given a binary tree of integers, your task is to calculate the sum of all the leaf nodes present at the deepest level of this binary tree. If there are no such nodes, ...read more
Ans. 
Calculate the sum of leaf nodes at the deepest level of a binary tree.
• Traverse the binary tree to find the deepest level of leaf nodes.

• Sum the leaf nodes at the deepest level.

• Handle null nodes represented by -1.

• Ensure the sum fits within a 32-bit integer.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems.There were 2 interviewers. We first dicussed the approach the time complexity and proper code covering all cases.

Q1. 
Palindrome Permutation - Problem Statement
Determine if a permutation of a given string S can form a palindrome.
Example:
Input:
string S = "aab"
Output:
"True"
Explanation:
The permutation "aba" o...read more
Ans. 
Check if a permutation of a string can form a palindrome.
• Create a frequency map of characters in the string.

• Count the number of characters with odd frequencies.

• If there is at most one character with odd frequency, return true.

• Otherwise, return false.
Answered by AI
Add your answer
Q2. 
Word Presence in Sentence
Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.
Input:
The first line contains an in...read more
Ans. 
Check if a given word is present in a sentence as a complete word.
• Split the sentence into words using spaces as delimiter.

• Check if the given word matches any of the words in the sentence.

• Ensure that the word is not just a substring of another word in the sentence.
Answered by AI
Add your answer

Round duration - 30 mintues
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Question about basic engineering subjects and coding

Q1. Interview about technical question
Add your answer
Q2. Fabinocci series,trees
Add your answer