Geeky Codes | AI Engineering, Data Engineering & Machine Learning Tutorials
DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively.
Problem Statement Given a string containing lowercase English letters, compute the frequency of each character and then invert the mapping such that: Example Input Character Frequency Map Expected Output Understanding the Problem Most frequency-counting problems stop after creating a dictionary that maps characters to their counts. For this problem, we need to go one step … Read more
Prime numbers have fascinated mathematicians for centuries. Among the many special categories of primes, Chen Primes occupy an interesting place because they extend the idea of twin primes and connect prime numbers with semiprimes. In this article, we’ll understand: What is a Chen Prime? A prime number P is called a Chen Prime if: A … Read more
Introduction: In string manipulation, discovering unique strings amidst a sea of possibilities can be both challenging and rewarding. In this tutorial, we embark on a journey to unravel the secrets of identifying unique strings, armed with the power of swapping characters at odd and even indices. Join us as we delve into the depths of … Read more
Lily likes to play games with integers. She has created a new game where she determines the difference between a number and its reverse. For instance, given the number 12, its reverse is 21. Their difference is 9 . The number 120 reversed is 21, and their difference is 89. She decides to apply her game to decision making. She will … Read more
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. A mapping of digits to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters. Example 1: Input: digits = “23” Output: [“ad”,”ae”,”af”,”bd”,”be”,”bf”,”cd”,”ce”,”cf”] Example 2: … Read more
Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution. Example 1: Input: nums = [-1,2,1,-4], target = 1 Output: 2 Explanation: The sum that is closest to the target is … Read more
Finding the top ( k ) most frequent elements in an array is a common question in coding interviews and a useful task in various applications like data analysis and natural language processing. This guide will walk you through three effective methods to solve this problem: using a HashMap with sorting, Min-Heap, and Bucket Sort. … Read more
In many coding interviews and real-world applications, finding the top ( k ) largest elements in an array is a common problem. This tutorial will guide you through three popular methods to solve this problem: Sorting, Min-Heap, and the Quick select algorithm. We’ll focus on the Min-Heap approach due to its efficiency and practical use … Read more
Introduction: In programming, it’s common to encounter scenarios where you need to count the number of elements occurring an odd number of times and the number of elements occurring an even number of times in an array. This tutorial will guide you through the process of solving such a problem efficiently using Python. Understanding the … Read more
Introduction:Prime numbers are natural numbers greater than 1 that have no positive divisors other than 1 and themselves. Determining whether a given number is prime or not is a common problem in mathematics and computer science. In this tutorial, we’ll learn how to write a Python program to check if a number is prime or … Read more
Introduction:In programming, efficiently managing linked lists is a crucial skill. Deleting nodes with greater values on the right side is a common problem encountered while working with linked lists. In this tutorial, we’ll explore an optimized algorithm to tackle this problem using Python programming. We’ll delve into the implementation details, algorithmic insights, and optimization techniques … Read more
Introduction:Discovering the maximum difference between elements in a Python array is a crucial programming task, often demanding efficient algorithms for optimal results. In this comprehensive tutorial, we’ll delve into Python programming techniques to efficiently solve this problem. We’ll explore the intricacies of implementation, delve into algorithmic insights, and analyze time complexity to comprehend the solution … Read more
Introduction:Sorting a list of unique integers is a common task in programming, often requiring efficient algorithms to achieve the desired result. In this tutorial, we’ll explore how to implement a Python function to sort unique integers in ascending order without using any built-in sort functions. We’ll delve into the insertion sort algorithm and demonstrate its … Read more
Introduction: Character frequency counting is a common task in string manipulation, often encountered in various programming scenarios. In this tutorial, we’ll explore an efficient approach to calculate the frequency of each character from ‘a’ to ‘z’ in a given string ‘S’, using Python programming. We’ll delve into the algorithmic insights and analyze the time complexity … Read more
Introduction: String manipulation is a fundamental aspect of programming, and understanding efficient techniques for performing string operations is essential. In this tutorial, we’ll explore an efficient approach to reverse substrings within a string, leveraging Python programming and a thorough understanding of string manipulation. Understanding the Problem: Given a string ‘S’ and a set of ‘M’ … Read more
Given a number N, find its square root. You need to find and print only the integral part of square root of N. For eg. if number given is 18, answer is 4. Input format : Output Format : Constraints : Understanding the Problem: Given a non-negative integer ‘N’, our objective is to find and … Read more
Introduction: In the world of string manipulation, unraveling patterns and matching sequences play a pivotal role in various applications. In this tutorial, we’ll embark on a journey to decode word patterns, where we’ll determine if two strings follow the same pattern. Through the lens of Java programming, we’ll explore an efficient approach to tackle this … Read more
Problem Statement: Given a positive integer ‘N’, our objective is to compute and return the minimum number of steps needed to reduce ‘N’ to 1. We have three permissible operations: Understanding the Approach: To efficiently solve this problem, we’ll employ dynamic programming to compute the minimum steps needed for each integer from 1 to ‘N’. … Read more
Introduction: The task at hand is to implement a Python function that finds the kth lexicographically smallest integer in the range from 1 to n. To achieve this, we will use a depth-first search (DFS) approach, exploring the numbers in lexicographical order. Let’s dive into the implementation. Also checkout: Implementation: Explanation: Example: For n = … Read more
The Utopian Tree goes through 2 cycles of growth every year. Each spring, it doubles in height. Each summer, its height increases by 1 meter. A Utopian Tree sapling with a height of 1 meter is planted at the onset of spring. How tall will the tree be after growth cycles? For example, if the number of growth cycles is n=5, the calculations are as … Read more