| Skip to content | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#start-of-content |
|
| https://patch-diff.githubusercontent.com/ |
|
Sign in
| https://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Fscubeaitech-admin%2FDataStructuresAlgorithms |
| GitHub CopilotWrite better code with AI | https://github.com/features/copilot |
| GitHub SparkBuild and deploy intelligent apps | https://github.com/features/spark |
| GitHub ModelsManage and compare prompts | https://github.com/features/models |
| MCP RegistryNewIntegrate external tools | https://github.com/mcp |
| ActionsAutomate any workflow | https://github.com/features/actions |
| CodespacesInstant dev environments | https://github.com/features/codespaces |
| IssuesPlan and track work | https://github.com/features/issues |
| Code ReviewManage code changes | https://github.com/features/code-review |
| GitHub Advanced SecurityFind and fix vulnerabilities | https://github.com/security/advanced-security |
| Code securitySecure your code as you build | https://github.com/security/advanced-security/code-security |
| Secret protectionStop leaks before they start | https://github.com/security/advanced-security/secret-protection |
| Why GitHub | https://github.com/why-github |
| Documentation | https://docs.github.com |
| Blog | https://github.blog |
| Changelog | https://github.blog/changelog |
| Marketplace | https://github.com/marketplace |
| View all features | https://github.com/features |
| Enterprises | https://github.com/enterprise |
| Small and medium teams | https://github.com/team |
| Startups | https://github.com/enterprise/startups |
| Nonprofits | https://github.com/solutions/industry/nonprofits |
| App Modernization | https://github.com/solutions/use-case/app-modernization |
| DevSecOps | https://github.com/solutions/use-case/devsecops |
| DevOps | https://github.com/solutions/use-case/devops |
| CI/CD | https://github.com/solutions/use-case/ci-cd |
| View all use cases | https://github.com/solutions/use-case |
| Healthcare | https://github.com/solutions/industry/healthcare |
| Financial services | https://github.com/solutions/industry/financial-services |
| Manufacturing | https://github.com/solutions/industry/manufacturing |
| Government | https://github.com/solutions/industry/government |
| View all industries | https://github.com/solutions/industry |
| View all solutions | https://github.com/solutions |
| AI | https://github.com/resources/articles?topic=ai |
| Software Development | https://github.com/resources/articles?topic=software-development |
| DevOps | https://github.com/resources/articles?topic=devops |
| Security | https://github.com/resources/articles?topic=security |
| View all topics | https://github.com/resources/articles |
| Customer stories | https://github.com/customer-stories |
| Events & webinars | https://github.com/resources/events |
| Ebooks & reports | https://github.com/resources/whitepapers |
| Business insights | https://github.com/solutions/executive-insights |
| GitHub Skills | https://skills.github.com |
| Documentation | https://docs.github.com |
| Customer support | https://support.github.com |
| Community forum | https://github.com/orgs/community/discussions |
| Trust center | https://github.com/trust-center |
| Partners | https://github.com/partners |
| GitHub SponsorsFund open source developers | https://github.com/sponsors |
| Security Lab | https://securitylab.github.com |
| Maintainer Community | https://maintainers.github.com |
| Accelerator | https://github.com/accelerator |
| Archive Program | https://archiveprogram.github.com |
| Topics | https://github.com/topics |
| Trending | https://github.com/trending |
| Collections | https://github.com/collections |
| Enterprise platformAI-powered developer platform | https://github.com/enterprise |
| GitHub Advanced SecurityEnterprise-grade security features | https://github.com/security/advanced-security |
| Copilot for BusinessEnterprise-grade AI features | https://github.com/features/copilot/copilot-business |
| Premium SupportEnterprise-grade 24/7 support | https://github.com/premium-support |
| Pricing | https://github.com/pricing |
| Search syntax tips | https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax |
| documentation | https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax |
|
Sign in
| https://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Fscubeaitech-admin%2FDataStructuresAlgorithms |
|
Sign up
| https://patch-diff.githubusercontent.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=scubeaitech-admin%2FDataStructuresAlgorithms |
| Reload | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms |
| Reload | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms |
| Reload | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms |
|
scubeaitech-admin
| https://patch-diff.githubusercontent.com/scubeaitech-admin |
| DataStructuresAlgorithms | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms |
| bollwarm/DataStructuresAlgorithms | https://patch-diff.githubusercontent.com/bollwarm/DataStructuresAlgorithms |
|
Notifications
| https://patch-diff.githubusercontent.com/login?return_to=%2Fscubeaitech-admin%2FDataStructuresAlgorithms |
|
Fork
0
| https://patch-diff.githubusercontent.com/login?return_to=%2Fscubeaitech-admin%2FDataStructuresAlgorithms |
|
Star
0
| https://patch-diff.githubusercontent.com/login?return_to=%2Fscubeaitech-admin%2FDataStructuresAlgorithms |
|
0
stars
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/stargazers |
|
322
forks
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/forks |
|
Branches
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/branches |
|
Tags
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/tags |
|
Activity
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/activity |
|
Star
| https://patch-diff.githubusercontent.com/login?return_to=%2Fscubeaitech-admin%2FDataStructuresAlgorithms |
|
Notifications
| https://patch-diff.githubusercontent.com/login?return_to=%2Fscubeaitech-admin%2FDataStructuresAlgorithms |
|
Code
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms |
|
Pull requests
0
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/pulls |
|
Actions
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/actions |
|
Projects
0
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/projects |
|
Security
0
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/security |
|
Insights
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/pulse |
|
Code
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms |
|
Pull requests
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/pulls |
|
Actions
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/actions |
|
Projects
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/projects |
|
Security
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/security |
|
Insights
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/pulse |
| Branches | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/branches |
| Tags | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/tags |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/branches |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/tags |
| 1 Commit | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/commits/master/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/commits/master/ |
| README.md | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/blob/master/README.md |
| README.md | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/blob/master/README.md |
| README | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#500-data-structures-and-algorithms-practice-problems |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#array |
| 1.Find pair with given sum in the array | http://www.techiedelight.com/find-pair-with-given-sum-array/ |
| 2.Check if subarray with 0 sum is exists or not | http://www.techiedelight.com/check-subarray-with-0-sum-exists-not/ |
| 3.Print all sub-arrays with 0 sum | http://www.techiedelight.com/find-sub-array-with-0-sum/ |
| 4.Sort binary array in linear time | http://www.techiedelight.com/sort-binary-array-linear-time/ |
| 5.Find a duplicate element in a limited range array | http://www.techiedelight.com/find-duplicate-element-limited-range-array/ |
| 6.Find largest sub-array formed by consecutive integers | http://www.techiedelight.com/find-largest-sub-array-formed-by-consecutive-integers/ |
| 7.Find maximum length sub-array having given sum | http://www.techiedelight.com/find-maximum-length-sub-array-having-given-sum/ |
| 8.Find maximum length sub-array having equal number of 0’s and 1’s | http://www.techiedelight.com/find-maximum-length-sub-array-equal-number-0s-1s/ |
| 9.Sort an array containing 0’s, 1’s and 2’s (Dutch national flag problem) | http://www.techiedelight.com/sort-array-containing-0s-1s-2s-dutch-national-flag-problem/ |
| 10.Inplace merge two sorted arrays | http://www.techiedelight.com/inplace-merge-two-sorted-arrays/ |
| 11.Merge two arrays by satisfying given constraints | http://www.techiedelight.com/merge-two-arrays-satisfying-given-constraints/ |
| 12.Find index of 0 to replaced to get maximum length sequence of continuous ones | http://www.techiedelight.com/find-index-0-replaced-get-maximum-length-sequence-of-continuous-ones/ |
| 13.Find maximum product of two integers in an array | http://www.techiedelight.com/find-maximum-product-two-integers-array/ |
| 14.Shuffle a given array of elements (Fisher–Yates shuffle) | http://www.techiedelight.com/shuffle-given-array-elements-fisher-yates-shuffle/ |
| 15.Rearrange the array with alternate high and low elements | http://www.techiedelight.com/rearrange-the-array-with-alternate-high-and-low-elements/ |
| 16.Find equilibrium index of an array | http://www.techiedelight.com/find-equilibrium-index-array/ |
| 17.Find majority element in an array (Boyer–Moore majority vote algorithm) | http://www.techiedelight.com/find-majority-element-in-an-array-boyer-moore-majority-vote-algorithm/ |
| 18.Move all zeros present in the array to the end | http://www.techiedelight.com/move-zeros-present-array-end/ |
| 19.Replace each element of array with product of every other element without using / operator | http://www.techiedelight.com/replace-element-array-product-every-element-without-using-division-operator/ |
| 20.Find Longest Bitonic Subarray in an array | http://www.techiedelight.com/find-longest-bitonic-subarray-array/ |
| 21.Find maximum difference between two elements in the array by satisfying given constraints | http://www.techiedelight.com/find-maximum-difference-between-two-elements-array/ |
| 22.Maximum subarray problem (Kadane’s algorithm) | http://www.techiedelight.com/maximum-subarray-problem-kadanes-algorithm/ |
| 23.Print continuous subarray with maximum sum | http://www.techiedelight.com/print-continuous-subarray-with-maximum-sum/ |
| 24.Maximum Sum Circular Subarray | http://www.techiedelight.com/maximum-sum-circular-subarray/ |
| 25.Find all distinct combinations of given length | http://www.techiedelight.com/find-distinct-combinations-of-given-length/ |
| 26.Find all distinct combinations of given length with repetition allowed | http://www.techiedelight.com/find-distinct-combinations-given-length-repetition-allowed/ |
| 27.Find maximum sequence of continuous 1’s formed by replacing at-most k zeroes by ones | http://www.techiedelight.com/find-maximum-sequence-of-continuous-1s-can-formed-replacing-k-zeroes-ones/ |
| 28.Find minimum sum subarray of given size k | http://www.techiedelight.com/find-minimum-sum-subarray-given-size-k/ |
| 29.Find subarray having given sum in given array of integers | http://www.techiedelight.com/find-subarray-having-given-sum-given-array/ |
| 30.Find the length of smallest subarray whose sum of elements is greater than the given number | http://www.techiedelight.com/length-of-smallest-subarray-with-sum-greater-number/ |
| 31.Find largest number possible from set of given numbers | http://www.techiedelight.com/find-largest-number-possible-set-given-numbers/ |
| 32.Find the smallest window in array sorting which will make the entire array sorted | http://www.techiedelight.com/smallest-window-sorting-which-make-array-sorted/ |
| 33.Find maximum sum path involving elements of given arrays | http://www.techiedelight.com/find-maximum-sum-path-involving-elements-given-arrays/ |
| 34.Maximum profit earned by buying and selling shares any number of times | http://www.techiedelight.com/maximum-profit-earned-buying-and-selling-shares%22 |
| 35.Trapping Rain Water within given set of bars | http://www.techiedelight.com/trapping-rain-water-within-given-set-bars/ |
| 36.Longest Increasing Subsequence | http://www.techiedelight.com/longest-increasing-subsequence/ |
| 37.Longest Decreasing Subsequence Problem | http://www.techiedelight.com/longest-decreasing-subsequence-problem/ |
| 38.Find maximum product subarray in a given array | http://www.techiedelight.com/find-maximum-product-subarray-given-array/ |
| 39.Find maximum sum of subsequence with no adjacent elements | http://www.techiedelight.com/maximum-sum-of-subsequence-with-no-adjacent-elements/ |
| 40.Find minimum platforms needed in the station so to avoid any delay in arrival of any train | http://www.techiedelight.com/minimum-number-of-platforms-needed-avoid-delay-arrival-train/ |
| 41.Decode the array constructed from another array | http://www.techiedelight.com/decode-the-array-constructed-another-array/ |
| 42.Sort an array using one swap | http://www.techiedelight.com/sort-array-using-one-swap/ |
| 43.Find Triplet with given sum in an array | http://www.techiedelight.com/find-triplet-given-with-given-sum/ |
| 44.Length of longest continuous sequence with same sum in given binary arrays | http://www.techiedelight.com/length-longest-continuous-sequence-same-sum-binary-arrays/ |
| 45.Rearrange array such that A[A[i]] is set to i for every element A[i] | http://www.techiedelight.com/rearrange-array-such-that-array-index-is-set-to-i/ |
| 46.Reverse every consecutive m elements of the given subarray | http://www.techiedelight.com/reverse-every-consecutive-m-elements-given-subarray/ |
| 47.Maximum Product Subset Problem | http://www.techiedelight.com/maximum-product-subset-problem/ |
| 48.Find pairs with given difference k in the array | http://www.techiedelight.com/find-pairs-with-given-difference-array/ |
| 49.Find pairs with given difference k in the array | Constant space solution | http://www.techiedelight.com/find-pairs-given-difference-k-array-constant-space-solution/ |
| 50.4 sum problem | Quadruplets with given sum | http://www.techiedelight.com/4-sum-problem/ |
| 51.Print all quadruplets with given sum | 4-sum problem extended | http://www.techiedelight.com/print-all-quadruplets-with-given-sum-4-sum-problem-extended/ |
| 52.Find odd occurring element in an array in single traversal | http://www.techiedelight.com/find-odd-occurring-element-array-single-traversal/ |
| 53.Find two odd occurring element in an array without using any extra space | http://www.techiedelight.com/find-two-odd-occurring-element-array-without-extra-space/ |
| 54.Quickselect Algorithm | http://www.techiedelight.com/quickselect-algorithm/ |
| 55.Print all Triplets that forms Arithmetic Progression | http://www.techiedelight.com/print-triplets-forms-arithmetic-progression/ |
| 56.Print all triplets that forms Geometric Progression | http://www.techiedelight.com/print-triplets-forms-geometric-progression/ |
| 57.Print all combination of numbers from 1 to n having sum n | http://www.techiedelight.com/print-all-combination-numbers-from-1-to-n/ |
| 58.Replace each element of the array by its corresponding rank in the array | http://www.techiedelight.com/replace-each-element-corresponding-rank-array/ |
| 59.Print all Triplets in an array with sum less than or equal to given number | http://www.techiedelight.com/print-triplets-array-sum-less-equal-given-number/ |
| 60.Group elements of an array based on their first occurrence | http://www.techiedelight.com/group-elements-array-based-first-occurrence/ |
| 61.Find minimum difference between index of two given elements present in the array | http://www.techiedelight.com/find-minimum-difference-index-two-given-elements-present-array/ |
| 62.Find maximum absolute difference between sum of two non-overlapping sub-arrays | http://www.techiedelight.com/find-maximum-absolute-difference-subarrays/ |
| 63.Find all Symmetric Pairs in an Array of Pairs | http://www.techiedelight.com/find-symmetric-pairs-array-pairs/ |
| 64.Partition an array into two sub-arrays with the same sum | http://www.techiedelight.com/partition-array-into-two-sub-arrays-with-same-sum/ |
| 65.Find count of distinct elements in every sub-array of size k | http://www.techiedelight.com/count-distinct-elements-every-sub-array-size-k-array/ |
| 66.Find two numbers with maximum sum formed by array digits | http://www.techiedelight.com/find-two-numbers-maximum-sum-array-digits/ |
| 67.Print all sub-arrays of an array having distinct elements | http://www.techiedelight.com/print-sub-arrays-array-distinct-elements/ |
| 68.Find a Triplet having Maximum Product in an Array | http://www.techiedelight.com/find-triplet-maximum-product-array/ |
| 69.Find ways to calculate a target from elements of specified array | http://www.techiedelight.com/find-ways-calculate-target-elements-array/ |
| 70.Find Minimum Index of Repeating Element in an Array | http://www.techiedelight.com/find-minimum-index-repeating-element-array/ |
| 71.Generate Random Input from an Array according to given Probabilities | http://www.techiedelight.com/generate-random-input-array-according-given-probabilities/ |
| 72.Find pair in an array having minimum absolute sum | http://www.techiedelight.com/find-pair-array-minimum-absolute-sum/ |
| 73.Find Index of Maximum Occurring Element with Equal Probability | http://www.techiedelight.com/find-index-maximum-occurring-element-equal-probability/ |
| 74.Check if an Array is Formed by Consecutive Integers | http://www.techiedelight.com/check-array-formed-consecutive-integers/ |
| 75.Find two non-overlapping pairs having same sum in an array | http://www.techiedelight.com/find-two-non-overlapping-pairs-sum-array/ |
| 76.Find Minimum Product among all Combinations of Triplets in an Array | http://www.techiedelight.com/find-minimum-product-triplets-array/ |
| 77.Replace every element of an array with the least greater element on its right | http://www.techiedelight.com/replace-every-element-array-least-greater-element-right/ |
| 78.Find all odd occurring elements in an array having limited range of elements | http://www.techiedelight.com/find-odd-occurring-elements-array/ |
| 79.Add elements of two arrays into a new array | http://www.techiedelight.com/add-elements-two-arrays/ |
| 80.Count the distinct absolute values in the sorted array | http://www.techiedelight.com/count-distinct-absolute-values-sorted-array/ |
| 81.Print all combinations of positive integers in increasing order that sum to a given number | http://www.techiedelight.com/print-combinations-integers-sum-given-number/ |
| 82.Find all distinct combinations of given length — Part 2 | http://www.techiedelight.com/find-distinct-combinations-given-length-2/ |
| 83.Find subarrays with given sum in an array | http://www.techiedelight.com/find-subarrays-given-sum-array/ |
| 84.Find the surpasser count for each element of an array | http://www.techiedelight.com/surpasser-count-each-element-array/ |
| 85.Find maximum length sequence of continuous ones (Using Sliding Window) | http://www.techiedelight.com/find-maximum-length-sequence-continuous-ones-sliding-window/ |
| 86.Find maximum length sequence of continuous ones | http://www.techiedelight.com/find-maximum-length-sequence-continuous-ones/ |
| 87.Merging Overlapping Intervals | http://www.techiedelight.com/merging-overlapping-intervals%22 |
| 88.Activity Selection Problem | http://www.techiedelight.com/activity-selection-problem/ |
| 89.Job Sequencing Problem with Deadlines | http://www.techiedelight.com/job-sequencing-problem-deadlines/ |
| 90.Introduction to Priority Queues using Binary Heaps | http://www.techiedelight.com/introduction-priority-queues-using-binary-heaps/ |
| 91.Min Heap and Max Heap Implementation in C++ | http://www.techiedelight.com/min-heap-max-heap-implementation-c/ |
| 92.Min Heap and Max Heap Implementation in Java | http://www.techiedelight.com/min-heap-max-heap-implementation-in-java/ |
| 93.Heap Sort (Out-of-place and In-place implementation in C++ and C) | http://www.techiedelight.com/heap-sort-place-place-implementation-c-c/ |
| 94.Check if given array represents min heap or not | http://www.techiedelight.com/check-given-array-represents-min-heap-not/ |
| 95.Convert Max Heap to Min Heap in linear time | http://www.techiedelight.com/convert-max-heap-min-heap-linear-time/ |
| 96.Find K’th largest element in an array | http://www.techiedelight.com/find-kth-largest-element-array/ |
| 97.Sort a K-Sorted Array | http://www.techiedelight.com/sort-k-sorted-array/ |
| 98.Merge M sorted lists of variable length | http://www.techiedelight.com/merge-m-sorted-lists-variable-length/ |
| 99.Find K’th smallest element in an array | http://www.techiedelight.com/find-kth-smallest-element-array/ |
| 100.Find smallest range with at-least one element from each of the given lists | http://www.techiedelight.com/find-smallest-range-least-one-element-given-lists/ |
| 101.Merge M sorted lists each containing N elements | http://www.techiedelight.com/merge-m-sorted-lists-containing-n-elements/ |
| 102.Insertion sort | Iterative & Recursive | http://www.techiedelight.com/insertion-sort-iterative-recursive/ |
| 103.Selection sort | Iterative & Recursive | http://www.techiedelight.com/selection-sort-iterative-recursive/ |
| 104.Bubble sort | Iterative & Recursive | http://www.techiedelight.com/bubble-sort-iterative-recursive/ |
| 105.Merge Sort | http://www.techiedelight.com/merge-sort/ |
| 106.Quicksort | http://www.techiedelight.com/quicksort/ |
| 107.Iterative Implementation of Quicksort | http://www.techiedelight.com/iterative-implementation-of-quicksort/ |
| 108.Hybrid QuickSort | http://www.techiedelight.com/hybrid-quicksort/ |
| 109.Quicksort using Dutch National Flag Algorithm | http://www.techiedelight.com/quicksort-using-dutch-national-flag-algorithm/ |
| 110.Quick Sort using Hoare’s Partitioning scheme | http://www.techiedelight.com/quick-sort-using-hoares-partitioning-scheme/ |
| 111.External merge sort | http://www.techiedelight.com/external-merge-sort/ |
| 112.Custom Sort | Sort elements by their frequency and Index | http://www.techiedelight.com/sort-elements-by-their-frequency-and-index/ |
| 113.Custom Sort | Sort elements of the array by order of elements defined by the second array | http://www.techiedelight.com/custom-sort-sort-elements-array-order-elements-defined-second-array/ |
| 114.Inversion Count of an array | http://www.techiedelight.com/inversion-count-array/ |
| 115.Segregate positive and negative integers in linear time | http://www.techiedelight.com/positive-and-negative-integers-segregate/ |
| 116.Binary Search | http://www.techiedelight.com/binary-search/ |
| 117.Ternary Search vs Binary search | http://www.techiedelight.com/ternary-search-vs-binary-search/ |
| 118.Interpolation search | http://www.techiedelight.com/interpolation-search/ |
| 119.Exponential search | http://www.techiedelight.com/exponential-search/ |
| 120.Find number of rotations in a circularly sorted array | http://www.techiedelight.com/find-number-rotations-circularly-sorted-array/ |
| 121.Search an element in a circular sorted array | http://www.techiedelight.com/search-element-circular-sorted-array/ |
| 122.Find first or last occurrence of a given number in a sorted array | http://www.techiedelight.com/find-first-or-last-occurrence-of-a-given-number-sorted-array/ |
| 123.Count occurrences of a number in a sorted array with duplicates | http://www.techiedelight.com/count-occurrences-number-sorted-array-duplicates/ |
| 124.Find smallest missing element from a sorted array | http://www.techiedelight.com/find-smallest-missing-element-sorted-array/ |
| 125.Find Floor and Ceil of a number in a sorted array | http://www.techiedelight.com/find-floor-ceil-number-sorted-array/ |
| 126.Search in a nearly sorted array in O(logn) time | http://www.techiedelight.com/search-nearly-sorted-array-ologn-time/ |
| 127.Find number of 1’s in a sorted binary array | http://www.techiedelight.com/find-number-1s-sorted-binary-array/ |
| 128.Find the peak element in an array | http://www.techiedelight.com/find-peak-element-array/ |
| 129.Maximum Sum Subarray using Divide & Conquer | http://www.techiedelight.com/maximum-sum-subarray-using-divide-conquer/ |
| 130.Find Minimum and Maximum element in an array using minimum comparisons | http://www.techiedelight.com/find-minimum-maximum-element-array-using-minimum-comparisons/ |
| 131.Matrix Chain Multiplication | http://www.techiedelight.com/matrix-chain-multiplication/ |
| 132.0–1 Knapsack problem | http://www.techiedelight.com/0-1-knapsack-problem/ |
| 133.Maximize value of the expression | http://www.techiedelight.com/maximize-value-of-the-expression/ |
| 134.Partition problem | http://www.techiedelight.com/partition-problem/ |
| 135.Subset sum problem | http://www.techiedelight.com/subset-sum-problem/ |
| 136.Minimum Sum Partition problem | http://www.techiedelight.com/minimum-sum-partition-problem/ |
| 137.Rod Cutting | http://www.techiedelight.com/rot-cutting/ |
| 138.Coin change-making problem (unlimited supply of coins) | http://www.techiedelight.com/coin-change-making-problem-unlimited-supply-coins/ |
| 139.Coin Change Problem (Total number of ways to get the denomination of coins) | http://www.techiedelight.com/coin-change-problem-find-total-number-ways-get-denomination-coins/ |
| 140.Longest alternating subsequence | http://www.techiedelight.com/longest-alternating-subsequence/ |
| 141.Combinations of words formed by replacing given numbers with corresponding alphabets | http://www.techiedelight.com/combinations-of-words-formed-replacing-given-numbers-corresponding-english-alphabet/ |
| 142.Decode the given sequence to construct minimum number without repeated digits | http://www.techiedelight.com/decode-the-given-sequence-construct-minimum-number-without-repeated-digits/ |
| 143.All combinations of elements satisfying given constraints | http://www.techiedelight.com/find-combinations-of-elements-satisfies-given-constraints/ |
| 144.Find Missing Term in a Sequence in log(n) time | http://www.techiedelight.com/find-missing-term-sequence-ologn-time/ |
| 145.Print all distinct Subsets of a given Set | http://www.techiedelight.com/print-distinct-subsets-given-set/ |
| 146.Find Floor and Ceil of a number in a sorted array (Recursive solution) | http://www.techiedelight.com/find-floor-ceil-number-sorted-array-recursive/ |
| 147.Set both elements of a binary array to 0 in single line | http://www.techiedelight.com/set-elements-binary-array-0-single-line/ |
| 148.K-Partition Problem | Printing all Partitions | http://www.techiedelight.com/k-partition-problem-print-all-subsets/ |
| 149.3 Partition Problem | http://www.techiedelight.com/3-partition-problem/ |
| 150.3-partition problem extended | Print all partitions | http://www.techiedelight.com/3-partition-problem-extended-print-all-partitions/ |
| 151.Iterative Merge Sort Algorithm (Bottom-up Merge Sort) | http://www.techiedelight.com/iterative-merge-sort-algorithm-bottom-up/ |
| 152.Find two duplicate elements in an limited range array (using XOR) | http://www.techiedelight.com/find-two-duplicate-elements-limited-range-array-using-xor/ |
| 153.Find missing number and duplicate elements in an array | http://www.techiedelight.com/find-missing-number-duplicate-elements-array/ |
| 154.Find Minimum and Maximum element in an array by doing minimum comparisons | http://www.techiedelight.com/find-minimum-maximum-element-array-minimum-comparisons/ |
| 155.Find Frequency of each element in a sorted array containing duplicates | http://www.techiedelight.com/find-frequency-element-sorted-array-containing-duplicates/ |
| 156.Difference between Subarray, Subsequence and Subset | http://www.techiedelight.com/difference-between-subarray-subsequence-subset/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#backtracking |
| 1.Print all possible solutions to N Queens problem | http://www.techiedelight.com/print-possible-solutions-n-queens-problem/ |
| 2.Print all Possible Knight’s Tours in a chessboard | http://www.techiedelight.com/print-possible-knights-tours-chessboard/ |
| 3.Find Shortest Path in Maze | http://www.techiedelight.com/find-shortest-path-in-maze/ |
| 4.Find Longest Possible Route in a Matrix | http://www.techiedelight.com/find-longest-possible-route-matrix/ |
| 5.Find path from source to destination in a matrix that satisfies given constraints | http://www.techiedelight.com/find-path-source-destination-matrix-satisfies-given-constraints/ |
| 6.Find total number of unique paths in a maze from source to destination | http://www.techiedelight.com/find-total-number-unique-paths-maze-source-destination/ |
| 7.Print All Hamiltonian Path present in a graph | http://www.techiedelight.com/print-all-hamiltonian-path-present-in-a-graph/ |
| 8.Print all k-colorable configurations of the graph (Vertex coloring of graph) | http://www.techiedelight.com/print-k-colorable-configurations-graph-vertex-coloring-graph/ |
| 9.Find all Permutations of a given string | http://www.techiedelight.com/find-permutations-given-string/ |
| 10.All combinations of elements satisfying given constraints | http://www.techiedelight.com/find-combinations-of-elements-satisfies-given-constraints/ |
| 11.Find all binary strings that can be formed from given wildcard pattern | http://www.techiedelight.com/find-binary-strings-can-formed-given-wildcard-pattern/ |
| 12.K-Partition Problem | Printing all Partitions | http://www.techiedelight.com/k-partition-problem-print-all-subsets/ |
| 13.Magnet Puzzle | http://www.techiedelight.com/magnet-puzzle/ |
| 14.Find ways to calculate a target from elements of specified array | http://www.techiedelight.com/find-ways-calculate-target-elements-array/ |
| 15.Find minimum number possible by doing at-most K swaps | http://www.techiedelight.com/find-minimum-number-possible-k-swaps/ |
| 16.Determine if a pattern matches with a string or not | http://www.techiedelight.com/determine-pattern-matches-string-not/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#binary |
| 1.Bit Hacks — Part 1 (Basic) | http://www.techiedelight.com/bit-hacks-part-1-basic/ |
| 2.Bit Hacks — Part 2 (Playing with k’th bit) | http://www.techiedelight.com/bit-hacks-part-2-playing-kth-bit/ |
| 3.Bit Hacks — Part 3 (Playing with rightmost set bit of a number) | http://www.techiedelight.com/bit-hacks-part-3-playing-rightmost-set-bit-number/ |
| 4.Bit Hacks — Part 4 (Playing with letters of English alphabet) | http://www.techiedelight.com/bit-hacks-part-4-playing-letters-english-alphabet/ |
| 5.Bit Hacks — Part 5 (Find absolute value of an integer without branching) | http://www.techiedelight.com/bit-hacks-part-5-find-absolute-value-integer-without-branching/ |
| 6.Bit Hacks — Part 6 (Random Problems) | http://www.techiedelight.com/bit-hacks-part-6-random-problems/ |
| 7.Brian Kernighan’s Algorithm to count set bits in an integer | http://www.techiedelight.com/brian-kernighans-algorithm-count-set-bits-integer/ |
| 8.Compute parity of a number using lookup table | http://www.techiedelight.com/compute-parity-number-using-lookup-table/ |
| 9.Count set bits using lookup table | http://www.techiedelight.com/count-set-bits-using-lookup-table/ |
| 10.Find the minimum or maximum of two integers without using branching | http://www.techiedelight.com/find-minimum-maximum-two-integers-without-using-branching/ |
| 11.Multiply 16-bit integers using 8-bit multiplier | http://www.techiedelight.com/multiply-16-bit-integers-using-8-bit-multiplier/ |
| 12.Round up to the next highest power of 2 | http://www.techiedelight.com/round-next-highest-power-2/ |
| 13.Round up to the previous power of 2 | http://www.techiedelight.com/round-previous-power-2/ |
| 14.Swap individual bits at given position in an integer | http://www.techiedelight.com/swap-individual-bits-given-position-integer/ |
| 15.Check if given number is power of 4 or not | http://www.techiedelight.com/check-given-number-power-of-4/ |
| 16.Reverse Bits of a given Integer | http://www.techiedelight.com/reverse-bits-of-given-integer/ |
| 17.Find odd occurring element in an array in single traversal | http://www.techiedelight.com/find-odd-occurring-element-array-single-traversal/ |
| 18.Find two odd occurring element in an array without using any extra space | http://www.techiedelight.com/find-two-odd-occurring-element-array-without-extra-space/ |
| 19.Swap two bits at given position in an integer | http://www.techiedelight.com/swap-two-bits-given-position-integer/ |
| 20.Add binary representation of two integers | http://www.techiedelight.com/add-binary-representation-two-integers/ |
| 21.Swap Adjacent Bits of a Number | http://www.techiedelight.com/swap-adjacent-bits-number/ |
| 22.Print all distinct Subsets of a given Set | http://www.techiedelight.com/print-distinct-subsets-given-set/ |
| 23.Perform Division of two numbers without using division operator (/) | http://www.techiedelight.com/perform-division-two-numbers-without-using-division-operator/ |
| 24.Check if adjacent bits are set in binary representation of a given number | http://www.techiedelight.com/check-adjacent-bits-set-binary-representation-number/ |
| 25.Conditionally negate a value without branching | http://www.techiedelight.com/conditionally-negate-value-without-branching/ |
| 26.Find two duplicate elements in an limited range array (using XOR) | http://www.techiedelight.com/find-two-duplicate-elements-limited-range-array-using-xor/ |
| 27.Find missing number and duplicate elements in an array | http://www.techiedelight.com/find-missing-number-duplicate-elements-array/ |
| 28.Check if given number is power of 8 or not | http://www.techiedelight.com/check-given-number-power-8-not/ |
| 29.Circular shift on binary representation of an integer by k positions | http://www.techiedelight.com/circular-shift-integer-k-positions/ |
| 30.Solve given set of problems without using multiplication or division operators | http://www.techiedelight.com/solve-problems-without-using-multiplication-division-operators/ |
| 31.Reverse Bits of an integer using lookup table | http://www.techiedelight.com/reverse-bits-integer-using-lookup-table/ |
| 32.Generate binary numbers between 1 to N | http://www.techiedelight.com/generate-binary-numbers-1-n/ |
| 33.Efficiently implement power function | Recursive and Iterative | http://www.techiedelight.com/power-function-implementation-recursive-iterative/ |
| 34.Find square of a number without using multiplication and division operator | 3 methods | http://www.techiedelight.com/find-square-number-without-using-multiplication-division-operator/ |
| 35.Generate power set of a given set | http://www.techiedelight.com/generate-power-set-given-set/ |
| 36.Huffman Coding | http://www.techiedelight.com/huffman-coding/ |
| 37.Find all odd occurring elements in an array having limited range of elements | http://www.techiedelight.com/find-odd-occurring-elements-array/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#binary-tree |
| 1.Check if two given binary trees are identical or not | Iterative & Recursive | http://www.techiedelight.com/check-if-two-binary-trees-are-identical-not-iterative-recursive/ |
| 2.Calculate height of a binary tree | Iterative & Recursive | http://www.techiedelight.com/calculate-height-binary-tree-iterative-recursive/ |
| 3.Delete given Binary Tree | Iterative & Recursive | http://www.techiedelight.com/delete-given-binary-tree-iterative-recursive/ |
| 4.Inorder Tree Traversal | Iterative & Recursive | http://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/ |
| 5.Preorder Tree Traversal | Iterative & Recursive | http://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/ |
| 6.Postorder Tree Traversal | Iterative & Recursive | http://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/ |
| 7.Level Order Traversal of Binary Tree | http://www.techiedelight.com/level-order-traversal-binary-tree/ |
| 8.Spiral Order Traversal of Binary Tree | http://www.techiedelight.com/spiral-order-traversal-binary-tree/ |
| 9.Reverse Level Order Traversal of Binary Tree | http://www.techiedelight.com/reverse-level-order-traversal-binary-tree/ |
| 10.Print all nodes of a given binary tree in specific order | http://www.techiedelight.com/print-nodes-binary-tree-specific-order/ |
| 11.Print left view of binary tree | http://www.techiedelight.com/print-left-view-of-binary-tree/ |
| 12.Print Bottom View of Binary Tree | http://www.techiedelight.com/print-bottom-view-of-binary-tree/ |
| 13.Print Top View of Binary Tree | http://www.techiedelight.com/print-top-view-binary-tree/ |
| 14.Find next node in same level for given node in a binary tree | http://www.techiedelight.com/find-next-node-in-same-level-binary-tree/ |
| 15.Check if given binary tree is complete binary tree or not | http://www.techiedelight.com/check-given-binary-tree-complete-binary-tree-not/ |
| 16.Determine if given two nodes are cousins of each other | http://www.techiedelight.com/determine-two-nodes-are-cousins/ |
| 17.Print cousins of given node in a binary tree | http://www.techiedelight.com/print-cousins-of-given-node-binary-tree/ |
| 18.In-place convert given binary tree to its sum tree | http://www.techiedelight.com/inplace-convert-a-tree-sum-tree/ |
| 19.Check if given binary tree is a sum tree or not | http://www.techiedelight.com/check-given-binary-tree-sum-tree-not/ |
| 20.Combinations of words formed by replacing given numbers with corresponding alphabets | http://www.techiedelight.com/combinations-of-words-formed-replacing-given-numbers-corresponding-english-alphabet/ |
| 21.Determine if given binary tree is a subtree of another binary tree or not | http://www.techiedelight.com/determine-given-binary-tree-is-subtree-of-another-binary-tree-not/ |
| 22.Find diameter of a binary tree | http://www.techiedelight.com/find-diameter-of-a-binary-tree/ |
| 23.Check if given binary Tree has symmetric structure or not | http://www.techiedelight.com/check-given-binary-tree-symmetric-structure-not/ |
| 24.Convert binary tree to its mirror | http://www.techiedelight.com/convert-binary-tree-to-its-mirror/ |
| 25.Check if binary tree can be converted to another by doing any no. of swaps of left & right child | http://www.techiedelight.com/determine-binary-tree-can-converted-another-number-swaps-left-right-child/ |
| 26.Find Lowest Common Ancestor (LCA) of two nodes in a binary tree | http://www.techiedelight.com/find-lowest-common-ancestor-lca-two-nodes-binary-tree/ |
| 27.Print all paths from root to leaf nodes in given binary tree | http://www.techiedelight.com/print-all-paths-from-root-to-leaf-nodes-binary-tree/ |
| 28.Find ancestors of given node in a Binary Tree | http://www.techiedelight.com/find-ancestors-of-given-node-binary-tree/ |
| 29.Find the distance between given pairs of nodes in a binary tree | http://www.techiedelight.com/distance-between-given-pairs-of-nodes-binary-tree/ |
| 30.Find Vertical Sum in a given Binary Tree | http://www.techiedelight.com/find-vertical-sum-given-binary-tree/ |
| 31.Print nodes in vertical order of a given Binary Tree (Vertical Traversal) | http://www.techiedelight.com/vertical-traversal-binary-tree/ |
| 32.Find the diagonal sum of given binary tree | http://www.techiedelight.com/find-diagonal-sum-given-binary-tree/ |
| 33.Print Diagonal Traversal of Binary Tree | http://www.techiedelight.com/print-diagonal-traversal-binary-tree/ |
| 34.Print corner nodes of every level in binary tree | http://www.techiedelight.com/print-corner-nodes-every-level-binary-tree/ |
| 35.In-place convert convert given Binary Tree to Doubly Linked List | http://www.techiedelight.com/place-convert-given-binary-tree-to-doubly-linked-list/ |
| 36.Sink nodes containing zero to the bottom of the binary tree | http://www.techiedelight.com/sink-nodes-containing-zero-bottom-binary-tree/ |
| 37.Convert given binary tree to full tree by removing half nodes | http://www.techiedelight.com/convert-given-binary-tree-to-full-tree-removing-half-nodes/ |
| 38.Truncate given binary tree to remove nodes which lie on a path having sum less than K | http://www.techiedelight.com/truncate-given-binary-tree-remove-nodes-lie-path-sum-less-k/ |
| 39.Find maximum sum root-to-leaf path in a binary tree | http://www.techiedelight.com/find-maximum-sum-root-to-leaf-path-binary-tree/ |
| 40.Check if given binary tree is height balanced or not | http://www.techiedelight.com/check-given-binary-tree-is-height-balanced-not/ |
| 41.Convert normal binary tree to Left-child right-sibling binary tree | http://www.techiedelight.com/convert-normal-binary-tree-left-child-right-sibling-binary-tree/ |
| 42.Determine if given Binary Tree is a BST or not | http://www.techiedelight.com/determine-given-binary-tree-is-a-bst-or-not/ |
| 43.Convert a Binary Tree to BST by maintaining its original structure | http://www.techiedelight.com/convert-binary-tree-to-bst-maintaining-original-structure/ |
| 44.Invert given Binary Tree | Recursive and Iterative solution | http://www.techiedelight.com/invert-binary-tree-recursive-iterative/ |
| 45.Print Right View of a Binary Tree | http://www.techiedelight.com/print-right-view-binary-tree/ |
| 46.Print leaf to root path for every leaf node in a binary tree | http://www.techiedelight.com/print-leaf-to-root-path-binary-tree/ |
| 47.Find maximum width of given binary tree | http://www.techiedelight.com/find-maximum-width-given-binary-tree/ |
| 48.Build Binary Tree from given Parent array | http://www.techiedelight.com/build-binary-tree-given-parent-array/ |
| 49.C++ Program to Print Binary Tree Structure | http://www.techiedelight.com/c-program-print-binary-tree/ |
| 50.Find all nodes at given distance from leaf nodes in a binary tree | http://www.techiedelight.com/find-all-nodes-at-given-distance-from-leaf-nodes-in-a-binary-tree/ |
| 51.Count all subtrees having same value of nodes in a binary tree | http://www.techiedelight.com/count-subtrees-value-nodes-binary-tree/ |
| 52.Find Maximum Difference Between a Node and its Descendants in a Binary Tree | http://www.techiedelight.com/find-maximum-difference-node-descendants/ |
| 53.Construct a Binary Tree from Ancestor Matrix | http://www.techiedelight.com/construct-binary-tree-ancestor-matrix/ |
| 54.Calculate height of a binary tree with leaf nodes forming a circular doubly linked list | http://www.techiedelight.com/calculate-height-binary-tree-leaf-nodes-forming-circular-doubly-linked-list/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#bst |
| 1.Insertion in BST | http://www.techiedelight.com/insertion-in-bst/ |
| 2.Search given key in BST | http://www.techiedelight.com/search-given-key-in-bst/ |
| 3.Deletion from BST | http://www.techiedelight.com/deletion-from-bst/ |
| 4.Construct balanced BST from given keys | http://www.techiedelight.com/construct-balanced-bst-given-keys/ |
| 5.Determine if given Binary Tree is a BST or not | http://www.techiedelight.com/determine-given-binary-tree-is-a-bst-or-not/ |
| 6.Check if given keys represents same BSTs or not without building the BST | http://www.techiedelight.com/check-given-keys-represents-same-bsts-not-without-building-bst/ |
| 7.Find inorder predecessor for given key in a BST | http://www.techiedelight.com/find-inorder-predecessor-given-key-bst/ |
| 8.Find Lowest Common Ancestor (LCA) of two nodes in a Binary Search Tree | http://www.techiedelight.com/find-lowest-common-ancestor-lca-two-nodes-bst/ |
| 9.Find K’th smallest and K’th largest element in BST | http://www.techiedelight.com/find-kth-smallest-largest-element-bst/ |
| 10.Floor and Ceil in a Binary Search Tree | http://www.techiedelight.com/floor-ceil-bst-iterative-recursive/ |
| 11.Find optimal cost to construct binary search tree | http://www.techiedelight.com/find-optimal-cost-to-construct-binary-search-tree/ |
| 12.Convert a Binary Tree to BST by maintaining its original structure | http://www.techiedelight.com/convert-binary-tree-to-bst-maintaining-original-structure/ |
| 13.Remove nodes from BST that have keys outside the valid range | http://www.techiedelight.com/remove-nodes-bst-keys-outside-valid-range/ |
| 14.Find a pair with given sum in a BST | http://www.techiedelight.com/find-pair-with-given-sum-bst/ |
| 15.Find inorder successor for given key in a BST | http://www.techiedelight.com/find-inorder-successor-given-key-bst/ |
| 16.Replace every element of an array with the least greater element on its right | http://www.techiedelight.com/replace-every-element-array-least-greater-element-right/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#divide-conquer |
| 1.Binary Search | http://www.techiedelight.com/binary-search/ |
| 2.Find number of rotations in a circularly sorted array | http://www.techiedelight.com/find-number-rotations-circularly-sorted-array/ |
| 3.Search an element in a circular sorted array | http://www.techiedelight.com/search-element-circular-sorted-array/ |
| 4.Find first or last occurrence of a given number in a sorted array | http://www.techiedelight.com/find-first-or-last-occurrence-of-a-given-number-sorted-array/ |
| 5.Count occurrences of a number in a sorted array with duplicates | http://www.techiedelight.com/count-occurrences-number-sorted-array-duplicates/ |
| 6.Find smallest missing element from a sorted array | http://www.techiedelight.com/find-smallest-missing-element-sorted-array/ |
| 7.Find Floor and Ceil of a number in a sorted array | http://www.techiedelight.com/find-floor-ceil-number-sorted-array/ |
| 8.Search in a nearly sorted array in O(logn) time | http://www.techiedelight.com/search-nearly-sorted-array-ologn-time/ |
| 9.Find number of 1’s in a sorted binary array | http://www.techiedelight.com/find-number-1s-sorted-binary-array/ |
| 10.Find the peak element in an array | http://www.techiedelight.com/find-peak-element-array/ |
| 11.Maximum Sum Subarray using Divide & Conquer | http://www.techiedelight.com/maximum-sum-subarray-using-divide-conquer/ |
| 12.Find Minimum and Maximum element in an array using minimum comparisons | http://www.techiedelight.com/find-minimum-maximum-element-array-using-minimum-comparisons/ |
| 13.Efficiently implement power function | Recursive and Iterative | http://www.techiedelight.com/power-function-implementation-recursive-iterative/ |
| 14.Find Missing Term in a Sequence in log(n) time | http://www.techiedelight.com/find-missing-term-sequence-ologn-time/ |
| 15.Division of Two Numbers using Binary Search Algorithm | http://www.techiedelight.com/division-two-numbers-using-binary-search-algorithm/ |
| 16.Find Floor and Ceil of a number in a sorted array (Recursive solution) | http://www.techiedelight.com/find-floor-ceil-number-sorted-array-recursive/ |
| 17.Find Minimum and Maximum element in an array by doing minimum comparisons | http://www.techiedelight.com/find-minimum-maximum-element-array-minimum-comparisons/ |
| 18.Find Frequency of each element in a sorted array containing duplicates | http://www.techiedelight.com/find-frequency-element-sorted-array-containing-duplicates/ |
| 19.Ternary Search vs Binary search | http://www.techiedelight.com/ternary-search-vs-binary-search/ |
| 20.Exponential search | http://www.techiedelight.com/exponential-search/ |
| 21.Interpolation search | http://www.techiedelight.com/interpolation-search/ |
| 22.Merge Sort Algorithm | http://www.techiedelight.com/merge-sort/ |
| 23.Iterative Merge Sort Algorithm (Bottom-up Merge Sort) | http://www.techiedelight.com/iterative-merge-sort-algorithm-bottom-up/ |
| 24.Merge Sort Algorithm for Singly Linked List | http://www.techiedelight.com/merge-sort-singly-linked-list/ |
| 25.Inversion Count of an array | http://www.techiedelight.com/inversion-count-array/ |
| 26.Quicksort Algorithm | http://www.techiedelight.com/quicksort/ |
| 27.Iterative Implementation of Quicksort | http://www.techiedelight.com/iterative-implementation-of-quicksort/ |
| 28.Hybrid QuickSort | http://www.techiedelight.com/hybrid-quicksort/ |
| 29.Quicksort using Dutch National Flag Algorithm | http://www.techiedelight.com/quicksort-using-dutch-national-flag-algorithm/ |
| 30.Quick Sort using Hoare’s Partitioning scheme | http://www.techiedelight.com/quick-sort-using-hoares-partitioning-scheme/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#dynamic-programming |
| 1.Introduction to Dynamic Programming | http://www.techiedelight.com/introduction-dynamic-programming/ |
| 2.Longest Common Subsequence | Introduction & LCS Length | http://www.techiedelight.com/longest-common-subsequence/ |
| 3.Longest Common Subsequence | Space optimized version | http://www.techiedelight.com/longest-common-subsequence-lcs-space-optimized-version/ |
| 4.Longest Common Subsequence of K-sequences | http://www.techiedelight.com/longest-common-subsequence-of-k-sequences/ |
| 5.Longest Common Subsequence | Finding all LCS | http://www.techiedelight.com/longest-common-subsequence-finding-lcs/ |
| 6.Longest Common Substring problem | http://www.techiedelight.com/longest-common-substring-problem/ |
| 7.Longest Palindromic Subsequence using Dynamic Programming | http://www.techiedelight.com/longest-palindromic-subsequence-using-dynamic-programming/ |
| 8.Longest Repeated Subsequence problem | http://www.techiedelight.com/longest-repeated-subsequence-problem/ |
| 9.Implement Diff Utility | http://www.techiedelight.com/implement-diff-utility/ |
| 10.Shortest Common Supersequence | Introduction & SCS Length | http://www.techiedelight.com/shortest-common-supersequence-introduction-scs-length/ |
| 11.Shortest Common Supersequence | Finding all SCS | http://www.techiedelight.com/shortest-common-supersequence-finding-scs/ |
| 12.Shortest Common Supersequence | Using LCS | http://www.techiedelight.com/shortest-common-supersequence-using-lcs/ |
| 13.Longest Increasing Subsequence using Dynamic Programming | http://www.techiedelight.com/longest-increasing-subsequence-using-dynamic-programming/ |
| 14.Longest Bitonic Subsequence | http://www.techiedelight.com/longest-bitonic-subsequence/ |
| 15.Increasing Subsequence with Maximum Sum | http://www.techiedelight.com/increasing-subsequence-with-maximum-sum/ |
| 16.The Levenshtein distance (Edit distance) problem | http://www.techiedelight.com/levenshtein-distance-edit-distance-problem/ |
| 17.Find size of largest square sub-matrix of 1’s present in given binary matrix | http://www.techiedelight.com/find-size-largest-square-sub-matrix-1s-present-given-binary-matrix/ |
| 18.Matrix Chain Multiplication | http://www.techiedelight.com/matrix-chain-multiplication/ |
| 19.Find the minimum cost to reach last cell of the matrix from its first cell | http://www.techiedelight.com/find-minimum-cost-reach-last-cell-matrix-first-cell/ |
| 20.Find longest sequence formed by adjacent numbers in the matrix | http://www.techiedelight.com/find-longest-sequence-formed-adjacent-numbers-matrix/ |
| 21.Count number of paths in a matrix with given cost to reach destination cell | http://www.techiedelight.com/counting-paths-on-grid-to-reach-destination-cell/ |
| 22.0–1 Knapsack problem | http://www.techiedelight.com/0-1-knapsack-problem/ |
| 23.Maximize value of the expression | http://www.techiedelight.com/maximize-value-of-the-expression/ |
| 24.Partition problem | http://www.techiedelight.com/partition-problem/ |
| 25.Subset sum problem | http://www.techiedelight.com/subset-sum-problem/ |
| 26.Minimum Sum Partition problem | http://www.techiedelight.com/minimum-sum-partition-problem/ |
| 27.Find all N-digit binary strings without any consecutive 1’s | http://www.techiedelight.com/find-n-digit-binary-strings-without-consecutive-1s/ |
| 28.Rod Cutting | http://www.techiedelight.com/rot-cutting/ |
| 29.Maximum Product Rod Cutting | http://www.techiedelight.com/maximum-product-rod-cutting/ |
| 30.Coin change-making problem (unlimited supply of coins) | http://www.techiedelight.com/coin-change-making-problem-unlimited-supply-coins/ |
| 31.Coin Change Problem — Find total number of ways to get the denomination of coins | http://www.techiedelight.com/coin-change-problem-find-total-number-ways-get-denomination-coins/ |
| 32.Total possible solutions to linear equation of k variables | http://www.techiedelight.com/total-possible-solutions-linear-equation-k-variables/ |
| 33.Longest alternating subsequence | http://www.techiedelight.com/longest-alternating-subsequence/ |
| 34.Count number of times a pattern appears in given string as a subsequence | http://www.techiedelight.com/count-number-times-pattern-appears-given-string-subsequence/ |
| 35.Collect maximum points in a matrix by satisfying given constraints | http://www.techiedelight.com/collect-maximum-points-matrix-satisfying-given-constraints/ |
| 36.Count total possible combinations of N-digit numbers in a mobile keypad | http://www.techiedelight.com/count-total-possible-combinations-n-digit-numbers-mobile-keypad/ |
| 37.Find optimal cost to construct binary search tree | http://www.techiedelight.com/find-optimal-cost-to-construct-binary-search-tree/ |
| 38.Word Break Problem | http://www.techiedelight.com/word-break-problem/ |
| 39.Word Break Problem | Using Trie Data Structure | http://www.techiedelight.com/word-break-problem-using-trie/ |
| 40.Determine Minimal Adjustment Cost of an Array | http://www.techiedelight.com/determine-minimal-adjustment-cost-array/ |
| 41.Check if a string is K-Palindrome or not | http://www.techiedelight.com/check-given-string-k-palindrome-not/ |
| 42.Wildcard Pattern Matching | http://www.techiedelight.com/wildcard-pattern-matching/ |
| 43.Find probability that a person is alive after taking N steps on the island | http://www.techiedelight.com/probability-alive-after-taking-n-steps-island/ |
| 44.Calculate sum of all elements in a sub-matrix in constant time | http://www.techiedelight.com/calculate-sum-elements-sub-matrix-constant-time/ |
| 45.Find maximum sum K x K sub-matrix in a given M x N matrix | http://www.techiedelight.com/find-maximum-sum-submatrix-in-given-matrix/ |
| 46.Find maximum sum submatrix present in a given matrix | http://www.techiedelight.com/find-maximum-sum-submatrix-present-given-matrix/ |
| 47.Find maximum sum of subsequence with no adjacent elements | http://www.techiedelight.com/maximum-sum-of-subsequence-with-no-adjacent-elements%22 |
| 48.Maximum subarray problem (Kadane’s algorithm) | http://www.techiedelight.com/maximum-subarray-problem-kadanes-algorithm/ |
| 49.Single-Source Shortest Paths — Bellman Ford Algorithm | http://www.techiedelight.com/single-source-shortest-paths-bellman-ford-algorithm/ |
| 50.All-Pairs Shortest Paths — Floyd Warshall Algorithm | http://www.techiedelight.com/pairs-shortest-paths-floyd-warshall-algorithm/ |
| 51.Longest Decreasing Subsequence Problem | http://www.techiedelight.com/longest-decreasing-subsequence-problem/ |
| 52.Pots of Gold Game using Dynamic Programming | http://www.techiedelight.com/pots-gold-game-dynamic-programming/ |
| 53.Find minimum cuts needed for palindromic partition of a string | http://www.techiedelight.com/find-minimum-cuts-needed-palindromic-partition-string/ |
| 54.Maximum Length Snake Sequence | http://www.techiedelight.com/maximum-length-snake-sequence/ |
| 55.3 Partition Problem | http://www.techiedelight.com/3-partition-problem/ |
| 56.Calculate size of the largest plus of 1’s in binary matrix | http://www.techiedelight.com/calculate-size-largest-plus-1s-binary-matrix/ |
| 57.Check if given string is interleaving of two other given strings | http://www.techiedelight.com/check-string-interleaving-two-given-strings/ |
| 58.Longest Increasing Subsequence using LCS | http://www.techiedelight.com/longest-increasing-subsequence-using-lcs/ |
| 59.Determine negative-weight cycle in a graph | http://www.techiedelight.com/determine-negative-weight-cycle-graph/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#graphs |
| 1.Terminology and Representations of Graphs | http://www.techiedelight.com/terminology-and-representations-of-graphs/ |
| 2.Graph Implementation using STL | http://www.techiedelight.com/graph-implementation-using-stl/ |
| 3.Graph Implementation in C++ without using STL | http://www.techiedelight.com/graph-implementation-c-without-using-stl/ |
| 4.Implement Graph Data Structure in C | http://www.techiedelight.com/implement-graph-data-structure-c/ |
| 5.Graph Implementation in Java using Collections | http://www.techiedelight.com/graph-implementation-java-using-collections/ |
| 6.Breadth First Search (BFS) | Iterative & Recursive Implementation | http://www.techiedelight.com/breadth-first-search/ |
| 7.Depth First Search (DFS) | Iterative & Recursive Implementation | http://www.techiedelight.com/depth-first-search/ |
| 8.Arrival and Departure Time of Vertices in DFS | http://www.techiedelight.com/arrival-departure-time-vertices-dfs/ |
| 9.Types of edges involved in DFS and relation between them | http://www.techiedelight.com/types-edges-involved-dfs-relation/ |
| 10.Bipartite Graph | http://www.techiedelight.com/bipartite-graph/ |
| 11.Determine if a given graph is Bipartite Graph using DFS | http://www.techiedelight.com/determine-given-graph-bipartite-graph-using-dfs/ |
| 12.Minimum number of throws required to win Snake and Ladder game | http://www.techiedelight.com/min-throws-required-to-win-snake-and-ladder-game/ |
| 13.Topological Sorting in a DAG | http://www.techiedelight.com/topological-sorting-dag/ |
| 14.Kahn’s Topological Sort Algorithm | http://www.techiedelight.com/kahn-topological-sort-algorithm/ |
| 15.Transitive Closure of a Graph | http://www.techiedelight.com/transitive-closure-graph/ |
| 16.Check if an undirected graph contains cycle or not | http://www.techiedelight.com/check-undirected-graph-contains-cycle-not/ |
| 17.Total paths in given digraph from given source to destination having exactly m edges | http://www.techiedelight.com/total-paths-in-digraph-from-source-to-destination-m-edges/ |
| 18.Determine if an undirected graph is a Tree (Acyclic Connected Graph) | http://www.techiedelight.com/determine-undirected-graph-tree-acyclic-connected-graph/ |
| 19.2-Edge Connectivity in the graph | http://www.techiedelight.com/2-edge-connectivity-graph/ |
| 20.2-Vertex Connectivity in the graph | http://www.techiedelight.com/2-vertex-connectivity-graph/ |
| 21.Check if given digraph is a DAG (Directed Acyclic Graph) or not | http://www.techiedelight.com/check-given-digraph-dag-directed-acyclic-graph-not/ |
| 22.Disjoint-Set Data Structure (Union-Find Algorithm) | http://www.techiedelight.com/disjoint-set-data-structure-union-find-algorithm/ |
| 23.Chess Knight Problem — Find Shortest path from source to destination | http://www.techiedelight.com/chess-knight-problem-find-shortest-path-source-destination/ |
| 24.Check if given Graph is Strongly Connected or not | http://www.techiedelight.com/check-given-graph-strongly-connected-not/ |
| 25.Check if given Graph is Strongly Connected or not using one DFS Traversal | http://www.techiedelight.com/check-graph-strongly-connected-one-dfs-traversal/ |
| 26.Union-Find Algorithm for Cycle Detection in undirected graph | http://www.techiedelight.com/union-find-algorithm-cycle-detection-graph/ |
| 27.Kruskal’s Algorithm for finding Minimum Spanning Tree | http://www.techiedelight.com/kruskals-algorithm-for-finding-minimum-spanning-tree/ |
| 28.Single-Source Shortest Paths — Dijkstra’s Algorithm | http://www.techiedelight.com/single-source-shortest-paths-dijkstras-algorithm/ |
| 29.Single-Source Shortest Paths — Bellman Ford Algorithm | http://www.techiedelight.com/single-source-shortest-paths-bellman-ford-algorithm/ |
| 30.All-Pairs Shortest Paths — Floyd Warshall Algorithm | http://www.techiedelight.com/pairs-shortest-paths-floyd-warshall-algorithm/ |
| 31.Find Cost of Shortest Path in DAG using one pass of Bellman-Ford | http://www.techiedelight.com/cost-of-shortest-path-in-dag-using-one-pass-of-bellman-ford/ |
| 32.Least Cost Path in Weighted Digraph using BFS | http://www.techiedelight.com/least-cost-path-weighted-digraph-using-bfs/ |
| 33.Find maximum cost path in graph from given source to destination | http://www.techiedelight.com/maximum-cost-path-graph-source-destination/ |
| 34.Determine negative-weight cycle in a graph | http://www.techiedelight.com/determine-negative-weight-cycle-graph/ |
| 35.Print all k-colorable configurations of the graph (Vertex coloring of graph) | http://www.techiedelight.com/print-k-colorable-configurations-graph-vertex-coloring-graph/ |
| 36.Print All Hamiltonian Path present in a graph | http://www.techiedelight.com/print-all-hamiltonian-path-present-in-a-graph/ |
| 37.Greedy coloring of graph | http://www.techiedelight.com/greedy-coloring-graph/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#heap |
| 1.Introduction to Priority Queues using Binary Heaps | http://www.techiedelight.com/introduction-priority-queues-using-binary-heaps/ |
| 2.Min Heap and Max Heap Implementation in C++ | http://www.techiedelight.com/min-heap-max-heap-implementation-c/ |
| 3.Min Heap and Max Heap Implementation in Java | http://www.techiedelight.com/min-heap-max-heap-implementation-in-java/ |
| 4.Heap Sort | http://www.techiedelight.com/heap-sort-place-place-implementation-c-c/ |
| 5.Check if given array represents min heap or not | http://www.techiedelight.com/check-given-array-represents-min-heap-not/ |
| 6.Convert Max Heap to Min Heap in linear time | http://www.techiedelight.com/convert-max-heap-min-heap-linear-time/ |
| 7.Find K’th largest element in an array | http://www.techiedelight.com/find-kth-largest-element-array/ |
| 8.Sort a K-Sorted Array | http://www.techiedelight.com/sort-k-sorted-array/ |
| 9.Merge M sorted lists of variable length | http://www.techiedelight.com/merge-m-sorted-lists-variable-length/ |
| 10.Find K’th smallest element in an array | http://www.techiedelight.com/find-kth-smallest-element-array/ |
| 11.Find smallest range with at-least one element from each of the given lists | http://www.techiedelight.com/find-smallest-range-least-one-element-given-lists/ |
| 12.Merge M sorted lists each containing N elements | http://www.techiedelight.com/merge-m-sorted-lists-containing-n-elements/ |
| 13.External merge sort | http://www.techiedelight.com/external-merge-sort/ |
| 14.Huffman Coding | http://www.techiedelight.com/huffman-coding/ |
| 15.Find first k maximum occurring words in given set of strings | http://www.techiedelight.com/find-first-k-maximum-occurring-words-given-set-strings/ |
| 16.Find first k non-repeating characters in a string in single traversal | http://www.techiedelight.com/first-k-non-repeating-characters-string/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#linked-list |
| 1.Introduction to Linked Lists | http://www.techiedelight.com/introduction-linked-lists/ |
| 2.Linked List Implementation | Part 1 | http://www.techiedelight.com/linked-list-implementation-part-1/ |
| 3.Linked List Implementation | Part 2 | http://www.techiedelight.com/linked-list-implementation-part-2/ |
| 4.Static Linked List in C | http://www.techiedelight.com/static-linked-list-c/ |
| 5.Clone given Linked List | http://www.techiedelight.com/clone-given-linked-list/ |
| 6.Delete Linked List | http://www.techiedelight.com/delete-linked-list/ |
| 7.Pop operation in linked list | http://www.techiedelight.com/pop-operation-in-linked-list/ |
| 8.Insert given node into the correct sorted position in the given sorted linked list | http://www.techiedelight.com/sorted-insert-in-linked-list/ |
| 9.Given a linked list, change it to be in sorted order | http://www.techiedelight.com/given-linked-list-change-sorted-order/ |
| 10.Split the nodes of the given linked list into front and back halves | http://www.techiedelight.com/split-nodes-given-linked-list-front-back-halves/ |
| 11.Remove duplicates from a sorted linked list | http://www.techiedelight.com/remove-duplicates-sorted-linked-list/ |
| 12.Move front node of the given list to the front of the another list | http://www.techiedelight.com/move-front-node-given-list-front-another-list/ |
| 13.Move even nodes to the end of the list in reverse order | http://www.techiedelight.com/move-even-nodes-to-end-of-list-in-reverse-order/ |
| 14.Split given linked list into two lists where each list containing alternating elements from it | http://www.techiedelight.com/split-linked-list-into-two-lists-list-containing-alternating-elements/ |
| 15.Construct a linked list by merging alternate nodes of two given lists | http://www.techiedelight.com/merge-alternate-nodes-two-linked-lists/ |
| 16.Merge given sorted linked lists into one | http://www.techiedelight.com/merge-given-sorted-linked-lists/ |
| 17.Merge Sort Algorithm for Singly Linked List | http://www.techiedelight.com/merge-sort-singly-linked-list/ |
| 18.Intersection of two given sorted linked lists | http://www.techiedelight.com/intersection-two-given-sorted-linked-lists/ |
| 19.Reverse linked list | Part 1 (Iterative Solution) | http://www.techiedelight.com/reverse-linked-list-part-1-iterative-solution/ |
| 20.Reverse linked list | Part 2 (Recursive Solution) | http://www.techiedelight.com/reverse-linked-list-part-2-recursive-solution/ |
| 21.Reverse every group of k nodes in given linked list | http://www.techiedelight.com/reverse-every-k-nodes-of-a-linked-list/ |
| 22.Find K’th node from the end in a linked list | http://www.techiedelight.com/find-kth-node-from-the-end-linked-list/ |
| 23.Merge alternate nodes of two linked lists into the first list | http://www.techiedelight.com/merge-alternate-nodes-two-linked-lists-first-list/ |
| 24.Merge two sorted linked lists from their end | http://www.techiedelight.com/merge-two-sorted-linked-lists-end/ |
| 25.Delete every N nodes in a linked list after skipping M nodes | http://www.techiedelight.com/delete-every-n-nodes-linked-list-skipping-m-nodes/ |
| 26.Rearrange linked list in specific manner in linear time | http://www.techiedelight.com/rearrange-linked-list-specific-manner-linear-time/ |
| 27.Check if linked list is palindrome or not | http://www.techiedelight.com/check-if-linked-list-is-palindrome/ |
| 28.Move last node to front in a given Linked List | http://www.techiedelight.com/move-last-node-to-front-linked-list/ |
| 29.Rearrange the linked list in specific manner | http://www.techiedelight.com/rearrange-the-linked-list-specific-manner/ |
| 30.Detect Cycle in a linked list (Floyd’s Cycle Detection Algorithm) | http://www.techiedelight.com/detect-cycle-linked-list-floyds-cycle-detection-algorithm/ |
| 31.Sort linked list containing 0’s, 1’s and 2’s | http://www.techiedelight.com/sort-linked-list-containing-0s-1s-2s/ |
| 32.Stack Implementation using Linked List | http://www.techiedelight.com/stack-implementation-using-linked-list/ |
| 33.Queue Implementation using Linked List | http://www.techiedelight.com/queue-implementation-using-linked-list/ |
| 34.Remove duplicates from a linked list | http://www.techiedelight.com/remove-duplicates-linked-list/ |
| 35.Rearrange the linked list so that it has alternating high, low values | http://www.techiedelight.com/rearrange-linked-list-alternating-high-low-values/ |
| 36.Rearrange a Linked List by Separating Odd Nodes from the Even Ones | http://www.techiedelight.com/rearrange-linked-list-separating-odd-nodes-even/ |
| 37.Calculate height of a binary tree with leaf nodes forming a circular doubly linked list | http://www.techiedelight.com/calculate-height-binary-tree-leaf-nodes-forming-circular-doubly-linked-list/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#matrix |
| 1.Print Matrix in Spiral Order | http://www.techiedelight.com/print-matrix-spiral-order/ |
| 2.Create Spiral Matrix from given array | http://www.techiedelight.com/create-spiral-matrix-given-array/ |
| 3.Shift all matrix elements by 1 in Spiral Order | http://www.techiedelight.com/shift-matrix-elements-1-spiral-order/ |
| 4.Find Shortest path from source to destination in a matrix that satisfies given constraints | http://www.techiedelight.com/find-shortest-path-source-destination-matrix-satisfies-given-constraints/ |
| 5.Change all elements of row i and column j in a matrix to 0 if cell (i, j) has value 0 | http://www.techiedelight.com/change-elements-row-column-j-matrix-0-cell-j-value-0/ |
| 6.Print diagonal elements of the matrix having positive slope | http://www.techiedelight.com/print-matrix-diagonally-positive-slope/ |
| 7.Find all paths from first cell to last cell of a matrix | http://www.techiedelight.com/find-all-paths-from-source-to-destination-in-matrix/ |
| 8.Replace all occurrences of 0 that are not surrounded by 1 in a binary matrix | http://www.techiedelight.com/replace-occurrences-0-not-surrounded-1-binary-matrix/ |
| 9.In-place rotate the matrix by 90 degrees in clock-wise direction | http://www.techiedelight.com/place-rotate-matrix-90-degrees-clock-wise-direction/ |
| 10.Count negative elements present in sorted matrix in linear time | http://www.techiedelight.com/count-negative-elements-present-sorted-matrix/ |
| 11.Report all occurrences of an element in row wise and column wise sorted matrix in linear time | http://www.techiedelight.com/report-all-occurrences-of-an-element-in-sorted-matrix/ |
| 12.Calculate sum of all elements in a sub-matrix in constant time | http://www.techiedelight.com/calculate-sum-elements-sub-matrix-constant-time/ |
| 13.Find maximum sum K x K sub-matrix in a given M x N matrix | http://www.techiedelight.com/find-maximum-sum-submatrix-in-given-matrix/ |
| 14.Find maximum sum submatrix present in a given matrix | http://www.techiedelight.com/find-maximum-sum-submatrix-present-given-matrix/ |
| 15.Find probability that a person is alive after taking N steps on the island | http://www.techiedelight.com/probability-alive-after-taking-n-steps-island/ |
| 16.Count the number of islands | http://www.techiedelight.com/count-the-number-of-islands/ |
| 17.Flood fill Algorithm | http://www.techiedelight.com/flood-fill-algorithm/ |
| 18.Find shortest safe route in a field with sensors present | http://www.techiedelight.com/find-shortest-safe-route-field-sensors-present/ |
| 19.Find all occurrences of given string in a character matrix | http://www.techiedelight.com/find-occurrences-given-string-character-matrix/ |
| 20.Shortest path in a Maze | Lee algorithm | http://www.techiedelight.com/lee-algorithm-shortest-path-in-a-maze/ |
| 21.Check if given matrix is Toeplitz matrix or not | http://www.techiedelight.com/check-given-matrix-toeplitz-matrix-not/ |
| 22.In-place rotate the matrix by 180 degrees | http://www.techiedelight.com/inplace-rotate-matrix-180-degrees/ |
| 23.Fill Binary Matrix with Alternating Rectangles of 0 and 1 | http://www.techiedelight.com/fill-binary-matrix-alternating-rectangles-0-1/ |
| 24.Find all common elements present in every row of given matrix | http://www.techiedelight.com/find-common-elements-present-every-row-given-matrix/ |
| 25.Construct a Binary Tree from Ancestor Matrix | http://www.techiedelight.com/construct-binary-tree-ancestor-matrix/ |
| 26.Find common elements present in all rows of a matrix | http://www.techiedelight.com/find-common-elements-present-rows-matrix/ |
| 27.Travelling Salesman Problem using Branch and Bound | http://www.techiedelight.com/travelling-salesman-problem-using-branch-and-bound/ |
| 28.Collect maximum points in a matrix by satisfying given constraints | http://www.techiedelight.com/collect-maximum-points-matrix-satisfying-given-constraints/ |
| 29.Count number of paths in a matrix with given cost to reach destination cell | http://www.techiedelight.com/counting-paths-on-grid-to-reach-destination-cell/ |
| 30.Find longest sequence formed by adjacent numbers in the matrix | http://www.techiedelight.com/find-longest-sequence-formed-adjacent-numbers-matrix/ |
| 31.Find the minimum cost to reach last cell of the matrix from its first cell | http://www.techiedelight.com/find-minimum-cost-reach-last-cell-matrix-first-cell/ |
| 32.Matrix Chain Multiplication | http://www.techiedelight.com/matrix-chain-multiplication/ |
| 33.Find size of largest square sub-matrix of 1’s present in given binary matrix | http://www.techiedelight.com/find-size-largest-square-sub-matrix-1s-present-given-binary-matrix/ |
| 34.Chess Knight Problem — Find Shortest path from source to destination | http://www.techiedelight.com/chess-knight-problem-find-shortest-path-source-destination/ |
| 35.Find Duplicate rows in a binary matrix | http://www.techiedelight.com/find-duplicate-rows-binary-matrix/ |
| 36.Print all possible solutions to N Queens problem | http://www.techiedelight.com/print-possible-solutions-n-queens-problem/ |
| 37.Print all Possible Knight’s Tours in a chessboard | http://www.techiedelight.com/print-possible-knights-tours-chessboard/ |
| 38.Find Shortest Path in Maze | http://www.techiedelight.com/find-shortest-path-in-maze/ |
| 39.Find Longest Possible Route in a Matrix | http://www.techiedelight.com/find-longest-possible-route-matrix/ |
| 40.Calculate size of the largest plus of 1’s in binary matrix | http://www.techiedelight.com/calculate-size-largest-plus-1s-binary-matrix/ |
| 41.Find the maximum value of M[c][d] — M[a][b] over all choices of indexes | http://www.techiedelight.com/find-maximum-value-choices-indexes/ |
| 42.Find shortest distance of every cell from landmine in a Maze | http://www.techiedelight.com/find-shortest-distance-every-cell-landmine-maze/ |
| 43.Find shortest route in a device to construct the given string | http://www.techiedelight.com/find-shortest-route-device-construct-given-string/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#queue |
| 1.Queue Implementation | http://www.techiedelight.com/circular-queue-implementation-c/ |
| 2.Queue Implementation using Linked List | http://www.techiedelight.com/queue-implementation-using-linked-list/ |
| 3.Chess Knight Problem — Find Shortest path from source to destination | http://www.techiedelight.com/chess-knight-problem-find-shortest-path-source-destination/ |
| 4.Shortest path in a Maze | Lee algorithm | http://www.techiedelight.com/lee-algorithm-shortest-path-in-a-maze/ |
| 5.Find shortest safe route in a field with sensors present | http://www.techiedelight.com/find-shortest-safe-route-field-sensors-present/ |
| 6.Flood fill Algorithm | http://www.techiedelight.com/flood-fill-algorithm/ |
| 7.Count the number of islands | http://www.techiedelight.com/count-the-number-of-islands/ |
| 8.Find Shortest path from source to destination in a matrix that satisfies given constraints | http://www.techiedelight.com/find-shortest-path-source-destination-matrix-satisfies-given-constraints/ |
| 9.Generate binary numbers between 1 to N | http://www.techiedelight.com/generate-binary-numbers-1-n/ |
| 10.Calculate height of a binary tree | Iterative & Recursive | http://www.techiedelight.com/calculate-height-binary-tree-iterative-recursive/ |
| 11.Delete given Binary Tree | Iterative & Recursive | http://www.techiedelight.com/delete-given-binary-tree-iterative-recursive/ |
| 12.Level Order Traversal of Binary Tree | http://www.techiedelight.com/level-order-traversal-binary-tree/ |
| 13.Spiral Order Traversal of Binary Tree | http://www.techiedelight.com/spiral-order-traversal-binary-tree/ |
| 14.Reverse Level Order Traversal of Binary Tree | http://www.techiedelight.com/reverse-level-order-traversal-binary-tree/ |
| 15.Print all nodes of a given binary tree in specific order | http://www.techiedelight.com/print-nodes-binary-tree-specific-order/ |
| 16.Print left view of binary tree | http://www.techiedelight.com/print-left-view-of-binary-tree/ |
| 17.Find next node in same level for given node in a binary tree | http://www.techiedelight.com/find-next-node-in-same-level-binary-tree/ |
| 18.Check if given binary tree is complete binary tree or not | http://www.techiedelight.com/check-given-binary-tree-complete-binary-tree-not/ |
| 19.Print Diagonal Traversal of Binary Tree | http://www.techiedelight.com/print-diagonal-traversal-binary-tree/ |
| 20.Print corner nodes of every level in binary tree | http://www.techiedelight.com/print-corner-nodes-every-level-binary-tree/ |
| 21.Breadth First Search (BFS) | Iterative & Recursive Implementation | http://www.techiedelight.com/breadth-first-search/ |
| 22.Minimum number of throws required to win Snake and Ladder game | http://www.techiedelight.com/min-throws-required-to-win-snake-and-ladder-game/ |
| 23.Check if an undirected graph contains cycle or not | http://www.techiedelight.com/check-undirected-graph-contains-cycle-not/ |
| 24.Invert given Binary Tree | Recursive and Iterative solution | http://www.techiedelight.com/invert-binary-tree-recursive-iterative/ |
| 25.Find maximum cost path in graph from given source to destination | http://www.techiedelight.com/maximum-cost-path-graph-source-destination/ |
| 26.Find shortest distance of every cell from landmine in a Maze | http://www.techiedelight.com/find-shortest-distance-every-cell-landmine-maze/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#sorting |
| 1.Insertion sort | Iterative & Recursive | http://www.techiedelight.com/insertion-sort-iterative-recursive/ |
| 2.Selection sort | Iterative & Recursive | http://www.techiedelight.com/selection-sort-iterative-recursive/ |
| 3.Bubble sort | Iterative & Recursive | http://www.techiedelight.com/bubble-sort-iterative-recursive/ |
| 4.Merge Sort Algorithm | http://www.techiedelight.com/merge-sort/ |
| 5.Iterative Merge Sort Algorithm (Bottom-up Merge Sort) | http://www.techiedelight.com/iterative-merge-sort-algorithm-bottom-up/ |
| 6.Quicksort Algorithm | http://www.techiedelight.com/quicksort/ |
| 7.Iterative Implementation of Quicksort | http://www.techiedelight.com/iterative-implementation-of-quicksort/ |
| 8.Hybrid QuickSort | http://www.techiedelight.com/hybrid-quicksort/ |
| 9.Quicksort using Dutch National Flag Algorithm | http://www.techiedelight.com/quicksort-using-dutch-national-flag-algorithm/ |
| 10.Quick Sort using Hoare’s Partitioning scheme | http://www.techiedelight.com/quick-sort-using-hoares-partitioning-scheme/ |
| 11.External merge sort | http://www.techiedelight.com/external-merge-sort/ |
| 12.Counting Sort Algorithm | http://www.techiedelight.com/counting-sort-algorithm-implementation/ |
| 13.Custom Sort | Sort elements by their frequency and Index | http://www.techiedelight.com/sort-elements-by-their-frequency-and-index/ |
| 14.Custom Sort | Sort elements of the array by order of elements defined by the second array | http://www.techiedelight.com/custom-sort-sort-elements-array-order-elements-defined-second-array/ |
| 15.Inversion Count of an array | http://www.techiedelight.com/inversion-count-array/ |
| 16.Segregate positive and negative integers in linear time | http://www.techiedelight.com/positive-and-negative-integers-segregate/ |
| 17.Efficiently Sort an Array with many Duplicated Values | http://www.techiedelight.com/efficiently-sort-array-duplicated-values/ |
| 18.Find the smallest window in array sorting which will make the entire array sorted | http://www.techiedelight.com/smallest-window-sorting-which-make-array-sorted/ |
| 19.Find largest number possible from set of given numbers | http://www.techiedelight.com/find-largest-number-possible-set-given-numbers/ |
| 20.Move all zeros present in the array to the end | http://www.techiedelight.com/move-zeros-present-array-end/ |
| 21.Sort binary array in linear time | http://www.techiedelight.com/sort-binary-array-linear-time/ |
| 22.Sort linked list containing 0’s, 1’s and 2’s | http://www.techiedelight.com/sort-linked-list-containing-0s-1s-2s/ |
| 23.Merge Sort Algorithm for Singly Linked List | http://www.techiedelight.com/merge-sort-singly-linked-list/ |
| 24.Group anagrams together from given list of words | http://www.techiedelight.com/group-anagrams-together-given-list-words/ |
| 25.Activity Selection Problem | http://www.techiedelight.com/activity-selection-problem/ |
| 26.Lexicographic sorting of given set of keys | http://www.techiedelight.com/lexicographic-sorting-given-set-of-keys/ |
| 27.Heap Sort | http://www.techiedelight.com/heap-sort-place-place-implementation-c-c/ |
| 28.Merge M sorted lists of variable length | http://www.techiedelight.com/merge-m-sorted-lists-variable-length/ |
| 29.Merge M sorted lists each containing N elements | http://www.techiedelight.com/merge-m-sorted-lists-containing-n-elements/ |
| 30.Find all palindromic permutations of a string | http://www.techiedelight.com/find-palindromic-permutations-string/ |
| 31.Find all lexicographically next permutations of a string sorted in ascending order | http://www.techiedelight.com/find-lexicographically-next-permutations-string-sorted-ascending-order/ |
| 32.Merge two sorted linked lists from their end | http://www.techiedelight.com/merge-two-sorted-linked-lists-end/ |
| 33.Sort an array containing 0’s, 1’s and 2’s (Dutch national flag problem) | http://www.techiedelight.com/sort-array-containing-0s-1s-2s-dutch-national-flag-problem/ |
| 34.Find pair with given sum in the array | http://www.techiedelight.com/find-pair-with-given-sum-array/ |
| 35.Inplace merge two sorted arrays | http://www.techiedelight.com/inplace-merge-two-sorted-arrays/ |
| 36.Merge two arrays by satisfying given constraints | http://www.techiedelight.com/merge-two-arrays-satisfying-given-constraints/ |
| 37.Find maximum product of two integers in an array | http://www.techiedelight.com/find-maximum-product-two-integers-array/ |
| 38.Find all distinct combinations of given length | http://www.techiedelight.com/find-distinct-combinations-of-given-length/ |
| 39.Find all distinct combinations of given length with repetition allowed | http://www.techiedelight.com/find-distinct-combinations-given-length-repetition-allowed/ |
| 40.Merging Overlapping Intervals | http://www.techiedelight.com/merging-overlapping-intervals%22 |
| 41.Print all quadruplets with given sum | 4-sum problem extended | http://www.techiedelight.com/print-all-quadruplets-with-given-sum-4-sum-problem-extended/ |
| 42.4 sum problem | Quadruplets with given sum | http://www.techiedelight.com/4-sum-problem/ |
| 43.Find two numbers with maximum sum formed by array digits | http://www.techiedelight.com/find-two-numbers-maximum-sum-array-digits/ |
| 44.Find a Triplet having Maximum Product in an Array | http://www.techiedelight.com/find-triplet-maximum-product-array/ |
| 45.Find Minimum Product among all Combinations of Triplets in an Array | http://www.techiedelight.com/find-minimum-product-triplets-array/ |
| 46.Find all distinct combinations of given length — Part 2 | http://www.techiedelight.com/find-distinct-combinations-given-length-2/ |
| 47.Find the surpasser count for each element of an array | http://www.techiedelight.com/surpasser-count-each-element-array/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#stack |
| 1.Stack Implementation | http://www.techiedelight.com/stack-implementation/ |
| 2.Stack Implementation using Linked List | http://www.techiedelight.com/stack-implementation-using-linked-list/ |
| 3.Check if given expression is balanced expression or not | http://www.techiedelight.com/check-given-expression-balanced-expression-not/ |
| 4.Find duplicate parenthesis in an expression | http://www.techiedelight.com/find-duplicate-parenthesis-expression/ |
| 5.Evaluate given postfix expression | http://www.techiedelight.com/evaluate-given-postfix-expression/ |
| 6.Decode the given sequence to construct minimum number without repeated digits | http://www.techiedelight.com/decode-the-given-sequence-construct-minimum-number-without-repeated-digits/ |
| 7.Inorder Tree Traversal | Iterative & Recursive | http://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/ |
| 8.Preorder Tree Traversal | Iterative & Recursive | http://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/ |
| 9.Postorder Tree Traversal | Iterative & Recursive | http://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/ |
| 10.Find ancestors of given node in a Binary Tree | http://www.techiedelight.com/find-ancestors-of-given-node-binary-tree/ |
| 11.Check if two given binary trees are identical or not | Iterative & Recursive | http://www.techiedelight.com/check-if-two-binary-trees-are-identical-not-iterative-recursive/ |
| 12.Reverse given text without reversing the individual words | http://www.techiedelight.com/reverse-text-without-reversing-individual-words/ |
| 13.Find all binary strings that can be formed from given wildcard pattern | http://www.techiedelight.com/find-binary-strings-can-formed-given-wildcard-pattern/ |
| 14.Iterative Implementation of Quicksort | http://www.techiedelight.com/iterative-implementation-of-quicksort/ |
| 15.Depth First Search (DFS) | Iterative & Recursive Implementation | http://www.techiedelight.com/depth-first-search/ |
| 16.Invert given Binary Tree | Recursive and Iterative solution | http://www.techiedelight.com/invert-binary-tree-recursive-iterative/ |
| 17.Print leaf to root path for every leaf node in a binary tree | http://www.techiedelight.com/print-leaf-to-root-path-binary-tree/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#string |
| 1.Check if given string is a rotated palindrome or not | http://www.techiedelight.com/check-given-string-rotated-palindrome-not/ |
| 2.Longest Palindromic Substring (Non-DP Space Optimized Solution) | http://www.techiedelight.com/longest-palindromic-substring-non-dp-space-optimized-solution/ |
| 3.Check if repeated subsequence is present in the string or not | http://www.techiedelight.com/check-repeated-subsequence-present-string-not/ |
| 4.Check if strings can be derived from each other by circularly rotating them | http://www.techiedelight.com/check-strings-can-derived-circularly-rotating/ |
| 5.Check if given set of moves is circular or not | http://www.techiedelight.com/check-given-set-moves-circular-not/ |
| 6.Convert given number into corresponding excel column name | http://www.techiedelight.com/convert-given-number-corresponding-excel-column-name/ |
| 7.Determine if two strings are anagram or not | http://www.techiedelight.com/determine-if-two-strings-are-anagram-or-not/ |
| 8.Find all binary strings that can be formed from given wildcard pattern | http://www.techiedelight.com/find-binary-strings-can-formed-given-wildcard-pattern/ |
| 9.Find all interleavings of given strings | http://www.techiedelight.com/find-interleavings-of-given-strings/ |
| 10.Isomorphic Strings | http://www.techiedelight.com/isomorphic-strings/ |
| 11.Find all possible palindromic substrings in a string | http://www.techiedelight.com/find-possible-palindromic-substrings-string/ |
| 12.Find all possible combinations of words formed from mobile keypad | http://www.techiedelight.com/find-possible-combinations-words-formed-from-mobile-keypad/ |
| 13.Find all possible combinations by replacing given digits with characters of the corresponding list | http://www.techiedelight.com/possible-combinations-replacing-given-digits-corresponding-list/ |
| 14.Find all words from given list that follows same order of characters as given pattern | http://www.techiedelight.com/find-words-that-follows-given-pattern/ |
| 15.Find first k non-repeating characters in a string in single traversal | http://www.techiedelight.com/first-k-non-repeating-characters-string/ |
| 16.Group anagrams together from given list of words | http://www.techiedelight.com/group-anagrams-together-given-list-words/ |
| 17.Introduction to Pattern Matching | http://www.techiedelight.com/introduction-pattern-matching/ |
| 18.Inplace remove all occurrences of ‘AB’ and ‘C’ from the string | http://www.techiedelight.com/inplace-remove-all-occurrences-ab-c-string/ |
| 19.Longest even length palidromic sum substring | http://www.techiedelight.com/longest-even-length-palidromic-sum-substring/ |
| 20.Print string in zig-zag form in k rows | http://www.techiedelight.com/print-string-in-zig-zag-form-k-rows/ |
| 21.Reverse given text without reversing the individual words | http://www.techiedelight.com/reverse-text-without-reversing-individual-words/ |
| 22.Run Length Encoding (RLE) data compression algorithm | http://www.techiedelight.com/run-length-encoding-rle-data-compression-algorithm/ |
| 23.Validate an IP address | http://www.techiedelight.com/validate-ip-address/ |
| 24.Find the longest substring of given string containing k distinct characters | http://www.techiedelight.com/find-longest-substring-containing-k-distinct-characters/ |
| 25.Find all palindromic permutations of a string | http://www.techiedelight.com/find-palindromic-permutations-string/ |
| 26.Find all substrings of a string that are permutation of a given string | http://www.techiedelight.com/find-substrings-string-permutation-given-string/ |
| 27.Find the longest substring of given string containing all distinct characters | http://www.techiedelight.com/find-longest-substring-given-string-containing-distinct-characters/ |
| 28.Find all Permutations of a given string | http://www.techiedelight.com/find-permutations-given-string/ |
| 29.Iterative Approach to find Permutations of a String in C++ and Java | http://www.techiedelight.com/find-permutations-string-cpp-java-iterative/ |
| 30.Generate all Permutations of a String in Java | Recursive & Iterative | http://www.techiedelight.com/generate-permutations-string-java-recursive-iterative/ |
| 31.Find all lexicographically next permutations of a string sorted in ascending order | http://www.techiedelight.com/find-lexicographically-next-permutations-string-sorted-ascending-order/ |
| 32.Find Lexicographically minimal string rotation | http://www.techiedelight.com/find-lexicographically-minimal-string-rotation/ |
| 33.Find all strings of given length containing balanced parentheses | http://www.techiedelight.com/find-strings-given-length-containing-balanced-parentheses/ |
| 34.Find all N-digit strictly increasing numbers (Bottom-Up and Top-Down Approach) | http://www.techiedelight.com/find-n-digit-strictly-increasing-numbers-bottom-top-approach/ |
| 35.Find all N-digit binary numbers having more 1’s than 0’s for any prefix | http://www.techiedelight.com/find-n-digit-binary-numbers-having-more-one-than-zero/ |
| 36.Find all N-digit numbers with given sum of digits | http://www.techiedelight.com/find-all-n-digit-numbers-given-sum-digits/ |
| 37.Find all N-digit binary numbers with k-bits set where k ranges from 1 to N | http://www.techiedelight.com/find-n-digit-binary-numbers-k-bits-set-k-ranges-1-n/ |
| 38.Generate binary numbers between 1 to N | http://www.techiedelight.com/generate-binary-numbers-1-n/ |
| 39.Find all combinations of non-overlapping substrings of a string | http://www.techiedelight.com/find-combinations-non-overlapping-substrings-string/ |
| 40.Check if given sentence is syntactically correct or not | http://www.techiedelight.com/check-given-sentence-syntactically-correct-not/ |
| 41.Calculate rank of given string among all its lexicographically sorted permutations | http://www.techiedelight.com/calculate-rank-lexicographically-sorted-permutations/ |
| 42.Find all Lexicographic Permutations of a String | http://www.techiedelight.com/find-lexicographic-permutations-string/ |
| 43.Find all N-digit binary numbers with equal sum of bits in its two halves | http://www.techiedelight.com/find-n-digit-binary-numbers-equal-sum-bits-two-halves/ |
| 44.Check if given string is interleaving of two other given strings | http://www.techiedelight.com/check-string-interleaving-two-given-strings/ |
| 45.Difference between Subarray, Subsequence and Subset | http://www.techiedelight.com/difference-between-subarray-subsequence-subset/ |
| 46.std::next_permutation | Overview & Implementation in C++ | http://www.techiedelight.com/std_next_permutation-overview-implementation/ |
| 47.std::prev_permutation | Overview & Implementation in C++ | http://www.techiedelight.com/std_prev_permutation-overview-implementation/ |
| 48.Implementation of KMP Algorithm in C, C++ and Java | http://www.techiedelight.com/implementation-kmp-algorithm-c-cpp-java/ |
| 49.Reverse String without using Recursion | http://www.techiedelight.com/reverse-string-without-using-recursion/ |
| 50.Reverse given string using Recursion | http://www.techiedelight.com/reverse-a-string-using-recursion/ |
| 51.Reverse a String in Java in 10 different ways | http://www.techiedelight.com/10-ways-reverse-a-string-java/ |
| 52.Determine if a given string is palindrome or not | http://www.techiedelight.com/determine-given-string-is-palindrome-not/ |
| 53.In-place remove all adjacent duplicates from the given string | http://www.techiedelight.com/in-place-remove-all-adjacent-duplicates-from-string/ |
| 54.Find the minimum number of inversions needed to make the given expression balanced | http://www.techiedelight.com/minimum-number-inversions-expression-balanced/ |
| 55.Replace all non-overlapping occurrences of the pattern | http://www.techiedelight.com/replace-non-overlapping-occurrences-pattern/ |
| 56.Construct the longest palindrome by shuffling or deleting characters from a string | http://www.techiedelight.com/construct-longest-palindrome-string/ |
| 57.Determine if characters of a String follows a specified order or not | http://www.techiedelight.com/determine-string-follows-specified-order/ |
| 58.Print all combinations of phrases that can be formed by picking words from each of the given lists | http://www.techiedelight.com/combinations-phrases-formed-picking-words-lists/ |
| 59.Remove all extra spaces from a string | http://www.techiedelight.com/remove-extra-spaces-string/ |
| 60.Break a string into all possible combinations of non-overlapping substrings | http://www.techiedelight.com/break-string-non-overlapping-substrings/ |
| 61.Remove adjacent duplicate characters from a string | http://www.techiedelight.com/remove-adjacent-duplicates-characters-string/ |
| 62.Combinations of words formed by replacing given numbers with corresponding alphabets | http://www.techiedelight.com/combinations-of-words-formed-replacing-given-numbers-corresponding-english-alphabet/ |
| 63.Word Break Problem | http://www.techiedelight.com/word-break-problem/ |
| 64.Wildcard Pattern Matching | http://www.techiedelight.com/wildcard-pattern-matching/ |
| 65.Count number of times a pattern appears in given string as a subsequence | http://www.techiedelight.com/count-number-times-pattern-appears-given-string-subsequence/ |
| 66.The Levenshtein distance (Edit distance) problem | http://www.techiedelight.com/levenshtein-distance-edit-distance-problem/ |
| 67.Longest Common Subsequence | Introduction & LCS Length | http://www.techiedelight.com/longest-common-subsequence/ |
| 68.Longest Common Subsequence | Space optimized version | http://www.techiedelight.com/longest-common-subsequence-lcs-space-optimized-version/ |
| 69.Longest Common Subsequence of K-sequences | http://www.techiedelight.com/longest-common-subsequence-of-k-sequences/ |
| 70.Longest Common Subsequence | Finding all LCS | http://www.techiedelight.com/longest-common-subsequence-finding-lcs/ |
| 71.Longest Repeated Subsequence problem | http://www.techiedelight.com/longest-repeated-subsequence-problem/ |
| 72.Longest Palindromic Subsequence using Dynamic Programming | http://www.techiedelight.com/longest-palindromic-subsequence-using-dynamic-programming/ |
| 73.Longest Common Substring problem | http://www.techiedelight.com/longest-common-substring-problem/ |
| 74.Shortest Common Supersequence | Introduction & SCS Length | http://www.techiedelight.com/shortest-common-supersequence-introduction-scs-length/ |
| 75.Shortest Common Supersequence | Finding all SCS | http://www.techiedelight.com/shortest-common-supersequence-finding-scs/ |
| 76.Shortest Common Supersequence | Using LCS | http://www.techiedelight.com/shortest-common-supersequence-using-lcs/ |
| 77.Implement Diff Utility | http://www.techiedelight.com/implement-diff-utility/ |
| 78.Word Break Problem | Using Trie Data Structure | http://www.techiedelight.com/word-break-problem-using-trie/ |
| 79.Find minimum cuts needed for palindromic partition of a string | http://www.techiedelight.com/find-minimum-cuts-needed-palindromic-partition-string/ |
| 80.Check if a string is K-Palindrome or not | http://www.techiedelight.com/check-given-string-k-palindrome-not/ |
| 81.Find shortest route in a device to construct the given string | http://www.techiedelight.com/find-shortest-route-device-construct-given-string/ |
| 82.Find minimum number possible by doing at-most K swaps | http://www.techiedelight.com/find-minimum-number-possible-k-swaps/ |
| 83.Determine if a pattern matches with a string or not | http://www.techiedelight.com/determine-pattern-matches-string-not/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#trie |
| 1.Trie Implementation | Insert, Search and Delete | http://www.techiedelight.com/trie-implementation-insert-search-delete/ |
| 2.Memory efficient Trie Implementation using Map | Insert, Search and Delete | http://www.techiedelight.com/memory-efficient-trie-implementation-using-map-insert-search-delete/ |
| 3.C++ Implementation of Trie Data Structure | http://www.techiedelight.com/cpp-implementation-trie-data-structure/ |
| 4.Longest Common Prefix in given set of strings (using Trie) | http://www.techiedelight.com/longest-common-prefix-given-set-strings-using-trie/ |
| 5.Lexicographic sorting of given set of keys | http://www.techiedelight.com/lexicographic-sorting-given-set-of-keys/ |
| 6.Find maximum occurring word in given set of strings | http://www.techiedelight.com/find-maximum-occurring-word-given-set-strings/ |
| 7.Find first k maximum occurring words in given set of strings | http://www.techiedelight.com/find-first-k-maximum-occurring-words-given-set-strings/ |
| 8.Find Duplicate rows in a binary matrix | http://www.techiedelight.com/find-duplicate-rows-binary-matrix/ |
| 9.Word Break Problem | Using Trie Data Structure | http://www.techiedelight.com/word-break-problem-using-trie/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#greedy |
| 1.Activity Selection Problem | http://www.techiedelight.com/activity-selection-problem/ |
| 2.Huffman Coding | http://www.techiedelight.com/huffman-coding/ |
| 3.Shortest Superstring Problem | http://www.techiedelight.com/shortest-superstring-problem/ |
| 4.Job Sequencing Problem with Deadlines | http://www.techiedelight.com/job-sequencing-problem-deadlines/ |
| 5.Greedy coloring of graph | http://www.techiedelight.com/greedy-coloring-graph/ |
| 6.Kruskal’s Algorithm for finding Minimum Spanning Tree | http://www.techiedelight.com/kruskals-algorithm-for-finding-minimum-spanning-tree/ |
| 7.Single-Source Shortest Paths — Dijkstra’s Algorithm | http://www.techiedelight.com/single-source-shortest-paths-dijkstras-algorithm/ |
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#puzzles |
| 1.Clock angle problem — Find angle between hour and minute hand | http://www.techiedelight.com/angle-between-hour-minute-hand/ |
| 2.Add two numbers without using addition operator | 4 methods | http://www.techiedelight.com/add-two-numbers-without-using-addition-operator/ |
| 3.Generate power set of a given set | http://www.techiedelight.com/generate-power-set-given-set/ |
| 4.Implement power function without using multiplication and division operators | http://www.techiedelight.com/implement-power-function-without-using-multiplication-division-operators/ |
| 5.Print all numbers between 1 to N without using semicolon | http://www.techiedelight.com/print-numbers-1-n-without-using-semicolon/ |
| 6.Swap two numbers without using third variable | 5 methods | http://www.techiedelight.com/swap-two-numbers-without-using-third-variable/ |
| 7.Determine the if condition to print specific output | http://www.techiedelight.com/determine-condition-to-print-specific-output/ |
| 8.Find maximum, minimum of three numbers without using conditional statement and ternary operator | 4 methods | http://www.techiedelight.com/maximum-minimum-three-numbers-without-using-conditional-statement-ternary-operator/ |
| 9.Find numbers represented as sum of two cubes for two different pairs | http://www.techiedelight.com/numbers-represented-as-sum-of-two-cubes/ |
| 10.Print “Hello World” with empty main() function | 3 methods | http://www.techiedelight.com/print-hello-world-empty-main-function/ |
| 11.Tower of Hanoi Problem | http://www.techiedelight.com/tower-of-hanoi-problem/ |
| 12.Print all numbers between 1 to N without using any loop | 4 methods | http://www.techiedelight.com/print-numbers-1-n-without-using-loop-4-methods/ |
| 13.Print a semicolon without using semicolon anywhere in the program | http://www.techiedelight.com/print-a-semicolon-without-using-semicolon-anywhere-program/ |
| 14.Multiply two numbers without using multiplication operator or loops | http://www.techiedelight.com/multiply-two-numbers-without-using-multiplication-operator-loops/ |
| 15.Find square of a number without using multiplication and division operator | 3 methods | http://www.techiedelight.com/find-square-number-without-using-multiplication-division-operator/ |
| 16.Find if a number is even or odd without using any conditional statement | http://www.techiedelight.com/find-number-even-odd-without-using-conditional-statement/ |
| 17.Set both elements of a binary array to 0 in single line | http://www.techiedelight.com/set-elements-binary-array-0-single-line/ |
| 18.Find minimum number without using conditional statement or ternary operator | http://www.techiedelight.com/find-minimum-number-without-using-conditional-statement-ternary-operator/ |
| 19.Perform Division of two numbers without using division operator (/) | http://www.techiedelight.com/perform-division-two-numbers-without-using-division-operator/ |
| 20.Generate 0 and 1 with 75% and 25% Probability | http://www.techiedelight.com/generate-0-1-75-25-probability/ |
| 21.Generate Desired Random Numbers With Equal Probability | http://www.techiedelight.com/generate-random-numbers-equal-probability/ |
| 22.Return 0, 1 and 2 with equal Probability using the specified function | http://www.techiedelight.com/return-0-1-2-equal-probability-using-specified-function/ |
| 23.Generate Fair Results from a Biased Coin | http://www.techiedelight.com/generate-fair-results-biased-coin/ |
| 24.Generate numbers from 1 to 7 with equal probability using specified function | http://www.techiedelight.com/generate-numbers-1-7-equal-probability/ |
| 25.Implement Ternary Operator Without Using Conditional Expressions | http://www.techiedelight.com/implement-ternary-operator-without-using-conditional-statements/ |
| 26.Determine if two integers are equal without using comparison and arithmetic operators | http://www.techiedelight.com/determine-two-integers-equal-without-using-comparison-arithmetic-operators/ |
| 27.Return 0 and 1 with equal Probability using the specified function | http://www.techiedelight.com/get-0-1-equal-probability-using-specified-function/ |
| 28.Generate Random Input from an Array according to given Probabilities | http://www.techiedelight.com/generate-random-input-array-according-given-probabilities/ |
| 29.Generate Fair Results from a Biased Coin | http://www.techiedelight.com/generate-fair-results-biased-coin/ |
| 30.Magnet Puzzle | http://www.techiedelight.com/magnet-puzzle/ |
|
Readme
| https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms#readme-ov-file |
| Please reload this page | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms |
|
Activity | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/activity |
|
0
stars | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/stargazers |
|
0
watching | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/watchers |
|
0
forks | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/forks |
|
Report repository
| https://patch-diff.githubusercontent.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fscubeaitech-admin%2FDataStructuresAlgorithms&report=scubeaitech-admin+%28user%29 |
| Releases | https://patch-diff.githubusercontent.com/scubeaitech-admin/DataStructuresAlgorithms/releases |
| Packages
0 | https://patch-diff.githubusercontent.com/users/scubeaitech-admin/packages?repo_name=DataStructuresAlgorithms |
|
| https://github.com |
| Terms | https://docs.github.com/site-policy/github-terms/github-terms-of-service |
| Privacy | https://docs.github.com/site-policy/privacy-policies/github-privacy-statement |
| Security | https://github.com/security |
| Status | https://www.githubstatus.com/ |
| Community | https://github.community/ |
| Docs | https://docs.github.com/ |
| Contact | https://support.github.com?tags=dotcom-footer |