{"id":19784333,"url":"https://github.com/alexprut/interviewbit","last_synced_at":"2025-07-28T05:04:53.952Z","repository":{"id":67790676,"uuid":"195545921","full_name":"alexprut/InterviewBit","owner":"alexprut","description":"🍒 Solution to InterviewBit problems","archived":false,"fork":false,"pushed_at":"2023-04-24T11:59:44.000Z","size":120,"stargazers_count":4,"open_issues_count":1,"forks_count":5,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-30T22:39:03.977Z","etag":null,"topics":["algorithms","interviewbit"],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/alexprut.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-07-06T14:04:17.000Z","updated_at":"2024-09-20T12:56:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"4b543733-b1f9-4ec1-83e2-30dbb6ee5665","html_url":"https://github.com/alexprut/InterviewBit","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/alexprut/InterviewBit","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alexprut%2FInterviewBit","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alexprut%2FInterviewBit/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alexprut%2FInterviewBit/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alexprut%2FInterviewBit/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/alexprut","download_url":"https://codeload.github.com/alexprut/InterviewBit/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/alexprut%2FInterviewBit/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267464522,"owners_count":24091505,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-07-28T02:00:09.689Z","response_time":68,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","interviewbit"],"created_at":"2024-11-12T06:11:12.630Z","updated_at":"2025-07-28T05:04:53.928Z","avatar_url":"https://github.com/alexprut.png","language":"Java","readme":"\u003cdiv align=\"center\"\u003e\n\u003cimg src=\"https://github.com/alexprut/InterviewBit/raw/master/interviewbit-logo.png\" width=\"450\" height=\"auto\"/\u003e\n\n[![Solutions](https://img.shields.io/badge/solutions-108%2F301-green.svg?style=flat-square)](https://github.com/alexprut/InterviewBit#table-of-contents)\n[![Languages](https://img.shields.io/badge/languages-c%2B%2B%2Cjava%2Chaskell-yellow.svg)](https://github.com/alexprut/InterviewBit#table-of-contents)\n[![Author](https://img.shields.io/badge/author-alexprut-brightgreen.svg?style=flat-square)](https://www.interviewbit.com/profile/alexprut)\n[![MIT](https://img.shields.io/dub/l/vibe-d.svg?style=flat-square)](https://github.com/alexprut/InterviewBit/blob/master/LICENSE)\n\u003c/div\u003e\n\u003cbr\u003e\n\u003cbr\u003e\n\n### Disclaimer\n\n\u003ctable\u003e\n  \u003ctr\u003e\n    \u003ctd\u003e\n      \u003ca href=\"https://github.com/alexprut/Algo\"\u003e\n        \u003cimg src=\"https://github.com/alexprut/Algo/raw/master/src/main/resources/logo.png\" width=\"80\" height=\"auto\"/\u003e\n      \u003c/a\u003e\n    \u003c/td\u003e\n    \u003ctd\u003e\n      Most of the problems are solved by using the \u003ca href=\"https://github.com/alexprut/Algo\"\u003eAlgo\u003c/a\u003e library.\n    \u003c/td\u003e \n  \u003c/tr\u003e\n  \u003ctr\u003e\n      \u003ctd\u003e\n        \u003ca href=\"https://github.com/alexprut/HackerRank\"\u003e\n          \u003cimg src=\"https://github.com/alexprut/HackerRank/raw/master/hackerrank-logo.png\" width=\"80\" height=\"auto\"/\u003e\n        \u003c/a\u003e\n      \u003c/td\u003e\n      \u003ctd\u003e\n        Solutions to \u003ca href=\"https://github.com/alexprut/HackerRank\"\u003eHackerRank\u003c/a\u003e problems.\n      \u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\n          \u003ca href=\"https://github.com/alexprut/LeetCode\"\u003e\n            \u003cimg src=\"https://github.com/alexprut/LeetCode/raw/master/leetcode-logo.png\" width=\"80\" height=\"auto\"/\u003e\n          \u003c/a\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\n          Solutions to \u003ca href=\"https://github.com/alexprut/LeetCode\"\u003eLeetCode\u003c/a\u003e problems.\n        \u003c/td\u003e\n      \u003c/tr\u003e\n\u003c/table\u003e\n\nThe problem solutions and implementations are entirely provided by [Alex Prut](https://www.interviewbit.com/profile/alexprut).\nThe code is not refactored, no coding style is followed, the only purpose of the written code is to pass all the\nplatform tests of a given problem.\n\n## Table of contents\n1. [Time Complexity](#time-complexity)\n1. [Arrays](#arrays)\n1. [Math](#math)\n1. [Binary Search](#binary-search)\n1. [Strings](#strings)\n1. [Bit Manipulation](#bit-manipulation)\n1. [Two Pointers](#two-pointers)\n1. [Linked Lists](#linked-lists)\n1. [Stacks And Queues](#stacks-and-queues)\n1. [Backtracking](#backtracking)\n1. [Hashing](#hashing)\n1. [Heaps And Maps](#heaps-and-maps)\n1. [Tree Data Structure](#tree-data-structure)\n1. [Dynamic Programming](#dynamic-programming)\n1. [Greedy Algorithm](#greedy-algorithm)\n1. [Graph Data Structure And Algorithms](#graph-data-structure-and-algorithms)\n\n\n## Time Complexity\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Basic primer|[LOOP_CMPL](https://www.interviewbit.com/problems/loopcmpl/)|20|[Solution.txt](Time%20Complexity/LOOP_CMPL/Solution.txt)|\n|Basic primer|[NESTED_CMPL](https://www.interviewbit.com/problems/nestedcmpl/)|20|[Solution.txt](Time%20Complexity/NESTED_CMPL/Solution.txt)|\n|Basic primer|[NESTED_CMPL2](https://www.interviewbit.com/problems/nestedcmpl2/)|30|[Solution.txt](Time%20Complexity/NESTED_CMPL2/Solution.txt)|\n|Basic primer|[CHOOSE4](https://www.interviewbit.com/problems/choose4/)|50|[Solution.txt](Time%20Complexity/CHOOSE4/Solution.txt)|\n|Math|[WHILE_CMPL](https://www.interviewbit.com/problems/whilecmpl/)|50|[Solution.txt](Time%20Complexity/WHILE_CMPL/Solution.txt)|\n|Math|[NESTED_CMPL3](https://www.interviewbit.com/problems/nestedcmpl3/)|80|[Solution.txt](Time%20Complexity/[NESTED_CMPL3/Solution.txt)|\n|Math|[LOOP_CMPL2](https://www.interviewbit.com/problems/loopcmpl2/)|80|[Solution.txt](Time%20Complexity/LOOP_CMPL2/Solution.txt)|\n|Math|[GCD_CMPL](https://www.interviewbit.com/problems/gcdcmpl/)|150|[Solution.txt](Time%20Complexity/GCD_CMPL/Solution.txt)|\n|Compare functions|[CHOOSE1](https://www.interviewbit.com/problems/choose1/)|50|[Solution.txt](Time%20Complexity/CHOOSE1/Solution.txt)|\n|Compare functions|[CHOOSE3](https://www.interviewbit.com/problems/choose3/)|50|[Solution.txt](Time%20Complexity/CHOOSE3/Solution.txt)|\n|Compare functions|[CHOOSE2](https://www.interviewbit.com/problems/choose2/)|80|[Solution.txt](Time%20Complexity/CHOOSE2/Solution.txt)|\n|Function calling itself|[REC_CMPL1](https://www.interviewbit.com/problems/reccmpl1/)|80|[Solution.txt](Time%20Complexity/REC_CMPL1/Solution.txt)|\n|Function calling itself|[REC_CMPL2](https://www.interviewbit.com/problems/reccmpl2/)|80|[Solution.txt](Time%20Complexity/REC_CMPL2/Solution.txt)|\n|Function calling itself|[REC_CMPL3](https://www.interviewbit.com/problems/reccmpl3/)|150|[Solution.txt](Time%20Complexity/REC_CMPL3/Solution.txt)|\n|Amortized complexity|[AMORTIZED1](https://www.interviewbit.com/problems/amortized1/)|100|[Solution.txt](Time%20Complexity/AMORTIZED1/Solution.txt)|\n\n## Arrays\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Array math|[Min Steps in Infinite Grid](https://www.interviewbit.com/problems/min-steps-in-infinite-grid/)|150|[Solution.java](Arrays/Min%20Steps%20in%20Infinite%20Grid/Solution.java)|\n|Array math|[Add One To Number](https://www.interviewbit.com/problems/add-one-to-number/)|225|Solution|\n|Array math|[Max Sum Contiguous Subarray](https://www.interviewbit.com/problems/max-sum-contiguous-subarray/)|225|Solution|\n|Array math|[Maximum Absolute Difference](https://www.interviewbit.com/problems/maximum-absolute-difference/)|250|Solution|\n|Array math|[Repeat and Missing Number Array](https://www.interviewbit.com/problems/repeat-and-missing-number-array/)|350|Solution|\n|Array math|[Flip](https://www.interviewbit.com/problems/flip/)|400|Solution|\n|Simulation array|[Max Non Negative SubArray](https://www.interviewbit.com/problems/max-non-negative-subarray/)|150|[Solution.java](Arrays/Max%20Non%20Negative%20SubArray/Solution.java)|\n|Simulation array|[Spiral Order Matrix II](https://www.interviewbit.com/problems/spiral-order-matrix-ii/)|225|Solution|\n|Simulation array|[Pascal Triangle](https://www.interviewbit.com/problems/pascal-triangle/)|225|[Solution.java](Arrays/Pascal%20Triangle/Solution.java)|\n|Simulation array|[Kth Row of Pascal's Triangle](https://www.interviewbit.com/problems/kth-row-of-pascals-triangle/)|225|Solution|\n|Simulation array|[Anti Diagonals](https://www.interviewbit.com/problems/anti-diagonals/)|225|Solution|\n|Bucketing|[Noble Integer](https://www.interviewbit.com/problems/noble-integer/)|200|[Solution.java](Arrays/Noble%20Integer/Solution.java)|\n|Bucketing|[Triplets with Sum between given range](https://www.interviewbit.com/problems/triplets-with-sum-between-given-range/)|200|Solution|\n|Bucketing|[Largest Number](https://www.interviewbit.com/problems/largest-number/)|225|[Solution.java](Arrays/Largest%20Number/Solution.java)|\n|Bucketing|[Wave Array](https://www.interviewbit.com/problems/wave-array/)|225|[Solution.java](Arrays/Wave%20Array/Solution.java)|\n|Bucketing|[Hotel Bookings Possible](https://www.interviewbit.com/problems/hotel-bookings-possible/)|225|Solution|\n|Bucketing|[Max Distance](https://www.interviewbit.com/problems/max-distance/)|250|Solution|\n|Bucketing|[Maximum Unsorted Subarray](https://www.interviewbit.com/problems/maximum-unsorted-subarray/)|250|Solution|\n|Bucketing|[Find Duplicate in Array](https://www.interviewbit.com/problems/find-duplicate-in-array/)|450|[Solution.java](Arrays/Find%20Duplicate%20in%20Array/Solution.java)|\n|Bucketing|[Maximum Consecutive Gap](https://www.interviewbit.com/problems/maximum-consecutive-gap/)|450|Solution|\n|Array|[MAXSPPROD](https://www.interviewbit.com/problems/maxspprod/)|200|[Solution.java](Array/MAXSPPROD/Solution.java)|\n|Arrangement|[Largest Number](https://www.interviewbit.com/problems/largest-number/)|225|[Solution.java](Arrays/Largest%20Number2/Solution.java)|\n|Arrangement|[Rotate Matrix](https://www.interviewbit.com/problems/rotate-matrix/)|300|Solution|\n|Arrangement|[Next Permutation](https://www.interviewbit.com/problems/next-permutation/)|300|Solution|\n|Arrangement|[Find Permutation](https://www.interviewbit.com/problems/find-permutation/)|300|Solution|\n|Value ranges|[Merge Intervals](https://www.interviewbit.com/problems/merge-intervals/)|225|Solution|\n|Value ranges|[Merge Overlapping Intervals](https://www.interviewbit.com/problems/merge-overlapping-intervals/)|225|[Solution.java](Arrays/Merge%20Overlapping%20Intervals/Solution.java)|\n|Bucketing or sorting|[Hotel Bookings Possible](https://www.interviewbit.com/problems/hotel-bookings-possible/)|225|Solution|\n|Bucketing or sorting|[Wave Array](https://www.interviewbit.com/problems/wave-array/)|225|[Solution.java](Arrays/Wave%20Array/Solution.java)|\n|Bucketing or sorting|[Largest Number](https://www.interviewbit.com/problems/largest-number/)|225|[Solution.java](Arrays/Largest%20Number3/Solution.java)|\n|Bucketing or sorting|[Max Distance](https://www.interviewbit.com/problems/max-distance/)|250|Solution|\n|Bucketing or sorting|[Maximum Unsorted Subarray](https://www.interviewbit.com/problems/maximum-unsorted-subarray/)|250|Solution|\n|Bucketing or sorting|[Find Duplicate in Array](https://www.interviewbit.com/problems/find-duplicate-in-array/)|450|[Solution.java](Arrays/Find%20Duplicate%20in%20Array2/Solution.java)|\n|Bucketing or sorting|[Maximum Consecutive Gap](https://www.interviewbit.com/problems/maximum-consecutive-gap/)|450|Solution|\n|Space recycle|[Set Matrix Zeros](https://www.interviewbit.com/problems/set-matrix-zeros/)|300|[Solution.java](Arrays/Set%20Matrix%20Zeros/Solution.java)|\n|Space recycle|[First Missing Integer](https://www.interviewbit.com/problems/first-missing-integer/)|300|Solution|\n|Missing / repeated number|[First Missing Integer](https://www.interviewbit.com/problems/first-missing-integer/)|300|Solution|\n|Missing / repeated number|[Repeat and Missing Number Array](https://www.interviewbit.com/problems/repeat-and-missing-number-array/)|350|Solution|\n|Missing / repeated number|[Find Duplicate in Array](https://www.interviewbit.com/problems/find-duplicate-in-array/)|450|[Solution.java](Arrays/Find%20Duplicate%20in%20Array3/Solution.java)|\n|Missing / repeated number|[N/3 Repeat Number](https://www.interviewbit.com/problems/n3-repeat-number/)|600|Solution|\n\n## Math\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Adhoc|[Prime Sum](https://www.interviewbit.com/problems/prime-sum/)|150|[Solution.java](Math/Prime%20Sum/Solution.java)|\n|Adhoc|[Sum of pairwise Hamming Distance](https://www.interviewbit.com/problems/sum-of-pairwise-hamming-distance/)|200|Solution|\n|Adhoc|[FizzBuzz](https://www.interviewbit.com/problems/fizzbuzz/)|200|[Solution.java](Math/FizzBuzz/Solution.java)|\n|Adhoc|[Power Of Two Integers](https://www.interviewbit.com/problems/power-of-two-integers/)|250|Solution|\n|Base conversion|[Excel Column Number](https://www.interviewbit.com/problems/excel-column-number/)|175|[Solution.java](Math/Excel%20Column%20Number/Solution.java)|\n|Base conversion|[Excel Column Title](https://www.interviewbit.com/problems/excel-column-title/)|175|Solution|\n|Digit op|[Palindrome Integer](https://www.interviewbit.com/problems/palindrome-integer/)|200|[Solution.java](Math/Palindrome%20Integer/Solution.java)|\n|Digit op|[Reverse integer](https://www.interviewbit.com/problems/reverse-integer/)|200|Solution|\n|Number theory|[Greatest Common Divisor](https://www.interviewbit.com/problems/greatest-common-divisor/)|200|[Solution.java](Math/Greatest%20Common%20Divisor/Solution.java)|\n|Number theory|[Trailing Zeros in Factorial](https://www.interviewbit.com/problems/trailing-zeros-in-factorial/)|250|Solution|\n|Number theory|[Sorted Permutation Rank](https://www.interviewbit.com/problems/sorted-permutation-rank/)|250|Solution|\n|Number theory|[Largest Coprime Divisor](https://www.interviewbit.com/problems/largest-coprime-divisor/)|250|Solution|\n|Number theory|[Sorted Permutation Rank with Repeats](https://www.interviewbit.com/problems/sorted-permutation-rank-with-repeats/)|500|Solution|\n|Array dp|[Numbers of length N and value less than K](https://www.interviewbit.com/problems/numbers-of-length-n-and-value-less-than-k/)|200|Solution|\n|Number encoding|[Rearrange Array](https://www.interviewbit.com/problems/rearrange-array/)|250|[Solution.java](Math/Rearrange%20Array/Solution.java)|\n|Combinatorics|[City Tour](https://www.interviewbit.com/problems/city-tour/)|300|Solution|\n|Combinatorics|[Grid Unique Paths](https://www.interviewbit.com/problems/grid-unique-paths/)|375|[Solution.java](Math/Grid%20Unique%20Paths/Solution.java)|\n\n## Binary Search\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Search answer|[Matrix Median](https://www.interviewbit.com/problems/matrix-median/)|225|Solution|\n|Search answer|[Square Root of Integer](https://www.interviewbit.com/problems/square-root-of-integer/)|275|[Solution.java](Binary%20Search/Square%20Root%20of%20Integer/Solution.java)|\n|Search answer|[Painter's Partition Problem](https://www.interviewbit.com/problems/painters-partition-problem/)|350|Solution|\n|Search answer|[Allocate Books](https://www.interviewbit.com/problems/allocate-books/)|350|Solution|\n|Simple binary search|[Matrix Search](https://www.interviewbit.com/problems/matrix-search/)|250|[Solution.java](Binary%20Search/Matrix%20Search/Solution.java)|\n|Simple binary search|[Search for a Range](https://www.interviewbit.com/problems/search-for-a-range/)|250|[Solution.java](Binary%20Search/Search%20for%20a%20Range/Solution.java)|\n|Simple binary search|[Sorted Insert Position](https://www.interviewbit.com/problems/sorted-insert-position/)|250|[Solution.java](Binary%20Search/Sorted%20Insert%20Position/Solution.java)|\n|Search step simulation|[Implement Power Function](https://www.interviewbit.com/problems/implement-power-function/)|275|Solution|\n|Sort modification|[Rotated Sorted Array Search](https://www.interviewbit.com/problems/rotated-sorted-array-search/)|325|[Solution.java](Binary%20Search/Rotated%20Sorted%20Array%20Search/Solution.java)|\n|Sort modification|[Median of Array](https://www.interviewbit.com/problems/median-of-array/)|325|Solution|\n\n## Strings\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|String simulation|[Palindrome String](https://www.interviewbit.com/problems/palindrome-string/)|150|[Solution.java](Strings/Palindrome%20String/Solution.java)|\n|String simulation|[Longest Common Prefix](https://www.interviewbit.com/problems/longest-common-prefix/)|225|Solution|\n|String simulation|[Count And Say](https://www.interviewbit.com/problems/count-and-say/)|250|Solution|\n|Programming|[Amazing Subarrays](https://www.interviewbit.com/problems/amazing-subarrays/)|150|[Solution.java](Strings/Amazing%20Subarrays/Solution.java)|\n|Programming|[Stringoholics](https://www.interviewbit.com/problems/stringoholics/)|300|Solution|\n|String tricks|[Minimum Characters required to make a String Palindromic](https://www.interviewbit.com/problems/minimum-characters-required-to-make-a-string-palindromic/)|200|Solution|\n|String tricks|[Longest Palindromic Substring](https://www.interviewbit.com/problems/longest-palindromic-substring/)|500|Solution|\n|String search|[Minimum Characters required to make a String Palindromic](https://www.interviewbit.com/problems/minimum-characters-required-to-make-a-string-palindromic/)|200|Solution|\n|String search|[Implement StrStr](https://www.interviewbit.com/problems/implement-strstr/)|225|[Solution.java](Strings/Implement%20StrStr/Solution.java)|\n|String parsing|[Minimum Characters required to make a String Palindromic](https://www.interviewbit.com/problems/minimum-characters-required-to-make-a-string-palindromic/)|200|Solution|\n|String parsing|[Compare Version Numbers](https://www.interviewbit.com/problems/compare-version-numbers/)|225|Solution|\n|String parsing|[Atoi](https://www.interviewbit.com/problems/atoi/)|250|Solution|\n|String parsing|[Valid Number](https://www.interviewbit.com/problems/valid-number/)|250|Solution|\n|String parsing|[Valid Ip Addresses](https://www.interviewbit.com/problems/valid-ip-addresses/)|250|Solution|\n|Words|[Length of Last Word](https://www.interviewbit.com/problems/length-of-last-word/)|225|[Solution.java](Strings/Length%20of%20Last%20Word/Solution.java)|\n|Words|[Reverse the String](https://www.interviewbit.com/problems/reverse-the-string/)|250|Solution|\n|String math|[Roman To Integer](https://www.interviewbit.com/problems/roman-to-integer/)|250|[Solution.java](Strings/Roman%20To%20Integer/Solution.java)|\n|String math|[Integer To Roman](https://www.interviewbit.com/problems/integer-to-roman/)|250|Solution|\n|String math|[Add Binary Strings](https://www.interviewbit.com/problems/add-binary-strings/)|300|Solution|\n|String math|[Power of 2](https://www.interviewbit.com/problems/power-of-2/)|350|Solution|\n|String math|[Multiply Strings](https://www.interviewbit.com/problems/multiply-strings/)|375|Solution|\n|Pretty print|[Justified Text](https://www.interviewbit.com/problems/justified-text/)|300|Solution|\n|Pretty print|[Zigzag String](https://www.interviewbit.com/problems/zigzag-string/)|300|[Solution.java](Strings/Zigzag%20String/Solution.java)|\n|Pretty print|[Pretty Json](https://www.interviewbit.com/problems/pretty-json/)|400|Solution|\n\n## Bit Manipulation\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Bucketing|[Min XOR value](https://www.interviewbit.com/problems/min-xor-value/)|200|[Solution.java](Bit%20Manipulation/Min%20XOR%20value/Solution.java)|\n|Bit play|[Number of 1 Bits](https://www.interviewbit.com/problems/number-of-1-bits/)|200|[Solution.java](Bit%20Manipulation/Number%20of%201%20Bits/Solution.java)|\n|Bit play|[Reverse Bits](https://www.interviewbit.com/problems/reverse-bits/)|225|[Solution.java](Bit%20Manipulation/Reverse%20Bits/Solution.java)|\n|Bit play|[Divide Integers](https://www.interviewbit.com/problems/divide-integers/)|250|Solution|\n|Bit play|[Different Bits Sum Pairwise](https://www.interviewbit.com/problems/different-bits-sum-pairwise/)|300|Solution|\n|Bit array|[Single Number](https://www.interviewbit.com/problems/single-number/)|275|[Solution.java](Bit%20Manipulation/Single%20Number/Solution.java)|\n|Bit array|[Single Number II](https://www.interviewbit.com/problems/single-number-ii/)|275|Solution|\n\n## Two Pointers\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Multiple arrays|[Merge Two Sorted Lists II](https://www.interviewbit.com/problems/merge-two-sorted-lists-ii/)|200|[Solution.java](Two%20Pointers/Merge%20Two%20Sorted%20Lists%20II/Solution.java)|\n|Multiple arrays|[Intersection Of Sorted Arrays](https://www.interviewbit.com/problems/intersection-of-sorted-arrays/)|225|[Solution.java](Two%20Pointers/Intersection%20Of%20Sorted%20Arrays/Solution.java)|\n|Two pointer|[Minimize the absolute difference](https://www.interviewbit.com/problems/minimize-the-absolute-difference/)|200|Solution|\n|Sorting|[3 Sum](https://www.interviewbit.com/problems/3-sum/)|225|Solution|\n|Sorting|[3 Sum Zero](https://www.interviewbit.com/problems/3-sum-zero/)|225|Solution|\n|Sorting|[Counting Triangles](https://www.interviewbit.com/problems/counting-triangles/)|225|Solution|\n|Sorting|[Diffk](https://www.interviewbit.com/problems/diffk/)|300|[Solution.java](Two%20Pointers/Diffk/Solution.java)|\n|Inplace update|[Remove Duplicates from Sorted Array](https://www.interviewbit.com/problems/remove-duplicates-from-sorted-array/)|250|[Solution.java](Two%20Pointers/Remove%20Duplicates%20from%20Sorted%20Array/Solution.java)|\n|Inplace update|[Remove Duplicates from Sorted Array II](https://www.interviewbit.com/problems/remove-duplicates-from-sorted-array-ii/)|250|Solution|\n|Inplace update|[Remove Element from Array](https://www.interviewbit.com/problems/remove-element-from-array/)|250|Solution|\n|Inplace update|[Sort by Color](https://www.interviewbit.com/problems/sort-by-color/)|325|[Solution.java](Two%20Pointers/Sort%20by%20Color/Solution.java)|\n|Tricks|[Max Continuous Series of 1s](https://www.interviewbit.com/problems/max-continuous-series-of-1s/)|300|Solution|\n|Tricks|[Array 3 Pointers](https://www.interviewbit.com/problems/array-3-pointers/)|400|Solution|\n|Tricks|[Container With Most Water](https://www.interviewbit.com/problems/container-with-most-water/)|400|[Solution.java](Two%20Pointers/Container%20With%20Most%20Water/Solution.java)|\n\n## Linked Lists\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|List 2 pointer|[Palindrome List](https://www.interviewbit.com/problems/palindrome-list/)|200|Solution|\n|List 2 pointer|[Remove Duplicates from Sorted List](https://www.interviewbit.com/problems/remove-duplicates-from-sorted-list/)|300|[Solution.java](Linked%20Lists/Remove%20Duplicates%20from%20Sorted%20List/Solution.java)|\n|List 2 pointer|[Remove Duplicates from Sorted List II](https://www.interviewbit.com/problems/remove-duplicates-from-sorted-list-ii/)|300|Solution|\n|List 2 pointer|[Merge Two Sorted Lists](https://www.interviewbit.com/problems/merge-two-sorted-lists/)|300|[Solution.java](Linked%20Lists/Merge%20Two%20Sorted%20Lists/Solution.java)|\n|List 2 pointer|[Remove Nth Node from List End](https://www.interviewbit.com/problems/remove-nth-node-from-list-end/)|350|Solution|\n|List 2 pointer|[Rotate List](https://www.interviewbit.com/problems/rotate-list/)|350|[Solution.java](Linked%20Lists/Rotate%20List/Solution.java)|\n|List 2 pointer|[Reverse Link List II](https://www.interviewbit.com/problems/reverse-link-list-ii/)|450|Solution|\n|List 2 pointer|[Reorder List](https://www.interviewbit.com/problems/reorder-list/)|600|Solution|\n|Pointer move|[K reverse linked list](https://www.interviewbit.com/problems/k-reverse-linked-list/)|200|Solution|\n|Pointer move|[Swap List Nodes in pairs](https://www.interviewbit.com/problems/swap-list-nodes-in-pairs/)|350|[Solution.java](Linked%20Lists/Swap%20List%20Nodes%20in%20pairs/Solution.java)|\n|Pointer move|[Reverse Link List II](https://www.interviewbit.com/problems/reverse-link-list-ii/)|450|Solution|\n|Pointer move|[Reorder List](https://www.interviewbit.com/problems/reorder-list/)|600|Solution|\n|List math|[Add Two Numbers as Lists](https://www.interviewbit.com/problems/add-two-numbers-as-lists/)|250|Solution|\n|List math|[List Cycle](https://www.interviewbit.com/problems/list-cycle/)|600|[Solution.java](Linked%20Lists/List%20Cycle/Solution.java)|\n|List sort|[Partition List](https://www.interviewbit.com/problems/partition-list/)|275|Solution|\n|List sort|[Insertion Sort List](https://www.interviewbit.com/problems/insertion-sort-list/)|300|[Solution.java](Linked%20Lists/Insertion%20Sort%20List/Solution.java)|\n|List sort|[Sort List](https://www.interviewbit.com/problems/sort-list/)|350|Solution|\n|List trick|[Reverse Link List II](https://www.interviewbit.com/problems/reverse-link-list-ii/)|450|Solution|\n|List trick|[Reorder List](https://www.interviewbit.com/problems/reorder-list/)|600|Solution|\n|List cycle|[List Cycle](https://www.interviewbit.com/problems/list-cycle/)|600|[Solution.java](Linked%20Lists/List%20Cycle/Solution.java)|\n\n## Stacks And Queues\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Stack simple|[Simplify Directory Path](https://www.interviewbit.com/problems/simplify-directory-path/)|250|Solution|\n|Stack simple|[Redundant Braces](https://www.interviewbit.com/problems/redundant-braces/)|300|[Solution.java](Stacks%20And%20Queues/Redundant%20Braces/Solution.java)|\n|Cleverstack|[Nearest Smaller Element](https://www.interviewbit.com/problems/nearest-smaller-element/)|350|[Solution.java](Stacks%20And%20Queues/Nearest%20Smaller%20Element/Solution.java)|\n|Cleverstack|[Largest Rectangle in Histogram](https://www.interviewbit.com/problems/largest-rectangle-in-histogram/)|450|Solution|\n|Cleverstack|[Sliding Window Maximum](https://www.interviewbit.com/problems/sliding-window-maximum/)|450|Solution|\n|Stack math|[Evaluate Expression](https://www.interviewbit.com/problems/evaluate-expression/)|400|[Solution.java](Stacks%20And%20Queues/Evaluate%20Expression/Solution.java)|\n|Stack math|[Rain Water Trapped](https://www.interviewbit.com/problems/rain-water-trapped/)|400|Solution|\n|Multiple stack|[Min Stack](https://www.interviewbit.com/problems/min-stack/)|400|Solution|\n\n## Backtracking\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Subsets|[Subset](https://www.interviewbit.com/problems/subset/)|250|[Solution.java](Backtracking/Subset/Solution.java)|\n|Subsets|[Combinations](https://www.interviewbit.com/problems/combinations/)|300|Solution|\n|Subsets|[Combination Sum](https://www.interviewbit.com/problems/combination-sum/)|300|Solution|\n|Subsets|[Combination Sum II](https://www.interviewbit.com/problems/combination-sum-ii/)|300|Solution|\n|Subsets|[Subsets II](https://www.interviewbit.com/problems/subsets-ii/)|300|Solution|\n|Bruteforce builder|[Letter Phone](https://www.interviewbit.com/problems/letter-phone/)|250|Solution|\n|Bruteforce builder|[Palindrome Partitioning](https://www.interviewbit.com/problems/palindrome-partitioning/)|300|Solution|\n|Bruteforce builder|[Generate all Parentheses II](https://www.interviewbit.com/problems/generate-all-parentheses-ii/)|350|[Solution.java](Backtracking/Generate%20all%20Parentheses%20II/Solution.java)|\n|Pruned builder|[Palindrome Partitioning](https://www.interviewbit.com/problems/palindrome-partitioning/)|300|Solution|\n|Bruteforce builder|[Generate all Parentheses II](https://www.interviewbit.com/problems/generate-all-parentheses-ii/)|350|[Solution.java](Backtracking/Generate%20all%20Parentheses%20II2/Solution.java)|\n|Pruned builder|[NQueens](https://www.interviewbit.com/problems/nqueens/)|550|Solution|\n|Pruned builder|[Sudoku](https://www.interviewbit.com/problems/sudoku/)|700|Solution|\n|Permutations|[Permutations](https://www.interviewbit.com/problems/permutations/)|350|[Solution.java](Backtracking/Permutations/Solution.java)|\n|Maths and backtracking|[Gray Code](https://www.interviewbit.com/problems/gray-code/)|350|Solution|\n|Maths and backtracking|[Kth Permutation Sequence](https://www.interviewbit.com/problems/kth-permutation-sequence/)|350|Solution|\n|Game solving|[NQueens](https://www.interviewbit.com/problems/nqueens/)|550|Solution|\n|Game solving|[Sudoku](https://www.interviewbit.com/problems/sudoku/)|700|Solution|\n\n## Hashing\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Hash search|[Colorful Number](https://www.interviewbit.com/problems/colorful-number/)|150|Solution|\n|Hash search|[Largest Continuous Sequence Zero Sum](https://www.interviewbit.com/problems/largest-continuous-sequence-zero-sum/)|200|Solution|\n|Hash search|[2 Sum](https://www.interviewbit.com/problems/2-sum/)|300|Solution|\n|Hash search|[4 Sum](https://www.interviewbit.com/problems/4-sum/)|325|Solution|\n|Hash search|[Valid Sudoku](https://www.interviewbit.com/problems/valid-sudoku/)|325|Solution|\n|Hash search|[Diffk II](https://www.interviewbit.com/problems/diffk-ii/)|375|[Solution.java](Hashing/Diffk%20II/Solution.java)|\n|Key formation|[Anagrams](https://www.interviewbit.com/problems/anagrams/)|350|[Solution.java](Hashing/Anagrams/Solution.java)|\n|Key formation|[Equal](https://www.interviewbit.com/problems/equal/)|350|Solution|\n|Key formation|[Copy List](https://www.interviewbit.com/problems/copy-list/)|450|Solution|\n|Hashing two pointer|[Longest Substring Without Repeat](https://www.interviewbit.com/problems/longest-substring-without-repeat/)|350|[Solution.java](Hashing/Longest%20Substring%20Without%20Repeat/Solution.java)|\n|Hashing two pointer|[Window String](https://www.interviewbit.com/problems/window-string/)|350|Solution|\n|Maths and hashing|[Fraction](https://www.interviewbit.com/problems/fraction/)|450|Solution|\n|Maths and hashing|[Points on the Straight Line](https://www.interviewbit.com/problems/points-on-the-straight-line/)|450|Solution|\n|Incremental hash|[Substring Concatenation](https://www.interviewbit.com/problems/substring-concatenation/)|1000|Solution|\n\n## Heaps And Maps\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Heap|[N max pair combinations](https://www.interviewbit.com/problems/n-max-pair-combinations/)|200|Solution|\n|Heap|[Magician and Chocolates](https://www.interviewbit.com/problems/magician-and-chocolates/)|250|[Solution.java](Heaps%20And%20Maps/Magician%20and%20Chocolates/Solution.java)|\n|Heap|[Merge K Sorted Lists](https://www.interviewbit.com/problems/merge-k-sorted-lists/)|600|[Solution.java](Heaps%20And%20Maps/Merge%20K%20Sorted%20Lists/Solution.java)|\n|Math|[Ways to form Max Heap](https://www.interviewbit.com/problems/ways-to-form-max-heap/)|200|Solution|\n|Heapmap|[Distinct Numbers in Window](https://www.interviewbit.com/problems/distinct-numbers-in-window/)|600|[Solution.java](Heaps%20And%20Maps/Distinct%20Numbers%20in%20Window/Solution.java)|\n|Heapmap|[LRU Cache](https://www.interviewbit.com/problems/lru-cache/)|1000|Solution|\n\n## Tree Data Structure\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Traversal|[Vertical Order traversal of Binary Tree](https://www.interviewbit.com/problems/vertical-order-traversal-of-binary-tree/)|200|Solution|\n|Traversal|[Inorder Traversal](https://www.interviewbit.com/problems/inorder-traversal/)|350|Solution|\n|Traversal|[Postorder Traversal](https://www.interviewbit.com/problems/postorder-traversal/)|350|Solution|\n|Traversal|[Preorder Traversal](https://www.interviewbit.com/problems/preorder-traversal/)|350|[Solution.java](Tree%20Data%20Structure/Preorder%20Traversal/Solution.java)|\n|Tries|[Hotel Reviews](https://www.interviewbit.com/problems/hotel-reviews/)|200|Solution|\n|Simple tree ops|[Balanced Binary Tree](https://www.interviewbit.com/problems/balanced-binary-tree/)|275|[Solution.java](Tree%20Data%20Structure/Balanced%20Binary%20Tree/Solution.java)|\n|2 trees|[Identical Binary Trees](https://www.interviewbit.com/problems/identical-binary-trees/)|300|[Solution.java](Tree%20Data%20Structure/Identical%20Binary%20Trees/Solution.java)|\n|2 trees|[Symmetric Binary Tree](https://www.interviewbit.com/problems/symmetric-binary-tree/)|300|Solution|\n|Tree construction|[Inorder Traversal of Cartesian Tree](https://www.interviewbit.com/problems/inorder-traversal-of-cartesian-tree/)|300|Solution|\n|Tree construction|[Sorted Array To Balanced BST](https://www.interviewbit.com/problems/sorted-array-to-balanced-bst/)|300|[Solution.java](Tree%20Data%20Structure/Sorted%20Array%20To%20Balanced%20BST/Solution.java)|\n|Tree construction|[Binary Tree From Inorder And Postorder](https://www.interviewbit.com/problems/binary-tree-from-inorder-and-postorder/)|375|Solution|\n|Tree construction|[Construct Binary Tree From Inorder And Preorder](https://www.interviewbit.com/problems/construct-binary-tree-from-inorder-and-preorder/)|375|Solution|\n|Bst traversal|[Kth Smallest Element In Tree](https://www.interviewbit.com/problems/kth-smallest-element-in-tree/)|300|[Solution.java](Tree%20Data%20Structure/Kth%20Smallest%20Element%20In%20Tree/Solution.java)|\n|Bst traversal|[2-Sum Binary Tree](https://www.interviewbit.com/problems/2sum-binary-tree/)|400|Solution|\n|Bst traversal|[BST Iterator](https://www.interviewbit.com/problems/bst-iterator/)|500|Solution|\n|Bst traversal|[Recover Binary Search Tree](https://www.interviewbit.com/problems/recover-binary-search-tree/)|750|Solution|\n|Inplace change|[Invert the Binary Tree](https://www.interviewbit.com/problems/invert-the-binary-tree/)|300|[Solution.java](Tree%20Data%20Structure/Invert%20the%20Binary%20Tree/Solution.java)|\n|Level order|[ZigZag Level Order Traversal BT](https://www.interviewbit.com/problems/zigzag-level-order-traversal-bt/)|350|[Solution.java](Tree%20Data%20Structure/ZigZag%20Level%20Order%20Traversal%20BT/Solution.java)|\n|Level order|[Populate Next Right Pointers Tree](https://www.interviewbit.com/problems/populate-next-right-pointers-tree/)|900|Solution|\n|Root to leaf|[Path Sum](https://www.interviewbit.com/problems/path-sum/)|350|Solution|\n|Root to leaf|[Root to Leaf Paths With Sum](https://www.interviewbit.com/problems/root-to-leaf-paths-with-sum/)|350|Solution|\n|Root to leaf|[Max Depth of Binary Tree](https://www.interviewbit.com/problems/max-depth-of-binary-tree/)|350|[Solution.java](Tree%20Data%20Structure/Max%20Depth%20of%20Binary%20Tree/Solution.java)|\n|Root to leaf|[Min Depth of Binary Tree](https://www.interviewbit.com/problems/min-depth-of-binary-tree/)|350|Solution|\n|Root to leaf|[Sum Root to Leaf Numbers](https://www.interviewbit.com/problems/sum-root-to-leaf-numbers/)|350|Solution|\n|Trie|[Shortest Unique Prefix](https://www.interviewbit.com/problems/shortest-unique-prefix/)|350|Solution|\n|Tree search|[Least Common Ancestor](https://www.interviewbit.com/problems/least-common-ancestor/)|450|[Solution.java](Tree%20Data%20Structure/Least%20Common%20Ancestor/Solution.java)|\n|Linkedlist tree|[Flatten Binary Tree to Linked List](https://www.interviewbit.com/problems/flatten-binary-tree-to-linked-list/)|500|[Solution.java](Tree%20Data%20Structure/Flatten%20Binary%20Tree%20to%20Linked%20List/Solution.java)|\n|Interval tree|[Order of People Heights](https://www.interviewbit.com/problems/order-of-people-heights/)|700|Solution|\n\n## Dynamic Programming\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Simple array dp|[Length of Longest Subsequence](https://www.interviewbit.com/problems/length-of-longest-subsequence/)|200|[Solution.java](Dynamic%20Programming/Length%20of%20Longest%20Subsequence/Solution.java)|\n|Simple array dp|[Largest area of rectangle with permutations](https://www.interviewbit.com/problems/largest-area-of-rectangle-with-permutations/)|200|Solution|\n|Simple array dp|[Ways to Decode](https://www.interviewbit.com/problems/ways-to-decode/)|225|Solution|\n|Simple array dp|[Stairs](https://www.interviewbit.com/problems/stairs/)|225|[Solution.java](Dynamic%20Programming/Stairs/Solution.java)|\n|Simple array dp|[Intersecting Chords in a Circle](https://www.interviewbit.com/problems/intersecting-chords-in-a-circle/)|300|Solution|\n|Greedy or dp|[Tushar's Birthday Bombs](https://www.interviewbit.com/problems/tushars-birthday-bombs/)|200|Solution|\n|Greedy or dp|[Jump Game Array](https://www.interviewbit.com/problems/jump-game-array/)|225|[Solution.java](Dynamic%20Programming/Jump%20Game%20Array/Solution.java)|\n|Greedy or dp|[Min Jumps Array](https://www.interviewbit.com/problems/min-jumps-array/)|300|Solution|\n|Dp tricky|[Longest Arithmetic Progression](https://www.interviewbit.com/problems/longest-arithmetic-progression/)|200|Solution|\n|Dp tricky|[N digit numbers with digit sum S](https://www.interviewbit.com/problems/n-digit-numbers-with-digit-sum-s-/)|200|Solution|\n|Dp tricky|[Ways to color a 3xN Board](https://www.interviewbit.com/problems/ways-to-color-a-3xn-board/)|200|Solution|\n|Dp tricky|[Shortest common superstring](https://www.interviewbit.com/problems/shortest-common-superstring/)|200|Solution|\n|Dp tricky|[Kth Manhattan Distance Neighbourhood](https://www.interviewbit.com/problems/kth-manhattan-distance-neighbourhood/)|200|Solution|\n|Dp tricky|[Coins in a Line](https://www.interviewbit.com/problems/coins-in-a-line/)|300|Solution|\n|Dp tricky|[Evaluate Expression To True](https://www.interviewbit.com/problems/evaluate-expression-to-true/)|350|Solution|\n|Dp tricky|[Longest valid Parentheses](https://www.interviewbit.com/problems/longest-valid-parentheses/)|700|Solution|\n|Dp tricky|[Best Time to Buy and Sell Stocks III](https://www.interviewbit.com/problems/best-time-to-buy-and-sell-stocks-iii/)|700|Solution|\n|Matrix dp|[Kingdom War](https://www.interviewbit.com/problems/kingdom-war/)|200|Solution|\n|Matrix dp|[Min Sum Path in Matrix](https://www.interviewbit.com/problems/min-sum-path-in-matrix/)|300|[Solution.java](Dynamic%20Programming/Min%20um%20Path%20in%20Matrix/Solution.java)|\n|Matrix dp|[Dungeon Princess](https://www.interviewbit.com/problems/dungeon-princess/)|300|Solution|\n|Matrix dp|[Min Sum Path in Triangle](https://www.interviewbit.com/problems/min-sum-path-in-triangle/)|300|Solution|\n|Matrix dp|[Unique Paths in a Grid](https://www.interviewbit.com/problems/unique-paths-in-a-grid/)|300|[Solution.java](Dynamic%20Programming/Unique%20Paths%20in%20a%20Grid/Solution.java)|\n|Matrix dp|[Max Rectangle in Binary Matrix](https://www.interviewbit.com/problems/max-rectangle-in-binary-matrix/)|350|Solution|\n|Matrix dp|[Rod Cutting](https://www.interviewbit.com/problems/rod-cutting/)|350|Solution|\n|Matrix dp|[Queen Attack](https://www.interviewbit.com/problems/queen-attack/)|350|Solution|\n|Suffix / prefix dp|[Sub Matrices with sum Zero](https://www.interviewbit.com/problems/sub-matrices-with-sum-zero/)|200|Solution|\n|Suffix / prefix dp|[Coin Sum Infinite](https://www.interviewbit.com/problems/coin-sum-infinite/)|225|Solution|\n|Suffix / prefix dp|[Best Time to Buy and Sell Stocks I](https://www.interviewbit.com/problems/best-time-to-buy-and-sell-stocks-i/)|300|[Solution.java](Dynamic%20Programming/Best%20Time%20to%20Buy%20and%20Sell%20Stocks%20I/Solution.java)|\n|Suffix / prefix dp|[Max Product Subarray](https://www.interviewbit.com/problems/max-product-subarray/)|300|Solution|\n|Suffix / prefix dp|[Arrange II](https://www.interviewbit.com/problems/arrange-ii/)|350|Solution|\n|Adhoc|[Largest area of rectangle with permutations](https://www.interviewbit.com/problems/largest-area-of-rectangle-with-permutations/)|200|Solution|\n|Adhoc|[Best Time to Buy and Sell Stocks II](https://www.interviewbit.com/problems/best-time-to-buy-and-sell-stocks-ii/)|225|[Solution.java](Dynamic%20Programming/Best%20Time%20to%20Buy%20and%20Sell%20Stocks%20II/Solution.java)|\n|Knapsack|[N digit numbers with digit sum S](https://www.interviewbit.com/problems/n-digit-numbers-with-digit-sum-s-/)|200|Solution|\n|Knapsack|[Tushar's Birthday Party](https://www.interviewbit.com/problems/tushars-birthday-party/)|200|Solution|\n|Knapsack|[Flip Array](https://www.interviewbit.com/problems/flip-array/)|200|Solution|\n|Knapsack|[Equal Average Partition](https://www.interviewbit.com/problems/equal-average-partition/)|350|Solution|\n|Derived dp|[Max Sum Without Adjacent Elements](https://www.interviewbit.com/problems/max-sum-without-adjacent-elements/)|225|Solution|\n|2d string dp|[Edit Distance](https://www.interviewbit.com/problems/edit-distance/)|300|[Solution.java](Dynamic%20Programming/Edit%20Distance/Solution.java)|\n|2d string dp|[Longest Increasing Subsequence](https://www.interviewbit.com/problems/longest-increasing-subsequence/)|300|[Solution.java](Dynamic%20Programming/Longest%20Increasing%20Subsequence/Solution.java)|\n|2d string dp|[Repeating Sub-Sequence](https://www.interviewbit.com/problems/repeating-subsequence/)|300|[Solution.java](Dynamic%20Programming/Repeating%20Sub-Sequence/Solution.java)|\n|2d string dp|[Distinct Subsequences](https://www.interviewbit.com/problems/distinct-subsequences/)|325|Solution|\n|2d string dp|[Interleaving Strings](https://www.interviewbit.com/problems/interleaving-strings/)|500|Solution|\n|2d string dp|[Regular Expression Match](https://www.interviewbit.com/problems/regular-expression-match/)|500|Solution|\n|2d string dp|[Regular Expression II](https://www.interviewbit.com/problems/regular-expression-ii/)|500|Solution|\n|2d string dp|[Scramble String](https://www.interviewbit.com/problems/scramble-string/)|500|Solution|\n|Multiply dp|[Intersecting Chords in a Circle](https://www.interviewbit.com/problems/intersecting-chords-in-a-circle/)|300|Solution|\n|Multiply dp|[Unique Binary Search Trees II](https://www.interviewbit.com/problems/unique-binary-search-trees-ii/)|400|Solution|\n|Multiply dp|[Count Permutations of BST](https://www.interviewbit.com/problems/count-permutations-of-bst/)|400|Solution|\n|Preprocess dp|[Max Rectangle in Binary Matrix](https://www.interviewbit.com/problems/max-rectangle-in-binary-matrix/)|350|Solution|\n|Dp optimized backtrack|[Word Break II](https://www.interviewbit.com/problems/word-break-ii/)|350|Solution|\n|Tree dp|[Max Sum Path in Binary Tree](https://www.interviewbit.com/problems/max-sum-path-in-binary-tree/)|400|Solution|\n|Breaking words|[Word Break](https://www.interviewbit.com/problems/word-break/)|400|Solution|\n|Breaking words|[Palindrome Partitioning II](https://www.interviewbit.com/problems/palindrome-partitioning-ii/)|400|Solution|\n|Breaking words|[Scramble String](https://www.interviewbit.com/problems/scramble-string/)|500|Solution|\n\n## Greedy Algorithm\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Bucket 5|[Highest Product](https://www.interviewbit.com/problems/highest-product/)|200|[Solution.java](Greedy%20Algorithm/Highest%20Product/Solution.java)|\n|Bucket 6|[Bulbs](https://www.interviewbit.com/problems/bulbs/)|200|[Solution.java](Greedy%20Algorithm/Bulbs/Solution.java)|\n|Bucket 1|[Distribute Candy](https://www.interviewbit.com/problems/distribute-candy/)|300|Solution|\n|Bucket 1|[Assign Mice to Holes](https://www.interviewbit.com/problems/assign-mice-to-holes/)|300|[Solution.java](Greedy%20Algorithm/Assign%20Mice%20to%20Holes/Solution.java)|\n|Bucket 4|[Seats](https://www.interviewbit.com/problems/seats/)|300|Solution|\n|Bucket 3|[Majority Element](https://www.interviewbit.com/problems/majority-element/)|400|[Solution.java](Greedy%20Algorithm/Majority%20Element/Solution.java)|\n|Bucket 2|[Gas Station](https://www.interviewbit.com/problems/gas-station/)|700|Solution|\n\n## Graph Data Structure And Algorithms\n|Subdomain|Challenge|Score|Solution|\n|-|-|-|-|\n|Bfs|[Smallest sequence with given Primes](https://www.interviewbit.com/problems/smallest-sequence-with-given-primes/)|200|[Solution.java](Graph%20Data%20Structure%20And%20Algorithms/Smallest%20sequence%20with%20given%20Primes/Solution.java)|\n|Bfs|[Valid Path](https://www.interviewbit.com/problems/valid-path/)|200|Solution|\n|Bfs|[Level Order](https://www.interviewbit.com/problems/level-order/)|300|[Solution.java](Graph%20Data%20Structure%20And%20Algorithms/Level%20Order/Solution.java)|\n|Bfs|[Smallest Multiple With 0 and 1](https://www.interviewbit.com/problems/smallest-multiple-with-0-and-1/)|300|Solution|\n|Graph connectivity|[Commutable Islands](https://www.interviewbit.com/problems/commutable-islands/)|200|Solution|\n|Graph connectivity|[Possibility of finishing all courses given pre-requisites](https://www.interviewbit.com/problems/possibility-of-finishing-all-courses-given-prerequisites/)|200|Solution|\n|Graph connectivity|[Valid Path](https://www.interviewbit.com/problems/valid-path/)|200|Solution|\n|Graph connectivity|[Black Shapes](https://www.interviewbit.com/problems/black-shapes/)|300|[Solution.java](Graph%20Data%20Structure%20And%20Algorithms/Black%20Shapes/Solution.java)|\n|Graph connectivity|[Capture Regions on Board](https://www.interviewbit.com/problems/capture-regions-on-board/)|500|Solution|\n|Depth first search|[Largest Distance between nodes of a Tree](https://www.interviewbit.com/problems/largest-distance-between-nodes-of-a-tree/)|200|Solution|\n|Graph traversal|[Level Order](https://www.interviewbit.com/problems/level-order/)|300|[Solution.java](Graph%20Data%20Structure%20And%20Algorithms/Level%20Order2/Solution.java)|\n|Graph traversal|[Stepping Numbers](https://www.interviewbit.com/problems/stepping-numbers/)|300|Solution|\n|Graph traversal|[Capture Regions on Board](https://www.interviewbit.com/problems/capture-regions-on-board/)|500|Solution|\n|Graph traversal|[Word Search Board](https://www.interviewbit.com/problems/word-search-board/)|500|Solution|\n|Graph adhoc|[Convert Sorted List to Binary Search Tree](https://www.interviewbit.com/problems/convert-sorted-list-to-binary-search-tree/)|300|[Solution.java](Graph%20Data%20Structure%20And%20Algorithms/Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/Solution.java)|\n|Shortest path|[Sum Of Fibonacci Numbers](https://www.interviewbit.com/problems/sum-of-fibonacci-numbers/)|300|[Solution.java](Graph%20Data%20Structure%20And%20Algorithms/Sum%20Of%20Fibonacci%20Numbers/Solution.java)|\n|Shortest path|[Knight On Chess Board](https://www.interviewbit.com/problems/knight-on-chess-board/)|300|Solution|\n|Shortest path|[Word Ladder I](https://www.interviewbit.com/problems/word-ladder-i/)|600|Solution|\n|Shortest path|[Word Ladder II](https://www.interviewbit.com/problems/word-ladder-ii/)|800|Solution|\n|Graph hashing|[Clone Graph](https://www.interviewbit.com/problems/clone-graph/)|500|Solution|\n\nLicense\n=======\nLicensed under [MIT](LICENSE).","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falexprut%2Finterviewbit","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Falexprut%2Finterviewbit","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falexprut%2Finterviewbit/lists"}