Geeky Codes | AI Engineering, Data Engineering & Machine Learning Tutorials
Explore the fascinating world of algorithms! From sorting and searching to advanced AI techniques, discover how algorithms solve problems, power technology, and transform industries. Perfect for beginners and pros alike.
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
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
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
Introduction: In binary trees, exploring their structure and nodes in a systematic manner is crucial for various operations and analyses. One such traversal method is the level order traversal, which traverses the tree level by level, starting from the root node. Through this tutorial, we’ll delve into the intricacies of level order traversal and learn … 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: In the realm of algorithmic problem-solving, the quest for the maximum sum of any contiguous subarray within a given array is a classic challenge. In this tutorial, we’ll embark on a journey to conquer this challenge using Kadane’s algorithm, a powerful tool that operates with a time complexity of O(N). Problem Statement: Given an … Read more
Introduction: Dynamic Programming (DP) is a powerful algorithmic technique used to solve a variety of optimization problems. One classic problem where DP shines is in finding the longest palindromic subsequence in a given string. In this tutorial, we’ll delve into the intricacies of this problem and learn how to tackle it using DP. Problem Statement: … Read more
You are given a string ‘S’. Your task is to check whether the string is palindrome or not. For checking palindrome, consider alphabets and numbers only and ignore the symbols and whitespaces. Note : Example : Input format : Output format : Note : Follow Up : Constraints : Implementation in Python
When a contiguous block of text is selected in a PDF viewer, the selection is highlighted with a blue rectangle. In this PDF viewer, each word is highlighted independently. For example: There is a list of 26 character heights aligned by index to their letters. For example, ‘a’ is at index 0 and ‘z’ is at index 25. There will … Read more
Given a string s of lowercase alphabets and a number k, the task is to print the minimum value of the string after removal of k characters. The value of a string is defined as the sum of squares of the count of each distinct character present in the string. Example 1: Input: s = abccc, k = 1Output: 6Explaination:We … Read more
Problem Overview Given an array of integers, our task is to find the longest subarray such that the absolute difference between any two elements is less than or equal to 1. Example a=[1,1,2,2,4,4,5,5,5] There are two subarrays meeting the criterion: [1,1,2,2] and [4,4,5,5,5]. The maximum length subarray has 5 elements. Function Description Complete the pickingNumbers function in the editor below. pickingNumbers has … Read more
You are in charge of the cake for a child’s birthday. You have decided the cake will have one candle for each year of their total age. They will only be able to blow out the tallest of the candles. Count how many candles are tallest. Example candles=[4,4,1,3] The maximum height candles are 4 units high. … Read more