Data-Structures-and-Algorithm

Regularly updating solution of Data Structure problems in Python

This repository contains famous interview questions and algorithms from geeksforgeeks, interviewbit and leetcode.

🌵 Folder Structure

Data-Structures

• Arrays/
  • check-if-an-array-is-a-subset-of-another-array.py
  • common-elements-of-3-sorted-arrays.py
  • count-elements-whose-frequency-is-more-than-n-by-k-times.py
  • cyclically-rotate-an-array-by-one.py
  • factorial-of-a-large-number.py
  • find-duplicate-in-an-array.py
  • find-union-of-two-arrays.py
  • Kadanes-algorithm.py
  • Kth-element-of-two-sorted-Arrays.py
  • kth-smallest-element-in-an-array.py
  • largest-sum-contiguous-subarray.py
  • longest-consecutive-subsequence.py
  • max-and-min-element-in-an-array.py
  • Maximum-profit-by-buying-and-selling-a-share-atmost-twice.py
  • merge-overlapping-intervals.py
  • minimize-the-difference-between-heights-of-tower.py
  • move-negative-numbers-to-one-side.py
  • repeat-and-missing-number-in-an-array.py
  • reverse-an-array.py
  • sort-0s-1s-2s-in-an-array.py
  • subarray-with-0-sum.py
  • triplet-sum-equals-to-k.py
• Bit-Manipulation/
  • Count-total-set-bits.py
• Dynamic-Programming/
  • Edit-Distance.py
• Graph/
  • Detect-cycle-in-undirected-graph.py
  • Topological-Sort.py
  • Water-connection-problem.py
• Greedy/
  • N-meetings-in-one-room.py
• Hashing/
  • Count-occurrences-of-Anagrams.py
  • Largest-subarray-with-zero-sum.py
• Heap/
  • Smallest-range-in-K-lists.py
• Linked-List/
  • Check-If-Circular-Linked-List.py
  • detect-a-loop-in-a-linked-list.py
  • Find-the-starting-point-of-the-loop..py
  • Middle-Of-The-Linked-List.py
  • Nth-node-from-end-of-linked-list.py
  • Remove-duplicate-element-from-sorted-Linked-List.py
  • Remove-loop-in-Linked-List.py
  • Reverse-a-Linked-List-in-groups-of-given-size.py
  • reverse-a-linked-list.py
• Maths/
  • Factorial-of-large-number.py
  • Restricted-pacman.py
  • Sum-of-Query-II.py
• Matrix/
  • search-an-element-in-a-matrix.py
  • set-matrix-zeros.py
• Searching-And-Sorting/
  • count-number-of-perfect-squares-between-1-and-n.py
  • Find-First-and-last-occurrences-of-X.py
  • find-majority-element.py
  • Find-Middle-of-Three-in-minimum-comparisons.py
  • Find-Missing-And-Repeating.py
  • Find-Pair-Given-Difference.py
  • Find-Value-equal-to-index-value.py
  • Median-of-2-sorted-arrays-of-different-sizes.py
  • Search-in-Rotated-Sorted-Array.py
• Stack/
  • sort-a-stack.py
• String/
  • check-if-the-string-is-palindrome.py
  • compare-version-numbers.py
  • Count-and-Say.py
  • Elixir-of-Life.py
  • Implement-strStr.py
  • longest-common-prefix.py
  • Maximum-difference-of-zeros-and-ones-in-binary-string.py
  • print-all-the-duplicates-and-their-count-in-the-string.py
  • Repeated-String-Match.py
  • reverse-the-string.py
  • valid-anagram.py
• Trees/
  • Check-for-BST.py
  • Check-Tree-Traversal.py
  • Vertical-Traversal-of-Binary-Tree.py
• Two-pointers/
  • Dam-of-Candies.py

Contribution

You can create a pull request if you think, you have a better solution with respect to complexities. For any other changes or queries, feel free to reach out to me.