Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Algebra

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Excel

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

DSA / Placements

DA / Data Science & AI

Development

DevOps Course

All Courses

Courses

ML & Data Science

CS Subjects

Software and Tools

School Learning

Tutorials

Interview Corner

Practice DSA

GfG 160

Interview Prep

For more details, please go through - <a href="https://www.geeksforgeeks.org/dsa/write-a-c-program-to-print-all-permutations-of-a-given-string/">Permutations of given String</a>

Printing all Permutations.

Input: str = “PAYPALISHIRING”, N = 3 Output: PAHNAPLSIIGYIRInput: str = “ABCDEFGH”, N = 2 Output: ACEGBDFH Explanation: The input string can be written in Zig-Zag fashion in 2 rows as follows: A &nbsp; C &nbsp; &nbsp;E &nbsp; G &nbsp; &nbsp; &nbsp; B &nbsp; D &nbsp; F &nbsp; H Hence, upon reading the above pattern row-wise, the output string is “ACEGBDFH”Print Concatenation of Zig-Zag String in ‘n’ Rows : <a href="https://www.geeksforgeeks.org/concatenation-of-zig-zag-string-in-n-rows/">https://www.geeksforgeeks.org/concatenation-of-zig-zag-string-in-n-rows/</a>

Print Concatenation of Zig-Zag String in ‘n’ Rows

One obvious approach to solve this problem would be to sort the input string and then traverse through the sorted string to find the character which is occurring maximum number of times. Let us see if we can improve on this. So we will use a technique called ‘Hashing’. In this, when we traverse through the string, we would hash each character into an array of ASCII characters.&nbsp; &nbsp;Input string = “test” 1: Construct character count array from the input string. &nbsp;count['e'] = 1 &nbsp;count['s'] = 1 &nbsp;count['t'] = 22: Return the index of maximum value in count array (returns ‘t’).Return maximum occurring character in an input string: <a href="https://www.geeksforgeeks.org/return-maximum-occurring-character-in-the-input-string/">https://www.geeksforgeeks.org/return-maximum-occurring-character-in-the-input-string/</a>

Return maximum occurring character in an input string

A permutation also called an “arrangement number” or “order,” is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. A string of length n has n! permutation.O(n*n!) Note that there are n! permutations and it requires O(n) time to print a permutation.Write a program to print all permutations of a given string: <a href="https://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string/">https://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string/</a>

Write a program to print all permutations of a given string

Given two strings where first string may contain wild card characters and second string is a normal string. Write a function that returns true if the two strings match. The following are allowed wild card characters in first string.* --&gt; Matches with 0 or more instances of any character or set of characters. ? --&gt; Matches with any one character. For example, “g*ks” matches with “geeks” match. And string “ge?ks*” matches with “geeksforgeeks” (note ‘*’ at the end of first string). But “g*k” doesn’t match with “gee” as character ‘k’ is not present in second string.String matching where one string contains wildcard characters: <a href="https://www.geeksforgeeks.org/wildcard-character-matching/">https://www.geeksforgeeks.org/wildcard-character-matching/</a>

String matching where one string contains wildcard characters

Given three strings A, B and C. Write a function that checks whether C is an interleaving of A and B. C is said to be interleaving A and B, if it contains all and only characters of A and B and order of all characters in individual strings is preserved.Example:Input: strings: "XXXXZY", "XXY", "XXZ" Output: XXXXZY is interleaved of XXY and XXZ The string XXXXZY can be made by&nbsp; interleaving XXY and XXZ String: &nbsp; &nbsp;XXXXZY String 1: &nbsp; &nbsp;XX Y String 2: &nbsp;XX &nbsp;Z Check whether a given string is an interleaving of two other given strings: <a href="https://www.geeksforgeeks.org/find-if-a-string-is-interleaved-of-two-other-strings-dp-33/">https://www.geeksforgeeks.org/find-if-a-string-is-interleaved-of-two-other-strings-dp-33/</a>

Check whether a given string is an interleaving of two other given strings

Given two strings in lowercase, the task is to make them anagram. The only allowed operation is to remove a character from any string. Find minimum number of characters to be deleted to make both the strings anagram?&nbsp; If two strings contains same data set in any order then strings are called Anagrams.Examples : &nbsp;Input : str1 = "bcadeh" str2 = "hea" Output: 3 We need to remove b, c and d from str1.Remove minimum number of characters so that two strings become anagram: <a href="https://www.geeksforgeeks.org/remove-minimum-number-characters-two-strings-become-anagram/">https://www.geeksforgeeks.org/remove-minimum-number-characters-two-strings-become-anagram/</a>

