https://github.com/tiarebalbi/interview-problem-solving
Sample Questions usually presented during interviews to check your problem solving skills.
https://github.com/tiarebalbi/interview-problem-solving
binary-search interview java kotlin merge-sort problem problem-solving solving
Last synced: 23 days ago
JSON representation
Sample Questions usually presented during interviews to check your problem solving skills.
- Host: GitHub
- URL: https://github.com/tiarebalbi/interview-problem-solving
- Owner: tiarebalbi
- License: mit
- Created: 2018-11-07T05:39:44.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2024-03-22T04:44:48.000Z (about 2 years ago)
- Last Synced: 2024-04-14T23:09:58.615Z (about 2 years ago)
- Topics: binary-search, interview, java, kotlin, merge-sort, problem, problem-solving, solving
- Language: Kotlin
- Homepage:
- Size: 181 KB
- Stars: 3
- Watchers: 3
- Forks: 0
- Open Issues: 3
-
Metadata Files:
- Readme: README.md
- Contributing: .github/CONTRIBUTING.md
- License: LICENSE
- Code of conduct: .github/CODE_OF_CONDUCT.md
- Security: SECURITY.md
Awesome Lists containing this project
README
# Interview Problem Solving
Sample Questions usually presented during interviews to check your problem solving skills.
[](https://codeclimate.com/github/tiarebalbi/interview-problem-solving/maintainability)
---
## Algorithms
### Merge Sort
In computer science, merge sorts is an efficient, general-purpose, and comparison-based sorting algorithm. Most
implementations produce a stable sort, which means that the order of equal elements is the same in the input and output.
**Reference:** [Link](src/main/kotlin/com/tiarebalbi/interview/algorithms/MergeSort.kt)
### Quick Sort
Quicksort is an in-place sorting algorithm. Developed by British computer scientist Tony Hoare in 1959 and published in
1961, it is still a commonly used algorithm for sorting. When implemented well, it can be somewhat faster than merge
sort and about two or three times faster than heapsort.
**Reference:** [Link](src/main/kotlin/com/tiarebalbi/interview/algorithms/QuickSort.kt)
### Binary Search
In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search
algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to
the middle element of the array.
**Reference:** [Link](src/main/kotlin/com/tiarebalbi/interview/algorithms/BinarySearch.kt)
-----
## The Two Egg Problems
### A building has 100 floors. One of the floors is the highest floor an egg can be dropped from without breaking.
If an egg is dropped from above that floor, it will break. If it is dropped from that floor or below, it will be
completely undamaged and you can drop the egg again. Given two eggs, find the highest floor an egg can be dropped from
without breaking, with as few drops as possible.
[Source Code](https://github.com/tiarebalbi/interview-problem-solving/blob/master/src/main/kotlin/com/tiarebalbi/interview/problem1)
#### Output:
2018-11-07 08:01:21 INFO TwoEggProblem:29 - Highest floor an egg won't break from: 13
2018-11-07 08:01:21 INFO TwoEggProblem:30 - Floors we drop first egg from: [50]
2018-11-07 08:01:21 INFO TwoEggProblem:31 - Floors we drop second egg from: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
2018-11-07 08:01:21 INFO TwoEggProblem:32 - Total number of drops: 13
2018-11-07 08:01:21 INFO TwoEggProblem:29 - Highest floor an egg won't break from: 98
2018-11-07 08:01:21 INFO TwoEggProblem:30 - Floors we drop first egg from: [50, 75, 88, 94, 97]
2018-11-07 08:01:21 INFO TwoEggProblem:31 - Floors we drop second egg from: []
2018-11-07 08:01:21 INFO TwoEggProblem:32 - Total number of drops: 5
---
## The Cake Thief
### You are a renowned thief who has recently switched from stealing precious metals to stealing cakes because of the insane profit margins. You end up hitting the jackpot, breaking into the world’s largest privately owned stock of cakes—the vault of the Queen of England.
While Queen Elizabeth has a limited number of types of cake, she has an unlimited supply of each type.
Each type of cake has a weight and a value, stored in an object with two properties:
1. `weight` : the weight of the cake in kilograms
2. `worth` : the monetary value of the cake in British pounds
You brought a duffel bag that can hold limited weight, and you want to make off with the most valuable haul possible.
Write a function maxDuffelBagValue() that takes an array of cake type objects and a weight capacity, and returns the
maximum monetary value the duffel bag can hold.
[Source Code](https://github.com/tiarebalbi/interview-problem-solving/blob/master/src/main/kotlin/com/tiarebalbi/interview/problem2)
#### Output:
2018-11-07 11:25:09 INFO TheCakeThief:44 - maxDuffelBagValue: 555 with a capacity of 20 with cakes [Cake(weight=7, worth=160), Cake(weight=3, worth=90), Cake(weight=2, worth=15)]
2018-11-07 11:25:09 INFO TheCakeThief:44 - maxDuffelBagValue: 3000 with a capacity of 100 with cakes [Cake(weight=1, worth=30), Cake(weight=50, worth=200)]
2018-11-07 11:25:09 INFO TheCakeThief:44 - maxDuffelBagValue: 110 with a capacity of 8 with cakes [Cake(weight=3, worth=40), Cake(weight=5, worth=70)]
2018-11-07 11:25:09 INFO TheCakeThief:44 - maxDuffelBagValue: 120 with a capacity of 9 with cakes [Cake(weight=3, worth=40), Cake(weight=5, worth=70)]
---