Data structure & algorithm using swift language.
Here are the steps to convert decimal number into binary : – Convert 410 to binary: Divide by 2 Quotient Remainder Bit / count 4/2 2 0 0 2/2 1 0 1 1/2 0 1 2 So 410 = 1002 You can try out self Here are list of some binary numbers – Decimal Binary 0 0 …
[Question]: In a given random array find a number which appears only single time Example : Random array input – [9,2,2,3,4,4,3] output = 9Solution: Step 1: Create a dictionary. Step 2: Create loop and fill the keys with element occurrence.Step 3: Create a loop and return the dictionary element which has only single occurrence .T …
How to Find a number which appears once and other numbers are twice ? Read More »
[Question] In a. Given a binary array nums and an integer k, find the maximum number of consecutive 1‘s in the array & you can flip at most k 0‘s.Example: – var arrMix = [1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1] var arrCount = 11 var maxZeros = 2Hence the output will be 8 i.e 1, 1, …
How to find max consecutive 1’s with Kth allowed zero flip ? Read More »
[Question] In given two sorted arrays find intersection.// Ex–> A: [1 2 3 3 4 5 6] , B: [3 3 5] Output: 3,3,5#Approach: // TC O(n) // SC O(1)
[Question]: In a given two sorted array find union elements. Output should be sorted. For example : arr1[] = {1,2,3,4,5} arr2[] = {2,3,4,4,5} Output: {1,2,3,4,5}Approach #1: Use Dictionary / Hashset & after it sort the array which SC: O(m+n) TC: O( (m+n)log(m+n) ) Approach #2: Two pointer approach: use two pointer i & j & fill the …
Logic: Create a pivot element & arrange elements with two partitions, If the elements are lesser than pivot add it to left partition & if elements bigger than the pivot arrange it to right side of partition & make call recursively with the subarray found with same approach. Time Complexity: Avg O(n^2) .. Best: O(n …
Merge Sort is based on divide & conquer approach, first we divide array into two parts until we got single element then merge the single single element and create a subarray, Now merge two sorted subarray into single array likewise in final we got the final sorted array. In Conquer approach we have i, j …
[Question]: Prepare recursion stack for multilevel recursion.
# Approach Assume two part of the array sorted & unsorted. Sorted start from 1 element A[0] & fills with unsorted one by one (A[1] to A[n-1]) Attached code with dry run. In Insertion sort we sort using two sets. One is Sorted set Another is unsorted one. Initially we sorted is index 0 element …
Approach: Swap Adjacent elements from an array a[j] > a[j+1] then swap
