Following is a function for deleting the entire list by accessing the head pointer to the 1st node: void deleteList(Node *head) { while (head != nullptr) { Node *temp = head; head = head->next; delete temp; } } Detailed program: struct Node { int data; Node* next; }; void traverseList(Node* head) { while (head !=… Read More How come I can still access nodes after deleting an entire linked list?

Insertion Sort is a simple sorting technique which was covered in previous challenges. Sometimes, arrays may be too large for us to wait around for insertion sort to finish. Is there some other way we can calculate the number of shifts an insertion sort performs when sorting an array? If is the number of elements… Read More algorithem for Insertion Sort Advanced Analysis

This function calculates the length of a singly linked list recursively. tail is an instance variable that points to the next object in the list. public int length() { if (tail == null) { return 1; } return 1 + tail.length(); } However it uses no parameters as shown. I’m struggling to understand the logic… Read More How does this recursive function with no parameters work?

The Question I have is : For a given two strings, ‘str1’ and ‘str2’, check whether they are a permutation of each other or not. Permutations of each other Two strings are said to be a permutation of each other when either of the string’s characters can be rearranged so that it becomes identical to… Read More Check Permutation of string in Java

I was practising DSA questions. Given an array Arr[] that contains N integers (may be positive, negative or zero). Find the product of the maximum product subarray. I am unable to complete this code. Please check the code and help. Thanks in advance. def maxSubarrayProduct(arr, n): result = arr[0] for i in range(n): mul =… Read More Maximum Product Subarray GFG Question Python

def binarySearch(nums,low,high,target): if low<=high: mid=(low+high)//2 if nums[mid]==target: return mid if nums[mid]<target: binarySearch(nums,mid+1,high,target) else: binarySearch(nums,low,mid-1,target) else: return -1 def search(nums, target): return binarySearch(nums,0,len(nums)-1,target) nums=[-1,0,3,5,9,12] target=9 print(search(nums,target)) console output Expected output of the above python code for binary search is ‘4’. But my output is ‘None’. I also printed the value of mid on console output just… Read More why a python function still returns "None" though i am explicitly returning a value?

I am writing a recursive method to get all the subsequence of a list that has a particular sum. But, when I add them to the resultList(ArrayList<ArrayList), I am getting an empty list in the output. Can someone please suggest what am I doing wrong here? Below is the code: public class SubsequenceUsingRecursion { static… Read More Empty list getting added in ArrayList

Why am i getting this error, while finding the running sum of an array in c++? Line 1034: Char 34: runtime error: addition of unsigned offset to 0x6020000000b0 overflowed to 0x6020000000ac (stl_vector.h) SUMMARY: UndefinedBehaviorSanitizer: undefined-behavior /usr/bin/../lib/gcc/x86_64-linux-gnu/9/../../../../include/c++/9/bits/stl_vector.h:1043:34". the code is: class Solution { public: vector<int> runningSum(vector<int>& nums) { vector<int> temp(nums.size()); nums[0]=temp[0]; for(int i=0;i<nums.size();i++){ temp[i]=temp[i-1]+nums[i]; } return… Read More Error while finding the running sum of an array in C++ using vectors