Question 1

Find Candidates for Data Scientist Position — HashedIn Interview Question

Accepted Answer

"Find Candidates for Data Scientist Position" is a easy difficulty problem asked at HashedIn interviews. It covers the following topics: Database. You can practice it on LeetCode: https://leetcode.com/problems/find-candidates-for-data-scientist-position

Question 2

Maximize Items — HashedIn Interview Question

Accepted Answer

"Maximize Items" is a hard difficulty problem asked at HashedIn interviews. It covers the following topics: Database. You can practice it on LeetCode: https://leetcode.com/problems/maximize-items

Question 3

Maximum Points Inside the Square — HashedIn Interview Question

Accepted Answer

"Maximum Points Inside the Square" is a medium difficulty problem asked at HashedIn interviews. It covers the following topics: Array, Hash Table, String, Binary Search, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/maximum-points-inside-the-square

Question 4

Count the Number of Powerful Integers — HashedIn Interview Question

Accepted Answer

"Count the Number of Powerful Integers" is a hard difficulty problem asked at HashedIn interviews. It covers the following topics: Math, String, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/count-the-number-of-powerful-integers

Question 5

Minimize Length of Array Using Operations — HashedIn Interview Question

Accepted Answer

"Minimize Length of Array Using Operations" is a medium difficulty problem asked at HashedIn interviews. It covers the following topics: Array, Math, Greedy, Number Theory. You can practice it on LeetCode: https://leetcode.com/problems/minimize-length-of-array-using-operations

Question 6

Best Time to Buy and Sell Stock — HashedIn Interview Question

Accepted Answer

"Best Time to Buy and Sell Stock" is a easy difficulty problem asked at HashedIn interviews. It covers the following topics: Array, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/best-time-to-buy-and-sell-stock

#	Question Title	Difficulty	Frequency	Topics
1	Find Candidates for Data Scientist Position	EASY	100.0	Database
2	Maximize Items	HARD	100.0	Database
3	Maximum Points Inside the Square	MEDIUM	100.0	ArrayHash TableString+2
4	Count the Number of Powerful Integers	HARD	83.0	MathStringDynamic Programming
5	Minimize Length of Array Using Operations	MEDIUM	83.0	ArrayMathGreedy+1
6	Best Time to Buy and Sell Stock	EASY	70.5	ArrayDynamic Programming
7	Trapping Rain Water	HARD	70.5	ArrayTwo PointersDynamic Programming+2
8	Maximum Subarray	MEDIUM	70.5	ArrayDivide and ConquerDynamic Programming
9	3Sum	MEDIUM	60.6	ArrayTwo PointersSorting
10	Minimum Time to Repair Cars	MEDIUM	60.6	ArrayBinary Search

Explore 450+ Companies

Companies

HashedIn

Want to see more?

HashedIn Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

HashedIn

Want to see more?

HashedIn Interview Questions

Ai Assistant Kas