Scribd
Upload
2 views

Complete Commonly Asked Coding Questions

The document lists commonly asked coding questions in Data Structures and Algorithms (DSA) for service-based companies. Key topics include algorithms for subarrays, linked lists, sorting, dynamic programming, and graph traversal. These questions are essential for candidates preparing for technical interviews in the software industry.

Uploaded by

Sanika Kemdhare
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Complete Commonly Asked Coding Questions

The document lists commonly asked coding questions in Data Structures and Algorithms (DSA) for service-based companies. Key topics include algorithms for subarrays, linked lists, sorting, dynamic programming, and graph traversal. These questions are essential for candidates preparing for technical interviews in the software industry.

Uploaded by

Sanika Kemdhare
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Commonly Asked Coding Questions in DSA for Service-Based Companies

1. Find the largest sum subarray (Kadane's Algorithm)

2. Reverse a linked list

3. Find the middle element of a linked list

4. Implement a stack using queues

5. Implement a queue using two stacks

6. Merge two sorted arrays

7. Find if a number is prime

8. Find the nth Fibonacci number (Dynamic Programming)

9. Detect a cycle in a linked list

10. Sort an array using quicksort

11. Sort an array using mergesort

12. Find the kth smallest/largest element in an array

13. Find the intersection of two arrays

14. Find the longest common subsequence (LCS)

15. Find the minimum number of coins required to make change (Dynamic Programming)

16. Find the number of paths in a maze (Dynamic Programming)

17. Implement depth-first search (DFS) and breadth-first search (BFS)

18. Find the shortest path in an unweighted graph (BFS)

19. Find the longest increasing subsequence

20. Check if a binary tree is balanced

You might also like