{"request":{"endpoint":"https://exercism.org/api/v2/tracks/typescript/exercises/binary-search/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"f15cd46cf1234698952bed4de6f896e8","snippet":"export function find(array: number[], find: number): number | never { let lower = 0; let upper = array.length - 1; while (lower <= upper) { const midpoint = Math.floor((lower + upper) / 2); const curr = array[midpoint]; if (curr === find) { ","num_views":0,"num_stars":6,"num_comments":0,"representation_num_published_solutions":11,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-11-12T15:09:32.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"jcsawyer123"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/jcsawyer123","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"3c971a9f349c48238f152119c8eedeb3","snippet":"export function find(haystack: number[], needle: number): number | never { let start = 0; let end = haystack.length - 1; while (start <= end) { const middle = Math.floor((start + end) / 2); if(haystack[middle] === needle) { return middle; } else if (haystack[middle] < needle) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":8,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-10-31T11:09:10.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"niksonax"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/niksonax","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"80080e0e99c74bd68bb3dd89cd77d157","snippet":"export function find(haystack: number[], needle: number): number | never { let low = 0; let high = haystack.length - 1; while (low <= high) { const mid = Math.floor((low + high) / 2); const mid_value = haystack[mid]; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-22T22:24:21.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"JoseFernando7"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/JoseFernando7","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"2efd19d061564fca857ea5b17874e64a","snippet":"export function find(haystack: number[], needle: number): number { let left = 0; let right = haystack.length - 1; while (left <= right) { const mid = Math.floor((left + right) / 2); if (haystack[mid] === needle) { return mid; } else if (haystack[mid] < needle) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-05-10T09:22:05.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"vijoytechy"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/vijoytechy","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"c0a7b394081b4118ab1f19d2140fb2cb","snippet":"export function find(haystack: number[], needle: number): number | never { let left = 0; let right = haystack.length - 1; while (left <= right) { const middle = Math.floor((left + right) / 2); if (haystack[middle] === needle) { return middle; } else if (haystack[middle] < needle) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":5,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-10-04T05:29:30.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"andreaqm0"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/andreaqm0","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"43f02cab8ea0481e8570d520599b9133","snippet":"export function find(haystack: number[], needle: number): number | never { let start = 0; let end = haystack.length - 1; while (start <= end) { let middle = Math.floor((start + end) / 2); if (haystack[middle] === needle) { return middle; } else if (haystack[middle] < needle) { start = middle + 1; } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":5,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-10-22T10:48:18.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"Chiyamii"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/Chiyamii","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"e25b90f6ec96483084d2a7e1a5458621","snippet":"export function find(haystack: number[], needle: number): number | never { let l = 0; let r = haystack.length - 1; while (l <= r) { const mid = Math.floor(l + (r - l) / 2); if (haystack[mid] === needle) return mid; if (haystack[mid] > needle) r = mid - 1; if (haystack[mid] < needle) l = mid + 1; } throw new Error('Value not in array'); ","num_views":0,"num_stars":4,"num_comments":0,"representation_num_published_solutions":5,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-11-13T15:12:38.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"CIS"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/CIS","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"7af014b6c5ce4f63aab082ad0f81e85c","snippet":"export function find(haystack: number[], needle: number): number | never { let left = 0; let right = haystack.length - 1; while (left <= right) { const mid = Math.floor((left + right) / 2); if (haystack[mid] === needle) { return mid; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-06T16:16:27.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"chowie"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/chowie","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"13bdf6f87da9437bb5c162033005a915","snippet":"export default class BinarySearch { public array: number[] constructor(list: number[]) { if(list.every((v, i) => v <= (list[i+1] || v))) { this.array = list } } indexOf(n: number) { ","num_views":0,"num_stars":3,"num_comments":2,"representation_num_published_solutions":4,"num_iterations":2,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"anurat"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/anurat","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"d30821bb26ed4c13bd821e3554b406e6","snippet":"export function find(haystack: T[], needle: T): number | never { let lo = 0 let hi = haystack.length - 1 let mid = hi >>> 1 while (lo <= hi) { if (haystack[mid] === needle) { return mid } else if (haystack[mid] < needle) { lo = mid + 1 ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":3,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-02-02T00:55:12.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"victorz"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/victorz","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"36c6b5dcbc174eaabc719800aeaaea7c","snippet":"export function find(haystack: number[], needle: number): number | never { let l = 0; let r = haystack.length - 1; while (l <= r) { let middle = Math.floor((l+r)/2); if (haystack[middle] === needle) { return middle; } if (haystack[middle] < needle) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-29T15:40:10.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"bronzecobra"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/bronzecobra","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"93a6b53188f0479c95ec65f2c36ec1d4","snippet":"export function find(haystack: number[], needle: number): number { let middle = 0 let left = 0 let right = haystack.length - 1 while (left <= right){ middle = Math.round((left + right) / 2) if (haystack[middle] == needle){ return middle } if (haystack[middle] < needle){ ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-06-01T12:02:59.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"MMarnerou"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/MMarnerou","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"bdabf97c830d4d20a5b178642786e0ce","snippet":"export function find(haystack: number[], needle: number): number | never { const i = haystack.indexOf(needle) if (i === -1) throw new Error('Value not in array') return i } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":6,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-11-02T15:16:50.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"Sean-Sophearom"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/Sean-Sophearom","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"8a71be0f81524f8681c613b1beab4b71","snippet":"export function find(haystack: number[], needle: number): number | never { const binarySearch = haystack.findIndex(item => item === needle); if(binarySearch === -1) { throw 'Value not in array' } return binarySearch } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-11-26T14:15:46.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"SanderVanRiessen"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/SanderVanRiessen","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"0889311cd059428c817cff79c218e31d","snippet":"export function find(haystack: number[], needle: number): number | never { if (haystack.length === 0) { throw new Error('Value not in array') } const middle = Math.floor(haystack.length / 2) if (haystack[middle] === needle) { return middle } else if (haystack[middle] > needle) { return find(haystack.slice(0, middle), needle) } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-07T16:57:11.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"spras"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/spras","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"b734ab91518b4532b3830fcdea097406","snippet":"export function find(haystack: number[], needle: number): number | never { let left = 0; let right = haystack.length - 1; while(left <= right) { const mid = Math.floor((left + right) / 2); if (haystack[mid] === needle) { return mid; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-08T12:43:13.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"cagataysadic"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/cagataysadic","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"04557398a7db487a96e7201d63f6771a","snippet":"export function find(haystack: number[], needle: number): number | never { let i = 0; let j = haystack.length - 1; while (i <= j) { const mid = Math.floor((i + j) / 2); if (haystack[mid] === needle) return mid; if (haystack[mid] < needle) i = mid + 1; if (haystack[mid] > needle) j = mid - 1; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-08T18:55:27.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"Y6OP61AMJ0"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/Y6OP61AMJ0","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"c76bffaa48a54d75b148d1aa4e880e64","snippet":"export function find(haystack: number[], needle: number): number { let left = 0; let right = haystack.length - 1; while (left <= right) { let mid = Math.floor((left + right) / 2); if (haystack[mid] === needle) { return mid; } else if (haystack[mid] < needle) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-22T11:31:38.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"bricard-dev"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/bricard-dev","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"270908097f52406ea68d4ee16e68a249","snippet":"function find_recursive(search_list: number[], value: number, left: number, right:number): number | never { let mid = left + ~~((right - left) / 2) let look = search_list[mid] if (search_list[mid] == value) return mid if (left == right) throw new Error('Value not in array') if (value < look) return find_recursive(search_list, value, left, mid - 1) return find_recursive(search_list, value, mid + 1, right) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":4,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-05-17T11:30:22.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"bobahop"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/bobahop","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"0712c2545fed4412852fbc5106e95c24","snippet":"export function find(haystack: number[], needle: number): number | never { let fst = 0; let lst = haystack.length - 1; while (fst <= lst) { let mid = Math.floor((fst + lst)/2); if (haystack[mid] === needle) return mid; else if (haystack[mid] < needle) fst = mid+1; else lst = mid-1; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-05T14:38:15.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"bongende"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/bongende","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"aac70f0d54a941bfa972dcc46f8c2e99","snippet":"export function find(nums: number[], target: number): number { let left: number = 0; let right: number = nums.length - 1; while (left <= right) { const mid: number = Math.floor((left + right) / 2); if (nums[mid] === target) return mid; if (target < nums[mid]) right = mid - 1; else left = mid + 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-07T16:16:51.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"kuroski"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/kuroski","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"04367e92c4354fcea9b8a1d7559b7ef4","snippet":"export function find(haystack: number[], needle: number): number | never { let left = 0, right = haystack.length; while (left <= right) { let mid = left + Math.floor((right - left) / 2); if (haystack[mid] === needle) { return mid; } else if (haystack[mid] < needle) { left = mid + 1; } else { right = mid - 1; } } throw new Error('Value not in array'); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-26T05:48:08.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"dynamo-patch"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/dynamo-patch","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"3ae9776313274f938c0728fc2062f8d0","snippet":"export function find(haystack: number[], needle: number): number | never { const result = haystack.findIndex((num) => num === needle); if (result === -1) { throw new Error('Value not in array'); } return result; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-08-20T09:45:47.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"yuki82321"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/yuki82321","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}},{"uuid":"7e9bd39701b34158b5ea14cb35922c9d","snippet":"export function find(haystack: number[], needle: number): number | never { let start = 0; let end = haystack.length - 1; while (start <= end) { let midIndex = Math.floor((start + end) / 2); if (haystack[midIndex] === needle) { return midIndex; } else if (haystack[midIndex] > needle) { end = midIndex - 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-15T23:50:36.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"saltwotter"},"exercise":{"title":"البحث الثنائي","icon_url":"https://assets.exercism.org/exercises/binary-search.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/solutions/saltwotter","private_iterations_url":"https://exercism.org/ar/tracks/typescript/exercises/binary-search/iterations"}}],"meta":{"current_page":1,"total_count":781,"total_pages":33,"unscoped_total":781}}}}}

مسارات اللغات

تعلّم البرمجة مع Jiki

رحلتك

مفضلاتكجديد

مزايا Exercism

فيديوهات المجتمع

سلسلة المقدمات الموجزة

مقابلات وقصص

Discord

المنتدى

البدء

الإرشاد

الوثائق

المساهمون

المترجمونجديد

تبرّع

عن Exercism

أثرنا

مزامن GitHubجديد

Insiders