0% found this document useful (0 votes)
8 views2 pages

FullStack ASP - Net Coding Practice

The document outlines coding practice questions for a Full Stack Developer position, categorized into five main areas: Arrays & Strings, Hashing & Collections, Recursion & Dynamic Programming, Sorting & Searching, and Linked Lists. Each category includes specific problems to solve, such as reversing strings, finding duplicates, and implementing sorting algorithms. Additionally, it features SQL queries related to employee data management.

Uploaded by

Flames
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
0% found this document useful (0 votes)
8 views2 pages

FullStack ASP - Net Coding Practice

The document outlines coding practice questions for a Full Stack Developer position, categorized into five main areas: Arrays & Strings, Hashing & Collections, Recursion & Dynamic Programming, Sorting & Searching, and Linked Lists. Each category includes specific problems to solve, such as reversing strings, finding duplicates, and implementing sorting algorithms. Additionally, it features SQL queries related to employee data management.

Uploaded by

Flames
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

Full Stack Developer (ASP.

NET) - Coding Practice


Questions

Arrays & Strings


• Reverse a string without using built-in functions.
• Check if a string is a palindrome.
• Find the first non-repeating character in a string.
• Rotate an array by k steps.
• Find the maximum sum of a contiguous subarray (Kadane’s algorithm).

Hashing & Collections


• Find duplicates in an array using a HashSet.
• Count the frequency of elements in an array.
• Find two numbers in an array that add up to a target sum (Two Sum problem).
• Group anagrams from a list of words.
• Check if two strings are anagrams.

Recursion & Dynamic Programming


• Find the nth Fibonacci number using recursion and memoization.
• Solve the classic Tower of Hanoi problem.
• Find the longest common subsequence between two strings.
• Find the minimum number of coins for a given sum (Coin Change problem).
• Generate all subsets of a given set.

Sorting & Searching


• Implement binary search on a sorted array.
• Implement merge sort or quicksort.
• Search for an element in a rotated sorted array.
• Find the kth smallest element in an array.
• Find the intersection of two sorted arrays.

Linked Lists
• Reverse a linked list (iterative and recursive).
• Detect a cycle in a linked list using Floyd’s algorithm.
• Merge two sorted linked lists.
• Find the middle element of a linked list.
• Remove nth node from the end of a linked list.

SQL Queries
• Write a query to fetch the second highest salary from an Employee table.
• Fetch all employees who earn more than the average salary.
• Find duplicate rows in a table.
• Get the count of employees department-wise.
• Retrieve employees who joined in the last 30 days.

You might also like