Leetcode easy: Return k largest number.
Development Engineer Interview Questions
37,454 development engineer interview questions shared by candidates
Divide two numbers without using division operator and parenthesis matching.
They focus heavily on the leadership principle questions. For example: describe a time you made a mistake and how you handled it.
Find if a linked list has a cycle in it.
Sort the first 100 numbers from a incoming input stream of milions of numbers.
Given an array of integers and another integer X - create an algorithm to determine if the sum of any two integers in the array would result in x
Given an array of sorted characters and a target character, find the closest character from array.
Largest palindromic substring in the given string. Nearest k points to origin in a given set of n co-ordinates given n>=k
Given a singly linked list, find the kth element from the back and delete it.
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1. set(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.
Viewing 521 - 530 interview questions