Home
Jobs

Python Coding Practice

Welcome to Python Coding Practice. Python is a versatile and beginner-friendly programming language widely used in various domains such as web development, data science, machine learning, and more. If you're preparing for coding interviews or simply looking to sharpen your skills, you've come to the right place.

Coding Questions Filter

icon
icon
icon

Valid Palindrome with Special Characters

Easy Strings

First Unique Character in String

Easy Strings

Basic String Compression

Easy Strings

Pairs of Prime Numbers

Easy Mathematics

Sum of Prime Numbers

Easy Searching Algorithms, Mathematics

Sieve of Eratosthenes

Easy Searching Algorithms, Mathematics

Prime Number

Easy Searching Algorithms, Mathematics

Minimum Distance in an Array

Easy Arrays

Remove Duplicates from Sorted Array

Medium Arrays

Product Array Puzzle

Easy Arrays, Mathematics

Maximum Sub Array of Non-Negative Numbers

Medium Arrays, Dynamic Programming

Maximum Index

Medium Arrays

Print Linked List

Easy Linked Lists

Remove every k'th node

Easy Linked Lists

Delete N nodes after M nodes of a linked list

Easy Linked Lists

Sort a linked list of 0s, 1s and 2s

Easy Linked Lists

Inorder Traversal

Easy Trees, Recursion

Preorder Traversal

Easy Trees

Level Order Traversal

Easy Trees

Postorder Traversal

Easy Trees

Print Adjacency List

Easy Graphs

BFS of Graph

Easy Graphs

DFS of Graph

Easy Graphs

Bipartite Graph

Medium Graphs

Transitive Closure of a Graph

Medium Graphs, Dynamic Programming

Rat Maze With Multiple Jumps

Medium Backtracking

Coins and Game

Medium Backtracking

Hamiltonian Path

Medium Graphs, Backtracking

Check if Array is Sorted

Easy Arrays, Sorting Algorithms

Binary Array Sorting

Easy Arrays, Sorting Algorithms

String Rotation Check

Easy Strings

Find Target Sum Pairs

Easy Arrays

Find All Factors

Easy Mathematics

Reverse Words in String

Easy Strings

Move Zeros to End

Easy Arrays

Longest Subarray with Difference One

Medium Arrays

Wildcard Pattern Matching

Medium Strings

Find Twin Primes

Medium Mathematics

Generate Valid Parentheses

Medium Mathematics

Valid Rectangle from Points

Medium Mathematics

Expected Maximum Dice Roll

Medium Mathematics

Different Position Combinations

Medium Mathematics

Next Greater Element

Medium Arrays

Sliding Window Maximum

Medium Arrays

Array Increment Operations

Medium Arrays

Sort Array By Parity Maintaining Order

Easy Arrays

Balanced Binary Tree

Easy Trees

Path Exists in Graph

Easy Graphs

Case-Insensitive Stable Sort

Easy Sorting Algorithms

Decimal to Roman Numeral

Easy Mathematics

Generate Valid Parentheses

Easy Recursion

Powers of Two Sum

Easy Bit Manipulation

Find Number Range

Easy Searching Algorithms

Minimum Coins Required

Easy Dynamic Programming

Sum of Left Leaves

Easy Trees

Count Groups of Anagram Substrings

Medium Strings

Phone Number Letter Combinations

Easy Backtracking

Two Sum Sorted Array

Easy Arrays

Sliding Window Average

Easy Arrays

Matrix Transpose In-Place

Easy Arrays

Meeting Room Counter

Easy

Find Longest Repeating Pattern

Easy

Find Next Number in Sequence

Easy Mathematics

Tic-Tac-Toe Game Status

Easy

Sort Log Files

Easy Sorting Algorithms

Sum of Subarray Minimums with Fixed Size

Medium Arrays

Count Limited Range Subsequences

Hard Arrays

Split Array Equal Average

Easy Arrays

Maximum Circular Subarray Sum

Easy Arrays

Longest Smooth Subarray

Hard Arrays

Minimum Arithmetic Sequence Partition

Hard Arrays

Count Special Subarrays

Medium Arrays

Format Nested Braces

Easy Strings

Selective String Compression

Medium Strings

Count Unique Rearrangeable Substrings

Hard Strings

Normalize File Path

Easy Strings

Find All Pattern Rotations

Medium Strings

Count Valid String Encodings

Hard Strings

Partition List By Parity

Easy Linked Lists

Generate Number Triangle

Easy Recursion

Count Valid Array Partitions

Medium Recursion

Generate Target Expressions

Hard Recursion

Phone Keypad Letter Combinations

Easy Backtracking

Generate K Pairs of Parentheses

Easy Backtracking

Number String Partitioning

Easy Backtracking

Text Justification All Ways

Medium Backtracking

Minimize Maximum Subarray Partitions

Hard Backtracking

Digital Root Using Bits

Easy Bit Manipulation

Count Distinct XOR Combinations

Medium Bit Manipulation

Minimize Array Maximum with Bit Operations

Hard Bit Manipulation

Binary Sequences Without Consecutive Ones

Easy Bit Manipulation

Maximum XOR Sum Subarray

Medium Bit Manipulation

Longest Equal Subarray After Bit Flips

Hard Bit Manipulation

Count Factor Pairs

Easy Mathematics

Consecutive Integer Sum Representations

Medium Mathematics

Jump Game Search

Easy Searching Algorithms

Kth Missing Positive Number

Medium Searching Algorithms

Longest Alternating Path Search

Hard Searching Algorithms

Sort by Vowel Count

Easy Sorting Algorithms

Sort by Bit Count

Medium Sorting Algorithms

Maximum Flight Time Scheduler

Hard Sorting Algorithms

Explore More

C

https://images.assets.stark.ai/image/c.svg

Java

https://images.assets.stark.ai/image/java.svg

JavaScript

https://images.assets.stark.ai/image/javascript.svg

Ruby

https://images.assets.stark.ai/image/ruby.png

Rust

https://images.assets.stark.ai/image/rust.svg

Go Lang

https://images.assets.stark.ai/image/go.svg

Lua

https://images.assets.stark.ai/image/lua.png

What You'll Find Here

Interactive Exercises Practice coding with problems designed for beginners and experts.

Step-by-Step Solutions Understand every step of the solution process.

Real-World Scenarios Apply your skills to real-world problems and boost your confidence.

Choose from the following categories

Strings A sequence of characters used to represent text, with problems focused on manipulation, searching, and pattern matching.

Arrays A collection of elements stored in contiguous memory locations, allowing efficient random access and manipulation.

Linked Lists A linear data structure where each element (node) points to the next, offering dynamic memory allocation and efficient insertions/deletions.

Trees A hierarchical data structure with nodes connected by edges, used in applications like databases, file systems, and parsing.

Graphs A collection of nodes (vertices) connected by edges, representing relationships, widely used in networking, routing, and social networks.

Dynamic Programming An optimization technique that solves problems by breaking them into overlapping subproblems and storing their results.

Backtracking A problem-solving method that explores all possibilities recursively, backtracking when a solution is not feasible.

Sorting Algorithms Techniques for arranging elements in a specific order, such as quicksort, mergesort, and bubble sort, essential for data organization.

Searching Algorithms Methods for finding elements in a dataset, such as binary search, linear search, and graph traversal techniques.

Mathematics A field of study involving numbers, calculations, and logical reasoning, forming the foundation for algorithms and problem-solving.

Recursion A programming technique where a function calls itself to solve smaller instances of the same problem, often used in divide-and-conquer approaches.

Bit Manipulation Operations performed directly on binary representations of data, used for efficient computations and optimization tasks.