https://github.com/alexprut/interviewbit
🍒 Solution to InterviewBit problems
https://github.com/alexprut/interviewbit
algorithms interviewbit
Last synced: 6 months ago
JSON representation
🍒 Solution to InterviewBit problems
- Host: GitHub
- URL: https://github.com/alexprut/interviewbit
- Owner: alexprut
- License: mit
- Created: 2019-07-06T14:04:17.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2023-04-24T11:59:44.000Z (over 2 years ago)
- Last Synced: 2025-04-30T22:39:03.977Z (9 months ago)
- Topics: algorithms, interviewbit
- Language: Java
- Size: 117 KB
- Stars: 4
- Watchers: 1
- Forks: 5
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
[](https://github.com/alexprut/InterviewBit#table-of-contents)
[](https://github.com/alexprut/InterviewBit#table-of-contents)
[](https://www.interviewbit.com/profile/alexprut)
[](https://github.com/alexprut/InterviewBit/blob/master/LICENSE)
### Disclaimer
Most of the problems are solved by using the Algo library.
Solutions to HackerRank problems.
Solutions to LeetCode problems.
The problem solutions and implementations are entirely provided by [Alex Prut](https://www.interviewbit.com/profile/alexprut).
The code is not refactored, no coding style is followed, the only purpose of the written code is to pass all the
platform tests of a given problem.
## Table of contents
1. [Time Complexity](#time-complexity)
1. [Arrays](#arrays)
1. [Math](#math)
1. [Binary Search](#binary-search)
1. [Strings](#strings)
1. [Bit Manipulation](#bit-manipulation)
1. [Two Pointers](#two-pointers)
1. [Linked Lists](#linked-lists)
1. [Stacks And Queues](#stacks-and-queues)
1. [Backtracking](#backtracking)
1. [Hashing](#hashing)
1. [Heaps And Maps](#heaps-and-maps)
1. [Tree Data Structure](#tree-data-structure)
1. [Dynamic Programming](#dynamic-programming)
1. [Greedy Algorithm](#greedy-algorithm)
1. [Graph Data Structure And Algorithms](#graph-data-structure-and-algorithms)
## Time Complexity
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|Basic primer|[LOOP_CMPL](https://www.interviewbit.com/problems/loopcmpl/)|20|[Solution.txt](Time%20Complexity/LOOP_CMPL/Solution.txt)|
|Basic primer|[NESTED_CMPL](https://www.interviewbit.com/problems/nestedcmpl/)|20|[Solution.txt](Time%20Complexity/NESTED_CMPL/Solution.txt)|
|Basic primer|[NESTED_CMPL2](https://www.interviewbit.com/problems/nestedcmpl2/)|30|[Solution.txt](Time%20Complexity/NESTED_CMPL2/Solution.txt)|
|Basic primer|[CHOOSE4](https://www.interviewbit.com/problems/choose4/)|50|[Solution.txt](Time%20Complexity/CHOOSE4/Solution.txt)|
|Math|[WHILE_CMPL](https://www.interviewbit.com/problems/whilecmpl/)|50|[Solution.txt](Time%20Complexity/WHILE_CMPL/Solution.txt)|
|Math|[NESTED_CMPL3](https://www.interviewbit.com/problems/nestedcmpl3/)|80|[Solution.txt](Time%20Complexity/[NESTED_CMPL3/Solution.txt)|
|Math|[LOOP_CMPL2](https://www.interviewbit.com/problems/loopcmpl2/)|80|[Solution.txt](Time%20Complexity/LOOP_CMPL2/Solution.txt)|
|Math|[GCD_CMPL](https://www.interviewbit.com/problems/gcdcmpl/)|150|[Solution.txt](Time%20Complexity/GCD_CMPL/Solution.txt)|
|Compare functions|[CHOOSE1](https://www.interviewbit.com/problems/choose1/)|50|[Solution.txt](Time%20Complexity/CHOOSE1/Solution.txt)|
|Compare functions|[CHOOSE3](https://www.interviewbit.com/problems/choose3/)|50|[Solution.txt](Time%20Complexity/CHOOSE3/Solution.txt)|
|Compare functions|[CHOOSE2](https://www.interviewbit.com/problems/choose2/)|80|[Solution.txt](Time%20Complexity/CHOOSE2/Solution.txt)|
|Function calling itself|[REC_CMPL1](https://www.interviewbit.com/problems/reccmpl1/)|80|[Solution.txt](Time%20Complexity/REC_CMPL1/Solution.txt)|
|Function calling itself|[REC_CMPL2](https://www.interviewbit.com/problems/reccmpl2/)|80|[Solution.txt](Time%20Complexity/REC_CMPL2/Solution.txt)|
|Function calling itself|[REC_CMPL3](https://www.interviewbit.com/problems/reccmpl3/)|150|[Solution.txt](Time%20Complexity/REC_CMPL3/Solution.txt)|
|Amortized complexity|[AMORTIZED1](https://www.interviewbit.com/problems/amortized1/)|100|[Solution.txt](Time%20Complexity/AMORTIZED1/Solution.txt)|
## Arrays
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|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)|
|Array math|[Add One To Number](https://www.interviewbit.com/problems/add-one-to-number/)|225|Solution|
|Array math|[Max Sum Contiguous Subarray](https://www.interviewbit.com/problems/max-sum-contiguous-subarray/)|225|Solution|
|Array math|[Maximum Absolute Difference](https://www.interviewbit.com/problems/maximum-absolute-difference/)|250|Solution|
|Array math|[Repeat and Missing Number Array](https://www.interviewbit.com/problems/repeat-and-missing-number-array/)|350|Solution|
|Array math|[Flip](https://www.interviewbit.com/problems/flip/)|400|Solution|
|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)|
|Simulation array|[Spiral Order Matrix II](https://www.interviewbit.com/problems/spiral-order-matrix-ii/)|225|Solution|
|Simulation array|[Pascal Triangle](https://www.interviewbit.com/problems/pascal-triangle/)|225|[Solution.java](Arrays/Pascal%20Triangle/Solution.java)|
|Simulation array|[Kth Row of Pascal's Triangle](https://www.interviewbit.com/problems/kth-row-of-pascals-triangle/)|225|Solution|
|Simulation array|[Anti Diagonals](https://www.interviewbit.com/problems/anti-diagonals/)|225|Solution|
|Bucketing|[Noble Integer](https://www.interviewbit.com/problems/noble-integer/)|200|[Solution.java](Arrays/Noble%20Integer/Solution.java)|
|Bucketing|[Triplets with Sum between given range](https://www.interviewbit.com/problems/triplets-with-sum-between-given-range/)|200|Solution|
|Bucketing|[Largest Number](https://www.interviewbit.com/problems/largest-number/)|225|[Solution.java](Arrays/Largest%20Number/Solution.java)|
|Bucketing|[Wave Array](https://www.interviewbit.com/problems/wave-array/)|225|[Solution.java](Arrays/Wave%20Array/Solution.java)|
|Bucketing|[Hotel Bookings Possible](https://www.interviewbit.com/problems/hotel-bookings-possible/)|225|Solution|
|Bucketing|[Max Distance](https://www.interviewbit.com/problems/max-distance/)|250|Solution|
|Bucketing|[Maximum Unsorted Subarray](https://www.interviewbit.com/problems/maximum-unsorted-subarray/)|250|Solution|
|Bucketing|[Find Duplicate in Array](https://www.interviewbit.com/problems/find-duplicate-in-array/)|450|[Solution.java](Arrays/Find%20Duplicate%20in%20Array/Solution.java)|
|Bucketing|[Maximum Consecutive Gap](https://www.interviewbit.com/problems/maximum-consecutive-gap/)|450|Solution|
|Array|[MAXSPPROD](https://www.interviewbit.com/problems/maxspprod/)|200|[Solution.java](Array/MAXSPPROD/Solution.java)|
|Arrangement|[Largest Number](https://www.interviewbit.com/problems/largest-number/)|225|[Solution.java](Arrays/Largest%20Number2/Solution.java)|
|Arrangement|[Rotate Matrix](https://www.interviewbit.com/problems/rotate-matrix/)|300|Solution|
|Arrangement|[Next Permutation](https://www.interviewbit.com/problems/next-permutation/)|300|Solution|
|Arrangement|[Find Permutation](https://www.interviewbit.com/problems/find-permutation/)|300|Solution|
|Value ranges|[Merge Intervals](https://www.interviewbit.com/problems/merge-intervals/)|225|Solution|
|Value ranges|[Merge Overlapping Intervals](https://www.interviewbit.com/problems/merge-overlapping-intervals/)|225|[Solution.java](Arrays/Merge%20Overlapping%20Intervals/Solution.java)|
|Bucketing or sorting|[Hotel Bookings Possible](https://www.interviewbit.com/problems/hotel-bookings-possible/)|225|Solution|
|Bucketing or sorting|[Wave Array](https://www.interviewbit.com/problems/wave-array/)|225|[Solution.java](Arrays/Wave%20Array/Solution.java)|
|Bucketing or sorting|[Largest Number](https://www.interviewbit.com/problems/largest-number/)|225|[Solution.java](Arrays/Largest%20Number3/Solution.java)|
|Bucketing or sorting|[Max Distance](https://www.interviewbit.com/problems/max-distance/)|250|Solution|
|Bucketing or sorting|[Maximum Unsorted Subarray](https://www.interviewbit.com/problems/maximum-unsorted-subarray/)|250|Solution|
|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)|
|Bucketing or sorting|[Maximum Consecutive Gap](https://www.interviewbit.com/problems/maximum-consecutive-gap/)|450|Solution|
|Space recycle|[Set Matrix Zeros](https://www.interviewbit.com/problems/set-matrix-zeros/)|300|[Solution.java](Arrays/Set%20Matrix%20Zeros/Solution.java)|
|Space recycle|[First Missing Integer](https://www.interviewbit.com/problems/first-missing-integer/)|300|Solution|
|Missing / repeated number|[First Missing Integer](https://www.interviewbit.com/problems/first-missing-integer/)|300|Solution|
|Missing / repeated number|[Repeat and Missing Number Array](https://www.interviewbit.com/problems/repeat-and-missing-number-array/)|350|Solution|
|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)|
|Missing / repeated number|[N/3 Repeat Number](https://www.interviewbit.com/problems/n3-repeat-number/)|600|Solution|
## Math
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|Adhoc|[Prime Sum](https://www.interviewbit.com/problems/prime-sum/)|150|[Solution.java](Math/Prime%20Sum/Solution.java)|
|Adhoc|[Sum of pairwise Hamming Distance](https://www.interviewbit.com/problems/sum-of-pairwise-hamming-distance/)|200|Solution|
|Adhoc|[FizzBuzz](https://www.interviewbit.com/problems/fizzbuzz/)|200|[Solution.java](Math/FizzBuzz/Solution.java)|
|Adhoc|[Power Of Two Integers](https://www.interviewbit.com/problems/power-of-two-integers/)|250|Solution|
|Base conversion|[Excel Column Number](https://www.interviewbit.com/problems/excel-column-number/)|175|[Solution.java](Math/Excel%20Column%20Number/Solution.java)|
|Base conversion|[Excel Column Title](https://www.interviewbit.com/problems/excel-column-title/)|175|Solution|
|Digit op|[Palindrome Integer](https://www.interviewbit.com/problems/palindrome-integer/)|200|[Solution.java](Math/Palindrome%20Integer/Solution.java)|
|Digit op|[Reverse integer](https://www.interviewbit.com/problems/reverse-integer/)|200|Solution|
|Number theory|[Greatest Common Divisor](https://www.interviewbit.com/problems/greatest-common-divisor/)|200|[Solution.java](Math/Greatest%20Common%20Divisor/Solution.java)|
|Number theory|[Trailing Zeros in Factorial](https://www.interviewbit.com/problems/trailing-zeros-in-factorial/)|250|Solution|
|Number theory|[Sorted Permutation Rank](https://www.interviewbit.com/problems/sorted-permutation-rank/)|250|Solution|
|Number theory|[Largest Coprime Divisor](https://www.interviewbit.com/problems/largest-coprime-divisor/)|250|Solution|
|Number theory|[Sorted Permutation Rank with Repeats](https://www.interviewbit.com/problems/sorted-permutation-rank-with-repeats/)|500|Solution|
|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|
|Number encoding|[Rearrange Array](https://www.interviewbit.com/problems/rearrange-array/)|250|[Solution.java](Math/Rearrange%20Array/Solution.java)|
|Combinatorics|[City Tour](https://www.interviewbit.com/problems/city-tour/)|300|Solution|
|Combinatorics|[Grid Unique Paths](https://www.interviewbit.com/problems/grid-unique-paths/)|375|[Solution.java](Math/Grid%20Unique%20Paths/Solution.java)|
## Binary Search
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|Search answer|[Matrix Median](https://www.interviewbit.com/problems/matrix-median/)|225|Solution|
|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)|
|Search answer|[Painter's Partition Problem](https://www.interviewbit.com/problems/painters-partition-problem/)|350|Solution|
|Search answer|[Allocate Books](https://www.interviewbit.com/problems/allocate-books/)|350|Solution|
|Simple binary search|[Matrix Search](https://www.interviewbit.com/problems/matrix-search/)|250|[Solution.java](Binary%20Search/Matrix%20Search/Solution.java)|
|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)|
|Simple binary search|[Sorted Insert Position](https://www.interviewbit.com/problems/sorted-insert-position/)|250|[Solution.java](Binary%20Search/Sorted%20Insert%20Position/Solution.java)|
|Search step simulation|[Implement Power Function](https://www.interviewbit.com/problems/implement-power-function/)|275|Solution|
|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)|
|Sort modification|[Median of Array](https://www.interviewbit.com/problems/median-of-array/)|325|Solution|
## Strings
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|String simulation|[Palindrome String](https://www.interviewbit.com/problems/palindrome-string/)|150|[Solution.java](Strings/Palindrome%20String/Solution.java)|
|String simulation|[Longest Common Prefix](https://www.interviewbit.com/problems/longest-common-prefix/)|225|Solution|
|String simulation|[Count And Say](https://www.interviewbit.com/problems/count-and-say/)|250|Solution|
|Programming|[Amazing Subarrays](https://www.interviewbit.com/problems/amazing-subarrays/)|150|[Solution.java](Strings/Amazing%20Subarrays/Solution.java)|
|Programming|[Stringoholics](https://www.interviewbit.com/problems/stringoholics/)|300|Solution|
|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|
|String tricks|[Longest Palindromic Substring](https://www.interviewbit.com/problems/longest-palindromic-substring/)|500|Solution|
|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|
|String search|[Implement StrStr](https://www.interviewbit.com/problems/implement-strstr/)|225|[Solution.java](Strings/Implement%20StrStr/Solution.java)|
|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|
|String parsing|[Compare Version Numbers](https://www.interviewbit.com/problems/compare-version-numbers/)|225|Solution|
|String parsing|[Atoi](https://www.interviewbit.com/problems/atoi/)|250|Solution|
|String parsing|[Valid Number](https://www.interviewbit.com/problems/valid-number/)|250|Solution|
|String parsing|[Valid Ip Addresses](https://www.interviewbit.com/problems/valid-ip-addresses/)|250|Solution|
|Words|[Length of Last Word](https://www.interviewbit.com/problems/length-of-last-word/)|225|[Solution.java](Strings/Length%20of%20Last%20Word/Solution.java)|
|Words|[Reverse the String](https://www.interviewbit.com/problems/reverse-the-string/)|250|Solution|
|String math|[Roman To Integer](https://www.interviewbit.com/problems/roman-to-integer/)|250|[Solution.java](Strings/Roman%20To%20Integer/Solution.java)|
|String math|[Integer To Roman](https://www.interviewbit.com/problems/integer-to-roman/)|250|Solution|
|String math|[Add Binary Strings](https://www.interviewbit.com/problems/add-binary-strings/)|300|Solution|
|String math|[Power of 2](https://www.interviewbit.com/problems/power-of-2/)|350|Solution|
|String math|[Multiply Strings](https://www.interviewbit.com/problems/multiply-strings/)|375|Solution|
|Pretty print|[Justified Text](https://www.interviewbit.com/problems/justified-text/)|300|Solution|
|Pretty print|[Zigzag String](https://www.interviewbit.com/problems/zigzag-string/)|300|[Solution.java](Strings/Zigzag%20String/Solution.java)|
|Pretty print|[Pretty Json](https://www.interviewbit.com/problems/pretty-json/)|400|Solution|
## Bit Manipulation
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|Bucketing|[Min XOR value](https://www.interviewbit.com/problems/min-xor-value/)|200|[Solution.java](Bit%20Manipulation/Min%20XOR%20value/Solution.java)|
|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)|
|Bit play|[Reverse Bits](https://www.interviewbit.com/problems/reverse-bits/)|225|[Solution.java](Bit%20Manipulation/Reverse%20Bits/Solution.java)|
|Bit play|[Divide Integers](https://www.interviewbit.com/problems/divide-integers/)|250|Solution|
|Bit play|[Different Bits Sum Pairwise](https://www.interviewbit.com/problems/different-bits-sum-pairwise/)|300|Solution|
|Bit array|[Single Number](https://www.interviewbit.com/problems/single-number/)|275|[Solution.java](Bit%20Manipulation/Single%20Number/Solution.java)|
|Bit array|[Single Number II](https://www.interviewbit.com/problems/single-number-ii/)|275|Solution|
## Two Pointers
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|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)|
|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)|
|Two pointer|[Minimize the absolute difference](https://www.interviewbit.com/problems/minimize-the-absolute-difference/)|200|Solution|
|Sorting|[3 Sum](https://www.interviewbit.com/problems/3-sum/)|225|Solution|
|Sorting|[3 Sum Zero](https://www.interviewbit.com/problems/3-sum-zero/)|225|Solution|
|Sorting|[Counting Triangles](https://www.interviewbit.com/problems/counting-triangles/)|225|Solution|
|Sorting|[Diffk](https://www.interviewbit.com/problems/diffk/)|300|[Solution.java](Two%20Pointers/Diffk/Solution.java)|
|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)|
|Inplace update|[Remove Duplicates from Sorted Array II](https://www.interviewbit.com/problems/remove-duplicates-from-sorted-array-ii/)|250|Solution|
|Inplace update|[Remove Element from Array](https://www.interviewbit.com/problems/remove-element-from-array/)|250|Solution|
|Inplace update|[Sort by Color](https://www.interviewbit.com/problems/sort-by-color/)|325|[Solution.java](Two%20Pointers/Sort%20by%20Color/Solution.java)|
|Tricks|[Max Continuous Series of 1s](https://www.interviewbit.com/problems/max-continuous-series-of-1s/)|300|Solution|
|Tricks|[Array 3 Pointers](https://www.interviewbit.com/problems/array-3-pointers/)|400|Solution|
|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)|
## Linked Lists
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|List 2 pointer|[Palindrome List](https://www.interviewbit.com/problems/palindrome-list/)|200|Solution|
|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)|
|List 2 pointer|[Remove Duplicates from Sorted List II](https://www.interviewbit.com/problems/remove-duplicates-from-sorted-list-ii/)|300|Solution|
|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)|
|List 2 pointer|[Remove Nth Node from List End](https://www.interviewbit.com/problems/remove-nth-node-from-list-end/)|350|Solution|
|List 2 pointer|[Rotate List](https://www.interviewbit.com/problems/rotate-list/)|350|[Solution.java](Linked%20Lists/Rotate%20List/Solution.java)|
|List 2 pointer|[Reverse Link List II](https://www.interviewbit.com/problems/reverse-link-list-ii/)|450|Solution|
|List 2 pointer|[Reorder List](https://www.interviewbit.com/problems/reorder-list/)|600|Solution|
|Pointer move|[K reverse linked list](https://www.interviewbit.com/problems/k-reverse-linked-list/)|200|Solution|
|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)|
|Pointer move|[Reverse Link List II](https://www.interviewbit.com/problems/reverse-link-list-ii/)|450|Solution|
|Pointer move|[Reorder List](https://www.interviewbit.com/problems/reorder-list/)|600|Solution|
|List math|[Add Two Numbers as Lists](https://www.interviewbit.com/problems/add-two-numbers-as-lists/)|250|Solution|
|List math|[List Cycle](https://www.interviewbit.com/problems/list-cycle/)|600|[Solution.java](Linked%20Lists/List%20Cycle/Solution.java)|
|List sort|[Partition List](https://www.interviewbit.com/problems/partition-list/)|275|Solution|
|List sort|[Insertion Sort List](https://www.interviewbit.com/problems/insertion-sort-list/)|300|[Solution.java](Linked%20Lists/Insertion%20Sort%20List/Solution.java)|
|List sort|[Sort List](https://www.interviewbit.com/problems/sort-list/)|350|Solution|
|List trick|[Reverse Link List II](https://www.interviewbit.com/problems/reverse-link-list-ii/)|450|Solution|
|List trick|[Reorder List](https://www.interviewbit.com/problems/reorder-list/)|600|Solution|
|List cycle|[List Cycle](https://www.interviewbit.com/problems/list-cycle/)|600|[Solution.java](Linked%20Lists/List%20Cycle/Solution.java)|
## Stacks And Queues
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|Stack simple|[Simplify Directory Path](https://www.interviewbit.com/problems/simplify-directory-path/)|250|Solution|
|Stack simple|[Redundant Braces](https://www.interviewbit.com/problems/redundant-braces/)|300|[Solution.java](Stacks%20And%20Queues/Redundant%20Braces/Solution.java)|
|Cleverstack|[Nearest Smaller Element](https://www.interviewbit.com/problems/nearest-smaller-element/)|350|[Solution.java](Stacks%20And%20Queues/Nearest%20Smaller%20Element/Solution.java)|
|Cleverstack|[Largest Rectangle in Histogram](https://www.interviewbit.com/problems/largest-rectangle-in-histogram/)|450|Solution|
|Cleverstack|[Sliding Window Maximum](https://www.interviewbit.com/problems/sliding-window-maximum/)|450|Solution|
|Stack math|[Evaluate Expression](https://www.interviewbit.com/problems/evaluate-expression/)|400|[Solution.java](Stacks%20And%20Queues/Evaluate%20Expression/Solution.java)|
|Stack math|[Rain Water Trapped](https://www.interviewbit.com/problems/rain-water-trapped/)|400|Solution|
|Multiple stack|[Min Stack](https://www.interviewbit.com/problems/min-stack/)|400|Solution|
## Backtracking
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|Subsets|[Subset](https://www.interviewbit.com/problems/subset/)|250|[Solution.java](Backtracking/Subset/Solution.java)|
|Subsets|[Combinations](https://www.interviewbit.com/problems/combinations/)|300|Solution|
|Subsets|[Combination Sum](https://www.interviewbit.com/problems/combination-sum/)|300|Solution|
|Subsets|[Combination Sum II](https://www.interviewbit.com/problems/combination-sum-ii/)|300|Solution|
|Subsets|[Subsets II](https://www.interviewbit.com/problems/subsets-ii/)|300|Solution|
|Bruteforce builder|[Letter Phone](https://www.interviewbit.com/problems/letter-phone/)|250|Solution|
|Bruteforce builder|[Palindrome Partitioning](https://www.interviewbit.com/problems/palindrome-partitioning/)|300|Solution|
|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)|
|Pruned builder|[Palindrome Partitioning](https://www.interviewbit.com/problems/palindrome-partitioning/)|300|Solution|
|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)|
|Pruned builder|[NQueens](https://www.interviewbit.com/problems/nqueens/)|550|Solution|
|Pruned builder|[Sudoku](https://www.interviewbit.com/problems/sudoku/)|700|Solution|
|Permutations|[Permutations](https://www.interviewbit.com/problems/permutations/)|350|[Solution.java](Backtracking/Permutations/Solution.java)|
|Maths and backtracking|[Gray Code](https://www.interviewbit.com/problems/gray-code/)|350|Solution|
|Maths and backtracking|[Kth Permutation Sequence](https://www.interviewbit.com/problems/kth-permutation-sequence/)|350|Solution|
|Game solving|[NQueens](https://www.interviewbit.com/problems/nqueens/)|550|Solution|
|Game solving|[Sudoku](https://www.interviewbit.com/problems/sudoku/)|700|Solution|
## Hashing
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|Hash search|[Colorful Number](https://www.interviewbit.com/problems/colorful-number/)|150|Solution|
|Hash search|[Largest Continuous Sequence Zero Sum](https://www.interviewbit.com/problems/largest-continuous-sequence-zero-sum/)|200|Solution|
|Hash search|[2 Sum](https://www.interviewbit.com/problems/2-sum/)|300|Solution|
|Hash search|[4 Sum](https://www.interviewbit.com/problems/4-sum/)|325|Solution|
|Hash search|[Valid Sudoku](https://www.interviewbit.com/problems/valid-sudoku/)|325|Solution|
|Hash search|[Diffk II](https://www.interviewbit.com/problems/diffk-ii/)|375|[Solution.java](Hashing/Diffk%20II/Solution.java)|
|Key formation|[Anagrams](https://www.interviewbit.com/problems/anagrams/)|350|[Solution.java](Hashing/Anagrams/Solution.java)|
|Key formation|[Equal](https://www.interviewbit.com/problems/equal/)|350|Solution|
|Key formation|[Copy List](https://www.interviewbit.com/problems/copy-list/)|450|Solution|
|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)|
|Hashing two pointer|[Window String](https://www.interviewbit.com/problems/window-string/)|350|Solution|
|Maths and hashing|[Fraction](https://www.interviewbit.com/problems/fraction/)|450|Solution|
|Maths and hashing|[Points on the Straight Line](https://www.interviewbit.com/problems/points-on-the-straight-line/)|450|Solution|
|Incremental hash|[Substring Concatenation](https://www.interviewbit.com/problems/substring-concatenation/)|1000|Solution|
## Heaps And Maps
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|Heap|[N max pair combinations](https://www.interviewbit.com/problems/n-max-pair-combinations/)|200|Solution|
|Heap|[Magician and Chocolates](https://www.interviewbit.com/problems/magician-and-chocolates/)|250|[Solution.java](Heaps%20And%20Maps/Magician%20and%20Chocolates/Solution.java)|
|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)|
|Math|[Ways to form Max Heap](https://www.interviewbit.com/problems/ways-to-form-max-heap/)|200|Solution|
|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)|
|Heapmap|[LRU Cache](https://www.interviewbit.com/problems/lru-cache/)|1000|Solution|
## Tree Data Structure
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|Traversal|[Vertical Order traversal of Binary Tree](https://www.interviewbit.com/problems/vertical-order-traversal-of-binary-tree/)|200|Solution|
|Traversal|[Inorder Traversal](https://www.interviewbit.com/problems/inorder-traversal/)|350|Solution|
|Traversal|[Postorder Traversal](https://www.interviewbit.com/problems/postorder-traversal/)|350|Solution|
|Traversal|[Preorder Traversal](https://www.interviewbit.com/problems/preorder-traversal/)|350|[Solution.java](Tree%20Data%20Structure/Preorder%20Traversal/Solution.java)|
|Tries|[Hotel Reviews](https://www.interviewbit.com/problems/hotel-reviews/)|200|Solution|
|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)|
|2 trees|[Identical Binary Trees](https://www.interviewbit.com/problems/identical-binary-trees/)|300|[Solution.java](Tree%20Data%20Structure/Identical%20Binary%20Trees/Solution.java)|
|2 trees|[Symmetric Binary Tree](https://www.interviewbit.com/problems/symmetric-binary-tree/)|300|Solution|
|Tree construction|[Inorder Traversal of Cartesian Tree](https://www.interviewbit.com/problems/inorder-traversal-of-cartesian-tree/)|300|Solution|
|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)|
|Tree construction|[Binary Tree From Inorder And Postorder](https://www.interviewbit.com/problems/binary-tree-from-inorder-and-postorder/)|375|Solution|
|Tree construction|[Construct Binary Tree From Inorder And Preorder](https://www.interviewbit.com/problems/construct-binary-tree-from-inorder-and-preorder/)|375|Solution|
|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)|
|Bst traversal|[2-Sum Binary Tree](https://www.interviewbit.com/problems/2sum-binary-tree/)|400|Solution|
|Bst traversal|[BST Iterator](https://www.interviewbit.com/problems/bst-iterator/)|500|Solution|
|Bst traversal|[Recover Binary Search Tree](https://www.interviewbit.com/problems/recover-binary-search-tree/)|750|Solution|
|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)|
|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)|
|Level order|[Populate Next Right Pointers Tree](https://www.interviewbit.com/problems/populate-next-right-pointers-tree/)|900|Solution|
|Root to leaf|[Path Sum](https://www.interviewbit.com/problems/path-sum/)|350|Solution|
|Root to leaf|[Root to Leaf Paths With Sum](https://www.interviewbit.com/problems/root-to-leaf-paths-with-sum/)|350|Solution|
|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)|
|Root to leaf|[Min Depth of Binary Tree](https://www.interviewbit.com/problems/min-depth-of-binary-tree/)|350|Solution|
|Root to leaf|[Sum Root to Leaf Numbers](https://www.interviewbit.com/problems/sum-root-to-leaf-numbers/)|350|Solution|
|Trie|[Shortest Unique Prefix](https://www.interviewbit.com/problems/shortest-unique-prefix/)|350|Solution|
|Tree search|[Least Common Ancestor](https://www.interviewbit.com/problems/least-common-ancestor/)|450|[Solution.java](Tree%20Data%20Structure/Least%20Common%20Ancestor/Solution.java)|
|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)|
|Interval tree|[Order of People Heights](https://www.interviewbit.com/problems/order-of-people-heights/)|700|Solution|
## Dynamic Programming
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|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)|
|Simple array dp|[Largest area of rectangle with permutations](https://www.interviewbit.com/problems/largest-area-of-rectangle-with-permutations/)|200|Solution|
|Simple array dp|[Ways to Decode](https://www.interviewbit.com/problems/ways-to-decode/)|225|Solution|
|Simple array dp|[Stairs](https://www.interviewbit.com/problems/stairs/)|225|[Solution.java](Dynamic%20Programming/Stairs/Solution.java)|
|Simple array dp|[Intersecting Chords in a Circle](https://www.interviewbit.com/problems/intersecting-chords-in-a-circle/)|300|Solution|
|Greedy or dp|[Tushar's Birthday Bombs](https://www.interviewbit.com/problems/tushars-birthday-bombs/)|200|Solution|
|Greedy or dp|[Jump Game Array](https://www.interviewbit.com/problems/jump-game-array/)|225|[Solution.java](Dynamic%20Programming/Jump%20Game%20Array/Solution.java)|
|Greedy or dp|[Min Jumps Array](https://www.interviewbit.com/problems/min-jumps-array/)|300|Solution|
|Dp tricky|[Longest Arithmetic Progression](https://www.interviewbit.com/problems/longest-arithmetic-progression/)|200|Solution|
|Dp tricky|[N digit numbers with digit sum S](https://www.interviewbit.com/problems/n-digit-numbers-with-digit-sum-s-/)|200|Solution|
|Dp tricky|[Ways to color a 3xN Board](https://www.interviewbit.com/problems/ways-to-color-a-3xn-board/)|200|Solution|
|Dp tricky|[Shortest common superstring](https://www.interviewbit.com/problems/shortest-common-superstring/)|200|Solution|
|Dp tricky|[Kth Manhattan Distance Neighbourhood](https://www.interviewbit.com/problems/kth-manhattan-distance-neighbourhood/)|200|Solution|
|Dp tricky|[Coins in a Line](https://www.interviewbit.com/problems/coins-in-a-line/)|300|Solution|
|Dp tricky|[Evaluate Expression To True](https://www.interviewbit.com/problems/evaluate-expression-to-true/)|350|Solution|
|Dp tricky|[Longest valid Parentheses](https://www.interviewbit.com/problems/longest-valid-parentheses/)|700|Solution|
|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|
|Matrix dp|[Kingdom War](https://www.interviewbit.com/problems/kingdom-war/)|200|Solution|
|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)|
|Matrix dp|[Dungeon Princess](https://www.interviewbit.com/problems/dungeon-princess/)|300|Solution|
|Matrix dp|[Min Sum Path in Triangle](https://www.interviewbit.com/problems/min-sum-path-in-triangle/)|300|Solution|
|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)|
|Matrix dp|[Max Rectangle in Binary Matrix](https://www.interviewbit.com/problems/max-rectangle-in-binary-matrix/)|350|Solution|
|Matrix dp|[Rod Cutting](https://www.interviewbit.com/problems/rod-cutting/)|350|Solution|
|Matrix dp|[Queen Attack](https://www.interviewbit.com/problems/queen-attack/)|350|Solution|
|Suffix / prefix dp|[Sub Matrices with sum Zero](https://www.interviewbit.com/problems/sub-matrices-with-sum-zero/)|200|Solution|
|Suffix / prefix dp|[Coin Sum Infinite](https://www.interviewbit.com/problems/coin-sum-infinite/)|225|Solution|
|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)|
|Suffix / prefix dp|[Max Product Subarray](https://www.interviewbit.com/problems/max-product-subarray/)|300|Solution|
|Suffix / prefix dp|[Arrange II](https://www.interviewbit.com/problems/arrange-ii/)|350|Solution|
|Adhoc|[Largest area of rectangle with permutations](https://www.interviewbit.com/problems/largest-area-of-rectangle-with-permutations/)|200|Solution|
|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)|
|Knapsack|[N digit numbers with digit sum S](https://www.interviewbit.com/problems/n-digit-numbers-with-digit-sum-s-/)|200|Solution|
|Knapsack|[Tushar's Birthday Party](https://www.interviewbit.com/problems/tushars-birthday-party/)|200|Solution|
|Knapsack|[Flip Array](https://www.interviewbit.com/problems/flip-array/)|200|Solution|
|Knapsack|[Equal Average Partition](https://www.interviewbit.com/problems/equal-average-partition/)|350|Solution|
|Derived dp|[Max Sum Without Adjacent Elements](https://www.interviewbit.com/problems/max-sum-without-adjacent-elements/)|225|Solution|
|2d string dp|[Edit Distance](https://www.interviewbit.com/problems/edit-distance/)|300|[Solution.java](Dynamic%20Programming/Edit%20Distance/Solution.java)|
|2d string dp|[Longest Increasing Subsequence](https://www.interviewbit.com/problems/longest-increasing-subsequence/)|300|[Solution.java](Dynamic%20Programming/Longest%20Increasing%20Subsequence/Solution.java)|
|2d string dp|[Repeating Sub-Sequence](https://www.interviewbit.com/problems/repeating-subsequence/)|300|[Solution.java](Dynamic%20Programming/Repeating%20Sub-Sequence/Solution.java)|
|2d string dp|[Distinct Subsequences](https://www.interviewbit.com/problems/distinct-subsequences/)|325|Solution|
|2d string dp|[Interleaving Strings](https://www.interviewbit.com/problems/interleaving-strings/)|500|Solution|
|2d string dp|[Regular Expression Match](https://www.interviewbit.com/problems/regular-expression-match/)|500|Solution|
|2d string dp|[Regular Expression II](https://www.interviewbit.com/problems/regular-expression-ii/)|500|Solution|
|2d string dp|[Scramble String](https://www.interviewbit.com/problems/scramble-string/)|500|Solution|
|Multiply dp|[Intersecting Chords in a Circle](https://www.interviewbit.com/problems/intersecting-chords-in-a-circle/)|300|Solution|
|Multiply dp|[Unique Binary Search Trees II](https://www.interviewbit.com/problems/unique-binary-search-trees-ii/)|400|Solution|
|Multiply dp|[Count Permutations of BST](https://www.interviewbit.com/problems/count-permutations-of-bst/)|400|Solution|
|Preprocess dp|[Max Rectangle in Binary Matrix](https://www.interviewbit.com/problems/max-rectangle-in-binary-matrix/)|350|Solution|
|Dp optimized backtrack|[Word Break II](https://www.interviewbit.com/problems/word-break-ii/)|350|Solution|
|Tree dp|[Max Sum Path in Binary Tree](https://www.interviewbit.com/problems/max-sum-path-in-binary-tree/)|400|Solution|
|Breaking words|[Word Break](https://www.interviewbit.com/problems/word-break/)|400|Solution|
|Breaking words|[Palindrome Partitioning II](https://www.interviewbit.com/problems/palindrome-partitioning-ii/)|400|Solution|
|Breaking words|[Scramble String](https://www.interviewbit.com/problems/scramble-string/)|500|Solution|
## Greedy Algorithm
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|Bucket 5|[Highest Product](https://www.interviewbit.com/problems/highest-product/)|200|[Solution.java](Greedy%20Algorithm/Highest%20Product/Solution.java)|
|Bucket 6|[Bulbs](https://www.interviewbit.com/problems/bulbs/)|200|[Solution.java](Greedy%20Algorithm/Bulbs/Solution.java)|
|Bucket 1|[Distribute Candy](https://www.interviewbit.com/problems/distribute-candy/)|300|Solution|
|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)|
|Bucket 4|[Seats](https://www.interviewbit.com/problems/seats/)|300|Solution|
|Bucket 3|[Majority Element](https://www.interviewbit.com/problems/majority-element/)|400|[Solution.java](Greedy%20Algorithm/Majority%20Element/Solution.java)|
|Bucket 2|[Gas Station](https://www.interviewbit.com/problems/gas-station/)|700|Solution|
## Graph Data Structure And Algorithms
|Subdomain|Challenge|Score|Solution|
|-|-|-|-|
|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)|
|Bfs|[Valid Path](https://www.interviewbit.com/problems/valid-path/)|200|Solution|
|Bfs|[Level Order](https://www.interviewbit.com/problems/level-order/)|300|[Solution.java](Graph%20Data%20Structure%20And%20Algorithms/Level%20Order/Solution.java)|
|Bfs|[Smallest Multiple With 0 and 1](https://www.interviewbit.com/problems/smallest-multiple-with-0-and-1/)|300|Solution|
|Graph connectivity|[Commutable Islands](https://www.interviewbit.com/problems/commutable-islands/)|200|Solution|
|Graph connectivity|[Possibility of finishing all courses given pre-requisites](https://www.interviewbit.com/problems/possibility-of-finishing-all-courses-given-prerequisites/)|200|Solution|
|Graph connectivity|[Valid Path](https://www.interviewbit.com/problems/valid-path/)|200|Solution|
|Graph connectivity|[Black Shapes](https://www.interviewbit.com/problems/black-shapes/)|300|[Solution.java](Graph%20Data%20Structure%20And%20Algorithms/Black%20Shapes/Solution.java)|
|Graph connectivity|[Capture Regions on Board](https://www.interviewbit.com/problems/capture-regions-on-board/)|500|Solution|
|Depth first search|[Largest Distance between nodes of a Tree](https://www.interviewbit.com/problems/largest-distance-between-nodes-of-a-tree/)|200|Solution|
|Graph traversal|[Level Order](https://www.interviewbit.com/problems/level-order/)|300|[Solution.java](Graph%20Data%20Structure%20And%20Algorithms/Level%20Order2/Solution.java)|
|Graph traversal|[Stepping Numbers](https://www.interviewbit.com/problems/stepping-numbers/)|300|Solution|
|Graph traversal|[Capture Regions on Board](https://www.interviewbit.com/problems/capture-regions-on-board/)|500|Solution|
|Graph traversal|[Word Search Board](https://www.interviewbit.com/problems/word-search-board/)|500|Solution|
|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)|
|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)|
|Shortest path|[Knight On Chess Board](https://www.interviewbit.com/problems/knight-on-chess-board/)|300|Solution|
|Shortest path|[Word Ladder I](https://www.interviewbit.com/problems/word-ladder-i/)|600|Solution|
|Shortest path|[Word Ladder II](https://www.interviewbit.com/problems/word-ladder-ii/)|800|Solution|
|Graph hashing|[Clone Graph](https://www.interviewbit.com/problems/clone-graph/)|500|Solution|
License
=======
Licensed under [MIT](LICENSE).