Think of the 8 vertices of a given cube. You are allowed to join three
vertices to form a triangle. How many such unique acute triangles can you make ??
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given "25525511135" , return ["255.255.11.135", "255.255.111.35"] . (Order does not matter)
1 - 3 face diagonals forming a triangle
ReplyDeletenumber of such triangles is ??
ReplyDelete8
ReplyDelete