How to detect loops in a linked list without using a data structure
Developer Database Oracle Interview Questions
710,390 developer database oracle interview questions shared by candidates
Write out merge sort and apply it to two arrays of integers.
Find largest element in array without using any extra variables or any functions
Given a matrix of integers, start from any column of the first row. can only move diagonally left, diagonally right and down. find the max sum possible. This is a DP problem.
Given a string that has various brackets (e.g. “{“, “(“, “[“, “}”, “)”, “]”) built into it, how would one tell that the string has a balanced number of brackets and in order?
Create monolithic sublists from an array of integers ,in increasing order for example [1,2,4,7,5,6,3,2] will give [[1,2,4,7][5,6],[3],[2]]
Given any number of arrays containing numbers, write a function which finds the numbers that appear in exactly two arrays. arrays = [ [6, 2, 2, 0, 4], [5, 0, 2, 6, 7, 1], [6, 7, 9, 9], ] find_in_two(arrays) should return [2, 0, 7]
input log = [ { 'user': 'A', 'page': 1}, { 'user': 'B', 'page': 5}, { 'user': 'A', 'page': 2}, { 'user': 'A', 'page': 1}, { 'user': 'B', 'page': 2}, { 'user': 'C', 'page': 7}, { 'user': 'C', 'page': 3}, { 'user': 'A', 'page': 3}, { 'user': 'C', 'page': 1}, ] please implement discover_site_map(log) discover_site_map returns a representation of the links between pages, using whatever data structure you think is suitable: 1 -> 2, 3 2 -> 1 3 -> 1 5 -> 2 7 -> 3
Write a program takes in a string and a delimiter, and uses that delimiter to split a string and then will reverse the characters in every word (or jumble of characters between the delimiters), stuffing them back into a string when finished. ('The dog walks' becomes..... 'ehT god sklaw')
Why is a manhole cover round?
Viewing 751 - 760 interview questions