1- Write a function that returns 7 when getting 4 and 4 when getting 7, without using any conditions. 2- As above, only now without using any mathematical operations. 3- As above, only now without using any logical operations. 4- As above, only now without using any operation at all. Extra space is allowed though. 5- What is the minimum space needed to apply last question?
2. Void main(){ Const char* arr = "interview"; Char* ptr = (char*)malloc(sizeof(strlen(arr)+1)); For(int I = 0; i
4. You are given an int and write an algorithm in python that determines if this int is a palindrome.
Given a linked list of size n, and an integer m < n. What is the m's biggest integer from a linked list from the end?
questions that aimed to use a minimum heap, and bit wise questions
behavioral questions in the interview
Create a function that receives an array of integers as input, and each time it's called, it returns the same array but with the elements in a random order. Each possible scrambled array should have the same probability.
Given an unsorted array with duplicates of letters, the array should be returned without the duplicates without importance to the order, the point of the question was to implement a set
Can you explain your resume?
Warmup question: how to implement firewall consider list of allowed ip's?
Viewing 201 - 210 interview questions