sodeep105 / 100-days-of-coding

A collection of interview problems with Solutions related to DSA

100 Days Of Coding

this repository contains Problems (with its solutions) related to Data Structures and Algorithms that are asked in coding interview

Table of Contents

1. Day 1- return whether any two numbers from the list add up to k.
2. Day 2- Unival Tree
3. Day 3- Sieve of Eratosthenes
4. Day 4- Minimum number of swaps required for arranging pairs adjacent to each other
5. Day 5- Rearrange characters in a string such that no two adjacent are same
6. Day 6- Minimum removals required to make intervals non-overlapping
7. Day 7- determine how many pairs of the line segments intersect
8. Day 8- reverse a directed graph
9. Day 9- longest subarray where all its elements are distinct
10. Day 10- find minimum element in rotated sorted array
11. Day 11- swap every two nodes in singly linked list
12. Day 12- Determine whether there exists a one-to-one mapping
13. Day 13- Given a circular array, compute its maximum subarray sum in O(n) time
14. Day 14- Implement a stack API using only a heap/priority queue
15. Day 15- shortest unique prefix
16. Day 16- find all starting indices in String which are anagrams
17. Day 17- GCD of n numbers
18. Day 18- find the majority element, which appears more than half the time of length of array
19. Day 19- minimum level sum
20. Day 20- largest subset that has every pair of elements that satisfies either i % j = 0 or j % i = 0
21. Day 21- swap even and odd bits of unsigned 8 bit integer
22. Day 22- smallest distance between any two words in string
23. Day 23- determine whether any permutation of string is a palindrome.
24. Day 24- shortest interval that covers all the intervals
25. Day 25- find duplicate (Pigeon hole principle)
26. Day 26- check if brackets are balanced
27. Day 27- swapping bits
28. Day 28- find square roots
29. Day 29- n-bit Gray Codes
30. Day 30- minimum edit distance
31. Day 31- clone singly linked list with random pointers
32. Day 32- validate binary search tree
33. Day 33- Two Sum in BST
34. Day 34- rotate linked list to kth place
35. Day 35- Singleton pattern with a twist
36. Day 36- Count frequency of each character in a string generated according to Markov Chain
37. Day 37- implement sparse array
38. Day 38- Find Permutations
39. Day 39- Minimum Sum Path in Binary Tree
40. Day 40- two unique elements in duplicates
41. Day 41- Minimally Connected Graph (Tree)
42. Day 42- minimum steps needed to reach end
43. Day 43- total flips for n coins
44. Day 44- Next Greater permutation (lexicographic order)
45. Day 45- level order traversal of binary tree
46. Day 46- nearest largest integer
47. Day 47- generate a number according to its probability
48. Day 48- uber question- direction and position rule verification
49. Day 49- partial equal subset sum
50. Day 50- Check if word is present in 2D-matrix horizontally or vertically
51. Day 51- Given a function f, and N return a debounced f of N milliseconds.
52. Day 52- Find nth perfect number whose sum of digits is 10
53. Day 53- print matrix spirally
54. Day 54- partition the linked list so that all nodes less than k come before nodes greater than or equal to k
55. Day 55- square the integers of sorted list and return list in sorted order
56. Day 56- merge overlapping intervals
57. Day 57- calculates the maximum profit you could have made from buying and selling stock
58. Day 58- merge K sorted Lists
59. Day 59- Restore IP Adresses
60. Day 60- Check if brackets are balanced
61. Day 61- longest increasing subsequence
62. Day 62- Encode and decode the string
63. Day 63- return x if b=1, return y if b=0 only using mathematical or bit operations
64. Day 64- find the intersecting node in two singly linked list
65. Day 65- find indexes of Palindrome Pairs
66. Day 66- determine whether linked list is palindrome or not
67. Day 67- Implement division of integers without using *, /, % operators
68. Day 68- Implement integer exponentiation. That is, implement the pow(x, y) function
69. Day 69- Find minimum number of rooms required (Meeting rooms II)
70. Day 70- Implement data structure for e-commerce site
71. Day 71- Implement Bit Array
72. Day 72- String can be shifted to get other string? (Rotate String)
73. Day 73- Longest Consequtive Sequence
74. Day 74- Minimum Coins needed to get sum (Coin Change)
75. Day 75- Maximum Path Sum (one Node to another Node)
76. Day 76- return Nth fibnacci sequence (classic fibonacci series)
77. Day 77- return true if array can become nondecrease by modifying 1 element
78. Day 78- get a random number from 0 to n-1 numbers excluding some numbers