Data Structures

Program On Queue In C

by

Have you ever seen a program on queue in C? No. Then you are in the right place. Today we will write a program in C that will use the queue data structure. What is Queue? In C, a queue is essentially a linear data structure for managing and storing data components. First In, First … Read more

Permutations 2 LeetCode – Python Solution

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Permutations 2 LeetCode”. Today We are going to solve this problem in Python. LeetCode Link of the Problem is HERE Questions Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Examples Input: nums = [1,1,2]Output:[[1,1,2],[1,2,1],[2,1,1]] Input: nums = [1,2,3]Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] … Read more

Wildcard Matching Leetcode – Python Solution

by

LeetCode has a Hard coding Problem in Its’ Algorithm Section “Wildcard Matching Leetcode”. Today We are going to solve this problem in Python. LeetCode Link of the Problem is HERE. Question Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for ‘?’ and ‘*’ where: ‘?’ Matches any single character. ‘*’ Matches any sequence of … Read more

Multiply strings leetcode python

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Multiply strings leetcode python”. Today We are going to solve this problem. LeetCode Link of the Problem is HERE Question Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Note: You must not use any built-in BigInteger library or convert the … Read more

First Missing Positive – Leetcode Python

by

LeetCode has a Hard coding Problem in Its’ Algorithm Section “First Missing Positive”. Today We are going to solve this problem. LeetCode Link of the Problem is HERE Question Given an unsorted integer array nums, return the smallest missing positive integer. You must implement an algorithm that runs in O(n) time and uses constant extra space. Examples Input: … Read more

Find First And Last Position of Element in Sorted Array

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Find First And Last Position of Element in Sorted Array”. Today We are going to solve this problem. LeetCode Link of the Problem is HERE Question Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not … Read more

Search in Rotated Sorted Array – Leetcode Python

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Search in Rotated Sorted Array”. Today We are going to solve this problem. LeetCode Link of the Problem is HERE Question There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 <= k < … Read more

Next Permutation Leetcode – Python Solution

by

LeetCode has a Medium coding Problem in Its’ Algorithm Section “Next Permutation Leetcode”. Today We are going to solve this problem. LeetCode Link of the Problem is HERE. Question A permutation of an array of integers is an arrangement of its members into a sequence or linear order. For example, for arr = [1,2,3], the following are considered … Read more

Substring with Concatenation of All Words – LeetCode

by

LeetCode has a hard coding Problem in Its’ Algorithm Section “Substring with Concatenation of All Words”. Today We are going to solve this problem. LeetCode Link of the Problem is HERE Question You are given a string s and an array of strings words of the same length. Return all starting indices of substring(s) in s that is a concatenation of each word in words exactly … Read more

Implement strStr() – Leetcode Python Solution

by

LeetCode has a Easy coding Problem in Its’ Algorithm Section “Implement strStr()”. Today We are going to solve this problem. LeetCode Link of the Problem is HERE Question Implement strStr(). Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Clarification: What should we return when needle is an empty string? This is … Read more