interviewbit

KO | EN

gitlite — search

#python #cli #ai #open-source #artificial-intelligence #llm #javascript #macos #typescript #rust #ai-agents #fastapi

★ 75 Open GitHub ↗

problems from interviewBit website (Java version)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

### programming problems from [interviewBit](http://www.interviewbit.com/dashboard/)

### Problems that are not included by or different from Leetcode (2015.07.13)
| Problem in interviewBit |          Note       |
| ----------------------- | --------------------| 
| L4 check points: [Find Next Greater Element](http://www.interviewbit.com/courses/programming/topics/stacks-and-queues/problems/nextgreater/) | use stack to keep indices of an ascending order |
| [Hashing] Two Sum | In leetcode, there is only one solution, InterviewBit requires to find the combination with least number for index1 |
| [Binary Search] [Books](http://www.interviewbit.com/courses/programming/topics/binary-search/problems/books/) ] | difficult binary search |
| [Binary Search] [Power remainer](http://www.interviewbit.com/courses/programming/topics/binary-search/problems/pow/) | difficult: very larger power |
| [Two Pointers] [Trick.MAXONE](http://www.interviewbit.com/courses/programming/topics/two-pointers/problems/maxone/) | See also [Leetcode 076] keep a window and update window when invariant is broken |
| [Two Pointers][Trick.APP3PTR](http://www.interviewbit.com/courses/programming/topics/two-pointers/problems/array3ptr/) | use two pointers on sorted array, move the pointer to shrink gap |
| [Two Pointers] [Sorting.DIFF](http://www.interviewbit.com/courses/programming/topics/two-pointers/problems/diffk/) | fast-slow window, not all sorted array is going to use binary search |
| [Arrays] [BucketOrSorting.HOTEL](http://www.interviewbit.com/courses/programming/topics/arrays/problems/hotel/) | Great problem, build an event queue to solve problem |
| [Dynamic Programming] [ADJACENT](http://www.interviewbit.com/courses/programming/topics/dynamic-programming/problems/adjacent/) | apply greedy choice in adjacent neighbors for dp program |
| [Dynamic Programming] [MAXCOIN](http://www.interviewbit.com/courses/programming/topics/dynamic-programming/problems/maxcoin/) | Minmax algorithm |

### Reference

|   interviewBit    | Leetcode# |    Problem    |
| ----------------- | :-------: | ------------- |
| math.REVINT       | 007       | reverse integer (monitor Stack Overflow) |
| math.ROMAN2INT    | 013       | convert roman number to decimal number |
| math.FACTORIAL    | 177       | find trailing zeros in n! |
| binarysearch.SimpleBinarySearch.SEARCH2D | 074 | convert 2D coordinates to 1D index | 
| strings.PALINDROME | 125       | validate palindrome string |
| strings.LCP       | 014       | longest common prefix |
| strings.COUNT_SAY | 038       | count and say |
| strings.LONGESTPALIN | 005       | longest palindromic substring |
| strings.LENGTHLAT |           | length of last word |
| strings.REVWORD   | 151       |  |
| strings.STRSTR    | 028       | implement strStr |
| strings.VERSION   |           | |
| strings.ATOI   |           | |
| strings.VALIDNUMBER |           | |
| strings.IPADDRESS | 093       | parse ip address string |
| strings.ZIGZAG    | 006       | zig zag conversion |
| strings.ADDBINARY | 067       | add binary numbers |
| strings.TEXTJUST  | 068       | text justification |
| twopointers.Sorting.DIFFK| | two pointers |
| twopointers.Tricks.CONTAINER | 011 | head - tail pointers |
| twopointers.Trick.MAXONE | |  keep a valid window |
| linkedlists.SORTLIST | 148       | sort list in O(nlgn) |
| stacksandqueues.PARENTHESIS | 020       | |
| hashing.REPEATSTR | 003       | hashing + two pointers |

interviewbit

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README