Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Suppose we have a string s. This string can contain lowercase characters, other special characters and numbers. We have to check whether only the letters present in the string are palindromic or not. Here one constraint is that there we are not allowed to use extra space to solve this problem.So, if the input is like s = "ra$5ce58car", then the output will be True, as the letters are forming "racecar" which is palindrome.To solve this, we will follow these steps −Define a function first_letter_index() . This will take str, left, rightindex := -1for i in range left to right ... Read More
Suppose we have a number num, we have to check whether the binary representation of num has the same number of consecutive blocks of 0s and 1s. We have to keep in mind that 0 and a number with all 1s are not considered to have number of blocks of 0s and 1s.So, if the input is like num = 455, then the output will be True, as the binary representation of this number is 111000111.To solve this, we will follow these steps −bin_form := binary form of numone_count := a new setcount := 1for i in range 0 to ... Read More
Suppose we have an array nums of unique elements. We have to check whether these conditions satisfy or not:Elements will be in range 1 to n.The array must not be sorted in ascending order.So, if the input is like nums = [2, 6, 1, 5, 3, 4], then the output will be True.To solve this, we will follow these steps −n := size of numstotal := nums[0]is_sorted := Truefor i in range 1 to n - 1, doif nums[i] is same as nums[i - 1], thenreturn Falseif nums[i] < nums[i - 1], thenis_sorted := Falsetotal := total + nums[i]if is_sorted ... Read More
Suppose we have an array called nums we have to check whether the array contains an element whose value is same as sum of all other elements.So, if the input is like nums = [3, 2, 10, 4, 1], then the output will be True, 10 = (3+2+4+1).To solve this, we will follow these steps −freq := an empty maptotal := 0for i in range 0 to size of nums - 1, dofreq[nums[i]] := freq[nums[i]] + 1total := total + nums[i]if total is even, thenif freq[quotient of (total / 2)] is non-zero, thenreturn Truereturn FalseLet us see the following implementation ... Read More
Suppose we have an array called nums we have to check whether the array contains an element whose value is same as product of all other elements.So, if the input is like nums = [3, 2, 24, 4, 1], then the output will be True, 24 = (3*2*4*1).To solve this, we will follow these steps −mul := 1for i in range 0 to size of nums - 1, domul := mul * nums[i]for i in range 0 to size of nums - 1, doif nums[i] is same as (mul / nums[i]), thenreturn Truereturn FalseLet us see the following implementation to ... Read More
Suppose we have an array called nums with unique values from range [0, n – 1]. This array is unsorted. We also have another array of pairs where each pair contains indices where the elements of the array can be swapped. We can swap multiple number of times. We have to check whether we can arrange the array in sorted order using these swaps or not.So, if the input is like nums = [6, 1, 7, 3, 0, 5, 4, 2] pairs = [(0, 4), (6, 0), (2, 7)], then the output will be True, as we can swap index ... Read More
Virtual – circuit and datagram networks are categories of packet switching network. In virtual circuits, a virtual path is established between the source and the destination systems through which the data packets are transferred from the source to the destination. In the other hand, in datagram networks, each data packet called datagram contain adequate header information so that they can be individually routed by all intermediate network switching devices to the destination.DifferencesIssueVirtual – Circuit NetworksDatagram NetworksConnectivityVirtual – circuits are connection oriented networks.Datagram networks are connectionless.PathIn these networks, the path between the source and the destination nodes that is followed by ... Read More
Suppose we have a 2D matrix. We have to check whether the sum of i-th row is same as the sum of i-th column or not.So, if the input is like23451064214671567then the output will be True, as the sum of first row and column is (2 + 3 + 4 + 5) = 14 and (2 + 10 + 1 + 1) = 14.To solve this, we will follow these steps −row := row count of matcol := column count of mattotal_row := 0, total_col := 0for i in range 0 to row - 1, dototal_row := 0, total_col := ... Read More
Suppose we have two numbers p and q. We have to check whether the sum of all divisors of these tow numbers are same or not.So, if the input is like p = 559, q = 703, then the output will be True the divisors of 559 is 1, 13, 43 and 703 is 1, 19, 37. The sum of the divisors are 57.To solve this, we will follow these steps −Define a function divSum() . This will take ntotal := 1i := 2while i * i
Multiprotocol Label Switching (MPLS) is a routing technique that augments speed and control of the network traffic by directing data from one node to the next node based on short path labels. Instead of being routed using long network addresses, the data packets are routed through path labels that identify virtual paths between the nodes rather than endpoints. MPLS speeds up traffic flows by avoiding complex lookups in the routing table at each node as in conventional routing algorithms.MPLS is a scalable and protocol-independent routing technique. It works with Internet Protocol (IP), Ethernet, Frame Relay and Asynchronous Transport Mode (ATM). ... Read More