Aditya Vaasudev Badityavaasudevb.hashnode.dev·May 14, 2024Essential Guide to Queues: What They Are and How They WorkIntroduction Whether you're at a railway reservation counter, waiting in line at the movie theater, or submitting print jobs to a network printer, forming a queue is the universal solution to bring order to chaos. By patiently awaiting your turn, you...Discuss·1 likequeue ds
Kali Baranwalkalibaranwal.hashnode.dev·May 11, 2024Key Data Structures and Algorithms Concepts for Placement AssessmentsDATA STRUCTURE Array: All the basics of array is to be covered within this ,like declaration of array, initialisation of array, traversal. String: Declaration of string using "string" keyword. Linked list: Single linked list, Double linked list, C...Discussdatastructure
Aditya Vaasudev Badityavaasudevb.hashnode.dev·May 10, 2024Stacks 101: A Beginner's OverviewIntroduction Whether it's items in a store or books in a library, once they become more than handful, people naturally start tidying things up by stacking them. When man started programming data, stack was one of the first structures that he thought ...Discuss·1 likeStacks
Umang Srivastavaoutlierchronicles.hashnode.dev·May 2, 2024746. Min Cost Climbing StairsUsing python and go Problem Statement You are given an integer array cost where cost[i] is the cost of ith step on a staircase. Once you pay the cost, you can either climb one or two steps. You can either start from the step with index 0, or the step...Discuss·15 likesRecursionPython
Umang Srivastavaoutlierchronicles.hashnode.dev·May 1, 20242441. Largest Positive Integer That Exists With Its NegativeProblem Statement Given an integer array nums that does not contain any zeros, find the largest positive integer k such that -k also exists in the array. Return the positive integer k. If there is no such integer, return -1. Examples Example 1: Input...Discuss·20 likesLeetCode DailyPython
Umang Srivastavaoutlierchronicles.hashnode.dev·May 1, 202470. Climbing StairsProblem Statement You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Examples Example 1 Input: n = 2 Output: 2 Explanation: There are two w...Discuss·16 likesRecursionPython
Kenny Carnealblog.kennycarneal.com·May 1, 2024Leetcode 2000 Reverse Prefix of WordIntuition Find position of ch (if any) then use two pointers to swap characters until string is reveresed from beginning to index of ch Approach Start by checking each character for ch. If we find it, that's where our right pointer will start. Our le...DiscussLeetCode journeyleetcode
Saurav Maheshwarixauravww.hashnode.dev·Apr 19, 2024Remove Elements - Easy Leetcode Solution using TypeScriptUnderstanding the 'Remove Element' Problem The 'Remove Element' problem asks us to remove all occurrences of a specific number, val, from an array of numbers, nums. Problem Type- Easy https://leetcode.com/problems/remove-element/description/ O(n) Sol...DiscussData Structures and Algorithmsleetcode-solution
Umang Srivastavaoutlierchronicles.hashnode.dev·Apr 14, 20241137. N-th Tribonacci NumberIn this blog, let's explore how we can tackle the 1137. N-th Tribonacci Number problem using Python and Golang. Problem Statement The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given ...Discuss·3 likes·34 readsRecursionPython
Umang Srivastavaoutlierchronicles.hashnode.dev·Apr 13, 2024The Recursive JourneyRecursion, a programming concept where a function calls itself, might sound like a mind-bender at first. But fear not! This powerful technique is surprisingly intuitive and can be a valuable tool in your Pythonic arsenal. In this blog, we'll embark o...Discuss·5 likesRecursionRecursion