Remove minimum number of characters so that two strings become anagram

We are given a string. We are also given indexes of first and last characters in string. The task is to reverse the string without using any extra variable.Examples:Input &nbsp;: str = "abc" Output : str = "cba"Input : &nbsp;str = "GeeksforGeeks" Output : str = "skeeGrofskeeG"Reverse string without using any temporary variable: <a href="https://www.geeksforgeeks.org/reverse-string-without-using-any-temporary-variable/">https://www.geeksforgeeks.org/reverse-string-without-using-any-temporary-variable/</a>

Reverse string without using any temporary variable

In this video, we will see the Java Program to Check if Strings are Rotations of each other or not.&nbsp; Strings are defined as an array of characters. The difference between a character array and a string is the string is terminated with a special character ‘\0’.&nbsp; Rules for String Rotations:&nbsp; Rule 1: Number of characters in both the strings must be equal.&nbsp; Rule 2: All characters must be the same.&nbsp; Rule 3: Rotated around one of the characters. i.e str2 must be a substring of the str1 concatenated with str1.&nbsp; Algorithm:&nbsp; 1. First we create a temp string and store the concatenation of str1 to str1 in the temp string.i.e temp = str1.str1&nbsp; 2. If str2 is a substring of temp then str1 and str2 are rotations of each other.&nbsp; Example:&nbsp; str1 = "abcd"&nbsp; str2 = "efgh"&nbsp; temp = str1.str1 = "abcdabcd"&nbsp; str2 = bcda&nbsp; Output: Yes Since str2 is a substring of temp, str1 and str2 are rotations of each other.&nbsp; Here we use the string Concat method to check if Strings are Rotations of each other or not. Java Program to Check if strings are rotation of each other or not: <a href="https://www.geeksforgeeks.org/java-program-to-check-if-strings-are-rotations-of-each-other-or-not/">https://www.geeksforgeeks.org/java-program-to-check-if-strings-are-rotations-of-each-other-or-not/</a>

Java Program to Check if Strings are Rotations of each other or not

Python string library does’nt support the in-built “reverse()” as done by other python containers like list, hence knowing other methods to reverse string can prove to be useful. This article discusses several ways to achieve it.&nbsp; Explanation : In above code, we call a function to reverse a string, which iterates to every element and intelligently join each character in the beginning so as to obtain the reversed string.Time complexity : O(n)&nbsp; Auxiliary Space : O(1)Reverse string in Python : <a href="https://www.geeksforgeeks.org/reverse-string-python-5-different-ways/">https://www.geeksforgeeks.org/reverse-string-python-5-different-ways/</a>&nbsp;

Reverse string in Python

Welcome to the daily solving of our PROBLEM OF THE DAY with Geetesh Yadav We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of String but also build up problem-solving skills. Given two strings s1 and s2. Return a minimum number of times s1 has to be repeated such that s2 is a substring of it. If s2 can never be a substring then return -1.Note: Both the strings contain only lowercase letters.Examples:Input: s1 = "ww", s2 = "www"
Output: 2
Explanation: Repeating s1 two times (wwww), s2 is a substring of it. &nbsp;Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://www.geeksforgeeks.org/problems/minimum-times-a-has-to-be-repeated-such-that-b-is-a-substring-of-it--170645/0">https://www.geeksforgeeks.org/problems/minimum-times-a-has-to-be-repeated-such-that-b-is-a-substring-of-it--170645/0</a>

PROBLEM OF THE DAY : 08/11/2024 | Minimum Repeat to Make Substring

Welcome to the daily solving of our PROBLEM OF THE DAY with Ayush Tripathi We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of String but also build up problem-solving skills. A string&nbsp;str&nbsp;is given to represent a positive number. The task is to round str to the nearest multiple of 10.&nbsp; If you have two multiples equally apart from str, choose the smallest element among them.Examples: &nbsp;Input: str = 29&nbsp; Output: 30 Explanation: Close multiples are 20 and 30, and 30 is the nearest to 29.&nbsp; &nbsp;Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/nearest-multiple-of-102437/1">https://practice.geeksforgeeks.org/problems/nearest-multiple-of-102437/1</a>

PROBLEM OF THE DAY : 19/10/2024 | Nearest multiple of 10