## Search found 107 matches

Tue Feb 19, 2019 5:48 am
Forum: Chess
Topic: Some notable online games
Replies: 3
Views: 250

### Re: Some notable online games

https://www.chess.com/live/game/3471416832

A different type of smothered mate
Thu Feb 14, 2019 11:02 pm
Forum: Programming
Topic: Generating Solr Queries
Replies: 0
Views: 9

### Generating Solr Queries

an interesting problem that I came across while working with n11 was this: Some users search by substituting umlaut letters for their plain versions. E.g. instead of "önlük" they will search for "onluk" or "onlük" or even "önluk" or any other combination. Since the titles of the products only (usual...
Tue Feb 12, 2019 6:35 am
Forum: Chess
Topic: Some notable online games
Replies: 3
Views: 250

### Re: Some notable online games

https://www.chess.com/live/game/3452592383

A game where I lost no pawns (queen was promoted from a pawn)
Tue Feb 12, 2019 5:01 am
Forum: Programming
Topic: Leetcode 77. Combinations
Replies: 0
Views: 15

### Leetcode 77. Combinations

Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. Input: n = 4, k = 2 Output: [ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ] image_1548886059.png (this image was made by someone on the leetcode discussion forums) class Solution { public List<List<Integer>> com...
Mon Feb 11, 2019 11:07 pm
Forum: Programming
Topic: Leetcode 52. N - Queens problem
Replies: 0
Views: 7

### Leetcode 52. N - Queens problem

The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. 8-queens.png Given an integer n, return the number of distinct solutions to the n-queens puzzle. This is a classical backtracking exhaustive search problem. There no shortcuts, you...
Mon Feb 04, 2019 11:56 pm
Forum: Programming
Topic: Leetcode 34. First and last position of element in sorted array
Replies: 0
Views: 14

### Leetcode 34. First and last position of element in sorted array

Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the order of O(log n). If the target is not found in the array, return [-1, -1]. Example 1: Input: nums = [5,7,7,8,8,10], target =...
Tue Jan 29, 2019 7:31 am
Forum: Programming
Topic: Leetcode 9. Palindrome number
Replies: 0
Views: 14

### Leetcode 9. Palindrome number

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Input: 121 Output: true Input: -121 Output: false Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome. Input: 10 Outp...
Thu Jan 24, 2019 2:41 pm
Forum: Programming
Topic: Leetcode 516. Longest palindromic subsequence
Replies: 0
Views: 20

### Leetcode 516. Longest palindromic subsequence

Given a string s, find the longest palindromic subsequences length in s. You may assume that the maximum length of s is 1000. I despise these types of questions. Who likes dynamic programming anyways? So the approach is the following: Observation 1. each 1 character subsequence is a palindrome. Tra...
Fri Jan 18, 2019 8:56 am
Forum: Programming
Topic: Leetcode 393. UTF-8 Validation
Replies: 0
Views: 40

### Leetcode 393. UTF-8 Validation

Bit magic question, highly unlikely but one of my friends did get this question at a tech screen with google. A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules: For 1-byte character, the first bit is a 0, followed by its unicode code. For n-bytes character, the firs...
Wed Jan 16, 2019 8:52 am
Forum: Programming
Topic: Leetcode 35. Search insert position
Replies: 0
Views: 42

### Leetcode 35. Search insert position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array. Whenever you see "sorted array" think binary search. This is a typical binary search problem with an ...