Complete Coding Question Bank (Topic-wise)
Arrays:
Basic:
- Union of two arrays
- Sum of Series
- Accenture Binary Number 0 , 1
- Prime Number
- Min and Max in Array
Easy:
- check if arry is sorted and rotated
- Remove Duplicates in-place from Sorted Array
- Find Missing number in Array
- Move to zero
- Sort 0s, 1s and 2s
- Max consecutive ones
- Array Leaders
- Rotate array
- Intersection of two arrays
- Element with left side smaller and right side greater
- Frequencies of Limited Range Array Elements
- Frequency of the most recent element
- Food Distribution
- Maximum and minimum of an array using minimum number of comparisons
- 2D Array
Medium:
- Maximum Score from Subarray Minimums
- Max-so-far Count Problem
- 3 - Sum Problem
- Partition Equal Subset Sum
- Rotate matrix By 90 degree
- Best Time to Buy and Sell Stock
- Minimum Swaps
- Chocolate Problem
- Trapping Rain Water
- Kth Smallest
- Minimum Platforms
- Stock Span
Strings:
Basic:
- Merge two strings
Easy:
- String Reverse
- Check If The String Is A Palindrome
- Sum of numbers in string
- Extract the Number from the String
- Largest Odd Number in String
- Remove Duplicates
- Isomorphic Strings
- Convert String to LowerCase
- Nearest multiple of 10
- Count even substrings
- Check if two strings are k-anagrams or not
Medium:
- Rearrange String with Hashes Q1
- Factorials of large numbers
- First unique character in a string
- Reverse each word in a given string
- String to Integer
- Minimum Swaps for Bracket Balancing
- Rotate string
- Cutting Binary String
- Permutations of a given string
- Validate an IP Address
- Largest number in K swaps
- Character Balance Check {TCS NQT Coding Question 2023 - September Day 1 - Slot 1}
Hard:
- Little bear and strings
Recursion / Backtracking:
Basic:
- Print 1 To N Without Loop(Recursion)
Easy:
- Reverse a Stack (Recursion)
- Count Good Number(Recursion)
Medium:
- Generate all binary strings without consecutive 1-s
- Print all Subquences / Power Subset
- Word Search
Hard:
- N Queens
Linked List:
Basic:
- Count Linked List Nodes
- Doubly linked list Insertion at given position
Easy:
- k-th node from the end of the linked list
- Deletion in linkedlist
- Segregate Even And Odd Nodes In a Linked List
- Sort a linked list of 0s, 1s and 2s
- Intersection of Two Linked Lists
- Remove every k-th node of the linked list
- Link list cycle
- Flatten A Linked List
Medium:
- MergeSort Linked List
- Reverse Linked List
- Remove loop in Linked List
- Find Middle of the Linked List
Stack / Queue:
Easy:
- Stack Implementation Using Array
- Delete middle element from stack
- Stack using two queues
- Implement Queue using array
- Reverse Stack Using Recursion
Medium:
- Get minimum element from stack
- Next Greater Element
Binary Tree / BST:
Easy:
- Binary Search Trees
- Minimum element in BST
- Search in Binary tree
Medium:
- Insert a node in binary tree
- Delete node in BST
- construct a BST from preorder transversal
- kth Smallest element in a BST
Graph:
Easy:
- BFS of graph
- DFS of Graph
Medium:
- Longest Path In Directed Graph
- Detect cycle in undirect graph
- Detect cycle in direct graph
- Number of island
Matrix:
Easy:
- Transpose of Matrix
- Search in a matrix
Medium:
- Boolean Matrix
- Spirally traversing a matrix
Binary Search / Searching:
Easy:
- Binary Search in forest
- Book allocation
Heap:
Easy:
- Merge Two Binary Max Heaps
Medium:
- Kth Smallest
- Binary Heap Operations
- Sorted Matrix
Math / Numbers:
Easy:
- Fibonacci number
- Reverse Number
- Palindrom Number
- Convert a binary number to a decimal number.
- Convert Binary to Octal
- Convert Decimal to Binary Number
Dynamic Programming:
Easy:
- frog jump DP-3
- Subset Sums
Medium:
- Introduction to DP
- House robber DP-6
- Coin change
- Partitions with Given Difference DP-18
- Target sum DP-21
- Unique paths
Hard:
- Print all LCS sequences
- Matrix Chain Multiplication
Miscellaneous:
Hard:
- Travelling Salesman Problem
- Cake Distribution Problem
