Dish Network Interview Questions, Process, and Tips

Q1. Question about why dish
Add your answer

Q1. Sort linkedlist
Ans. 
Sort a linked list
• Use merge sort or quick sort for efficient sorting

• Implement a sorting algorithm that works well with linked lists

• Consider the time and space complexity of the sorting algorithm
Answered by AI
Add your answer

Q1. Basic domain related questions. Understanding our skills etc
Add your answer

Q1. On shore- full scenario wise
Add your answer
Q2. 1.Did you ever failed 2How did you correct it 3.what things you will continue doing and what things you wont do etc
Add your answer

Q1. Simple discussion-skip level
Add your answer

Q1. Simple hr discussion
Add your answer

String programming manual testing jeans

Q1. String programming questions
Add your answer

Q1. Coin change problem and loop in linked list
Ans. 
Coin change problem involves finding the minimum number of coins required to make a given amount of change. Loop in linked list is a traversal technique.
• Coin change problem can be solved using dynamic programming approach

• Loop in linked list can be implemented using a while loop or a for loop

• Coin change problem can be extended to include finding the actual coins used to make the change

• Loop in linked list can be used to ...read more
Answered by AI
Add your answer

Q1. Valid parenthesis and min stack problem
Ans. 
Valid parenthesis and min stack problem
• Valid Parenthesis problem involves checking if a given string of parentheses is valid or not

• Min Stack problem involves designing a stack that supports push, pop, top, and retrieving the minimum element in constant time

• Both problems can be solved using stack data structure

• Valid Parenthesis problem can be solved by pushing opening brackets onto the stack and popping them when a clos...read more
Answered by AI
Add your answer

Q1. Show your confidence about tech skills.
Add your answer

Q1. Salary discussion and Normal HR questions
Add your answer

Hackerrank Based coding round

Q1. Magic Square coding was requested
Add your answer
Q2. Pattern matching of braces
Ans. 
Pattern matching of braces involves checking if the opening and closing braces are properly nested.
• Use a stack data structure to keep track of opening braces

• Iterate through the string and push opening braces onto the stack

• When a closing brace is encountered, pop from the stack and check if it matches the corresponding opening brace

• If stack is empty at the end and all braces are matched, the pattern is valid
Answered by AI
Add your answer