0

votes

0

solutions
Base types > Weird tree-like thing
Given this weird tree-like thing: Find greatest sum on a path from root to leaf (that can only touch one node per level—no going up and down).
ago
Author : AnaPana

0

votes

1

solution
Base types > Using sets
Write a function to find if a set A is subset of a set B, B is a subset of A, the two sets are equal, or none of the above (you are allowed to use set operations like union and intersection).
ago
Author : AnaPana

0

votes

1

solution
Base usage > Find users that belong to group
Write program that given a group name, will find all users that belong to that group.

0

votes

3

solutions
Boot up > Describe boot process
Describe indepth sequence of all steps of boot up system. All steps also should be covered.

0

votes

2

solutions
Base types > Check if num is power of 2
Check if num is power of 2
ago
Author : ochirkov

0

votes

1

solution
Base types > Generate a number in range but not from blacklist
Generate a number is range (1,n) but not in a list (i,j)  for example range is (1,1000), list is [2,3,5,9,199,200,344]
ago
Author : ochirkov

0

votes

2

solutions
Base types > Number represented as array of digits
Given a number represented as an array of digits, plus one to the number. ie. 1000 is [1,0,0,0] result is [1,0,0,1]
ago
Author : ochirkov

0

votes

3

solutions
Base types > First Character Appearing Only Once
Implement a function to find the first character in a string which only appears once. For example: It returns ‘b’ when the input is “abaccdeff” (source)

0

votes

1

solution
Base types > Maximum Sum of All Sub-arrays
Given an integer array with positive numbers and negative numbers, get the maximum sum of all sub-arrays (without permutations). Time complexity should be O(n) (source). For example, in the list [1, -2, 3, 10, -4, 7, 2, -5], its sub-list [3, 10, -4, 7, 2] has the maximum sum 18.

0

votes

1

solution
Base types > A Pair with the Maximal Difference
A pair contains two numbers, and its second number is on the right side of the first one in an array. The difference of a pair is the minus result while subtracting the second number from the first one. Please implement a function which gets the maximal difference of all pairs in an array. For example, the maximal difference in the array {2, 4, 1, 16, 7, 5, 11, 9} is 11, which is the minus resu...

algorithm array awk bash bios boot-up bubble built-in chmod dictionary difference dividers division file forkbomb google grep group grub if ifconfig init insertion iostat ip itilities link linked linux list lower-case max merge parse prevention python quick reboot redirect regex restore rm search seek selection set shell sort string sum trash tree troubleshooting union update upper-case user