Scribd
Upload
13 views6 pages

DSA Problems Service Based Companies Retry

The document lists various data structures and algorithms (DSA) problems categorized by difficulty levels (Easy, Medium, Hard) for service-based companies hiring candidates with salaries up to 5 LPA. It covers topics such as programming basics, arrays, strings, sorting, searching, recursion, linked lists, stacks and queues, hashing, bit manipulation, greedy algorithms, dynamic programming, time and space complexity, and basic math. Each category includes specific problems to practice, primarily focusing on easy-level challenges.

Uploaded by

Vamsi Prabha
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
13 views6 pages

DSA Problems Service Based Companies Retry

The document lists various data structures and algorithms (DSA) problems categorized by difficulty levels (Easy, Medium, Hard) for service-based companies hiring candidates with salaries up to 5 LPA. It covers topics such as programming basics, arrays, strings, sorting, searching, recursion, linked lists, stacks and queues, hashing, bit manipulation, greedy algorithms, dynamic programming, time and space complexity, and basic math. Each category includes specific problems to practice, primarily focusing on easy-level challenges.

Uploaded by

Vamsi Prabha
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/ 6

DSA Problems for Service-Based Companies (Up to 5 LPA)

Programming Basics

Easy:

- Print Fibonacci series

- Reverse a string

- Check if a number is prime

- Find the factorial of a number

- Sum of digits of a number

Medium:

Hard:

Arrays

Easy:

- Find the largest and smallest element in an array

- Rotate an array by K steps

- Find the missing number in an array

- Find the second largest element

- Move all zeroes to the end of the array

Medium:

Hard:

Strings
Easy:

- Reverse a string

- Check if a string is a palindrome

- Find the first non-repeating character

- Count the number of vowels in a string

- Find the longest common prefix

Medium:

Hard:

Sorting

Easy:

- Implement Bubble Sort

- Implement Insertion Sort

- Implement Selection Sort

- Sort an array of 0s, 1s, and 2s

- Count inversions in an array

Medium:

Hard:

Searching

Easy:

- Binary search in a sorted array

- Find the element in a rotated sorted array

- Search for an element in a 2D matrix


Medium:

Hard:

Recursion

Easy:

- Print all subsets of a set

- Factorial of a number using recursion

- Fibonacci sequence using recursion

- Tower of Hanoi

- Generate all permutations of a string

Medium:

Hard:

Linked List

Easy:

- Reverse a linked list

- Detect a cycle in a linked list

- Find the middle element of a linked list

- Merge two sorted linked lists

- Remove the Nth node from the end of the list

Medium:

Hard:
Stacks and Queues

Easy:

- Implement a stack using arrays/linked list

- Implement a queue using stacks

- Check for balanced parentheses using a stack

- Implement a circular queue

- Design a stack that supports push, pop, and retrieving the minimum element in constant time

Medium:

Hard:

Hashing

Easy:

- Find the first non-repeating character in a string

- Check if two strings are anagrams

- Count the frequency of elements in an array

- Find pairs with a given sum in an array

- Find the intersection of two arrays

Medium:

Hard:

Bit Manipulation

Easy:

- Check if a number is even or odd using bit manipulation


- Count the number of set bits in a number

- Find the only non-repeating element in an array where every other element repeats

- Find the XOR of all elements in an array

Medium:

Hard:

Greedy Algorithms

Easy:

- Activity Selection Problem

- Fractional Knapsack Problem

- Job Sequencing Problem

- Find the minimum number of coins for a given amount

Medium:

Hard:

Dynamic Programming (Basic)

Easy:

- Fibonacci series using DP

- 0/1 Knapsack problem

- Longest Common Subsequence (LCS)

- Coin Change Problem

- Minimum Path Sum in a grid

Medium:
Hard:

Time and Space Complexity

Easy:

- Analyze the time complexity of sorting algorithms

- Optimize an algorithm to reduce space complexity

Medium:

Hard:

Basic Math

Easy:

- Check if a number is prime

- Find GCD and LCM of two numbers

- Count the number of trailing zeroes in a factorial

- Check if a number is a perfect square

Medium:

Hard:

You might also like