Data structure & algorithm using swift language.
The good approach will be to use log10 Time complexity O(1) Space complexity O(1) . The number of digits in an integer = the upper bound of log10(n).Example: log10(12345.0)) = > 4.091491094267951 so we have to use 4+1 Read more about Logarithm here https://janeshswift.com/ios/dsa/math/logarithms-explained/
How to count number of digits ? Read More »
[Question]: Reverse Integer in swift ex. 12345 => 54321 output should lie in Int32 Range TC: O(n)SC: O(1) Explanation: Here we are multiplying result with10 further adding it to modulo(reminder) & get last element by divide by 10 Example – 7913 ==== 3197 r 0 30 310 3190 r 3 31 319 3197 x 791
How to reverse an Integer ? Read More »
[Question]: Find maximum sum of a subarray of size k example [9,1,3,2,6,1,5,9], k: 4 = output: 21 (6+1+5+9)Solution: with sliding window we can achieve. first we take sum of first k elements further move elements by 1 window size & add the latest var & remove last var.
How to find maximum sum of a subarray of size k – Sliding window swift Read More »
[Question]: – Add two numbers using the ListList in swift. Ex Input: l1 = [2,4,3], l2 = [5,6,4] Output: [7,0,8] Explanation: 342 + 465 = 807. Explanation: # Recursion Approach: Create a sum variable & add two nodes with a previous reminder on the recursive call use modulo operator to use the numerator value (7%10
How to add two numbers in LinkList ? Read More »
[Question]: Given an integer array that may contain duplicates, find all possible subsets (the power set). No duplicates allowed in answer. Solution in any order allowed. Input: nums = [1,2,3] Output: [1,2,3] [1,2] [1,3] [1] [2,3] [2] [3] [] Approach #2: Using Bitwise OperatorQuestion: Power Set: Print all the possible subsequences of the String To check
Return all possible subset from an array Read More »
[Question] : Find subset sum in given ArrayExample: Input: N = 6 arr[] = {3, 34, 4, 12, 5, 2} sum = 9 Output: 1 Explanation: Here there exists a subset with sum = 9, 4+3+2 = 9.
How to find subset sum Read More »
[Question]: In a distinct array a target integer target, return a list of all unique combinations of candidateInput: candidates = [2,3,6,7], target = 7 Output: [[2,2,3],[7]]
Find combination of sum possibilities Read More »
[Question]: In an array count all possible sequence whose sum is K. example:- [4,8,4] Target Sum = 8 So Output will be 2 because sequences are: [4,4] [8]
Count All Possible Sequence whose sum is K Read More »
[Question] : Print any one sequence whose some is equal to KFor example:- [4,8,4] Target Sum = 8 So Output will be [4,4]
Print one sequence whose sum is K Read More »
[Question] : In a given array find all possible sequence whose sum is certain number: For example:- [4,8,4] Target Sum = 8 So Output will be [4,4] [8]
How to Find all subsequences with sum equals to K Read More »
