Python

Categories: Code Problem / Data Structures and Algorithms / Recursion (32) Code Problem / Data Structures and Algorithms / Binary Search (30) Code Problem / Data Structures and Algorithms / Linked Lists (26) Code Problem / Data Structures and Algorithms / Backtracking (26) Code Problem / Data Structures and Algorithms / Stacks and Queues (25) Code Problem / Data Structures and Algorithms / Hashing (24) Databases / SQL / Backup and Recovery (19) Code Problem / Data Structures and Algorithms / Arrays and Strings (19) Databases / SQL / Database Normalization (18) Code Problem / Data Structures and Algorithms / Time Complexity (17) Databases / SQL / Locking (16) Databases / SQL / Replication (15) Databases / SQL / SQL Queries (13) Code Problem / Data Structures and Algorithms / Graphs (13) Databases / SQL / Database Security (13)  More...

Recent solutions:

Check these solutions from our community:
Python / Data Structures DifficultyMedium Python
This technical problem involves creating a function that takes in a list of words and returns a dictionary with the words as the keys and the number of times the word appears in the list as the values .
About this solution: This solution is complete and solves the problem. The approach is straightforward and easy to follow.
Nov 10
Python / Modules and Packages DifficultyMedium Python
This Python function finds the largest number in a list of integers. For example, given the input list [1, 2, 3, 4, 5], the function would return 5.
About this solution: The candidate's solution correctly finds the largest number in the list. The candidate could have used the built-in max() function to find the largest number in the list.
Nov 09
Python / Data Structures DifficultyMedium Python
Given a list of integers, the largest difference between any two adjacent elements can be found by using a function. An example input would be [2, 4, 1, 16, 7, 5] and the corresponding output would be 15.
About this solution: This solution is correct and demonstrates a level of completeness. The approach is also optimal, as it only loops through the list once.
Nov 09
Python / Data Manipulation DifficultyMedium Python
This problem involves taking a list of integers and summing the absolute values of the integers. The example input is [1, -2, 3, -4] and the example output is 10.
About this solution: This is a great solution! It is both complete and solves the problem optimally.
Nov 09
Python / Machine Learning DifficultyMedium Python
This problem deals with detecting handwritten digits in images. The goal is to write a function that takes in an image of a handwritten digit and outputs the corresponding numerical digit.
About this solution: The candidate's solution demonstrates a level of completeness and solves the problem. The approach is to use a neural network, which is a good approach. The candidate provides details on how the neural network will be trained and how it will work. The candidate also mentions the advantages of using a neural network, such as the high accuracy and speed.
Nov 08
Python / Data Manipulation DifficultyMedium Python
This technical problem deals with finding the sum of the absolute values of a list of integers in Python. An example input is given, along with the expected output.
About this solution: This is a great solution! The candidate has correctly identified the built-in functions to use and has correctly identified the time complexity of the solution.
Nov 08
Computer Science / Python DifficultyMedium Python
This technical problem involves implementing a function that takes in a list of integers and prints out the sum of all the integers in the list. An example input would be [1, 2, 3 ] and the corresponding output would be 6.
About this solution: This solution is complete and solves the problem. The approach is straightforward and easy to follow.
Nov 08
Code Problem / Strings DifficultyMedium Python
This problem asks you to find the first character in a string that is not repeated elsewhere in the string. For example, given the string "abcdab", the answer would be "c ".
About this solution: The candidate's solution is correct and demonstrates a level of completeness. The candidate's approach is also optimal, as it iterates through the string only once to create the dictionary and then iterates through the string again to find the first character that is not repeated.
Nov 01