Loading…

Implement an algorithm to print all valid

Given an input file with four billion non-negative integers

You have 20 bottles of pills

Write a function that adds two numbers

A magic index in an array A[1… n-1]

A magic index in an array A[1… n-1]

Implement an algorithm to determine

There’s a staircase

You have to get from point A to point B

Given a list of millions of words, design an algorithm

Design an evacuation plan of San Francisco residents

The task of the cashier-developer

Create a lock class to prevent deadlock

Create a method that counts a number

The Probability of Meeting a Car on a Deserted Highway

Finding the maximum of two numbers

The task of calendar gaps merging

The task of calendar gaps merging

The task of the ball with helium in the car

The task of Apple shares

In the darkroom, you are handed a deck of cards.

How far can you deliver cargo using N trucks?

In what situation you will get less wet getting to the car

You are given three boxes

You are given three boxes

You are given three boxes and you need to define which one contains the prize

Can you explain the code ((n & (n – 1)) == 0)

A logical task about the height of an egg crash

A logical task on placing the dices on a chessboard

What errors can cause a C application crash

Piece of cheese in the shape of a cube and a knife.

Piece of cheese in the shape of a cube and a knife.

You are given a piece of cheese in the shape of a cube and a knife.

Find errors in the following code block

10 thousand servers in the data centre with remote control.

You manage 10 thousand servers in the data centre with remote control.

You have an analogue clock with a second hand.

How many golf balls will be heard into the school bus?

How to determine duplicate URLs?

A task for cryptography basics with a detailed analysis

The task of the country with boys and girls

What errors can cause a C application crash

How to use a bent coin

The meaning of volatile in C

Pure virtual function call

A classic task from interviews at Google

Task on list copying

Task on list copying

Bubble Sort, JavaScript

Gnome Sort, JavaScript

115 tasks from IT interviews

Isotope

Website adaptive layout

Learning algorithms and data structures properly

Regular expressions for beginners

Who may become a programmer?

How to Become a Developer From Scratch

Want to know everything: Dart

Functional programming

Web-seminars and webinars

Pitfalls of pair programming

Front-end developer vs HTML developer

Who is a web advertiser and how to become one?

Who is a web advertiser and how to become one?

What do actually web developers do?

Lua in 60 minutes

Website hacking

Portable website for a web developer

The benefits of pair programming

Benefits and drawbacks of online learning

14 advantages and disadvantages of online learning

Interfaces

Position : mobile app developer

String conversion in Python

6 good languages to start programming

Learning algorithms and data structures properly

What are PHP prospects and whether to use it

Algorithms and data structure in Java

Configuration file htaccess

How to create and break Java loop

10 universal rules for mobile application design

How did I extensively simplify the interaction with Raspberry Pi?

PHP8

How to become a programmer from scratch

Hacking a website and its results

Read PEP 8 and write code as Guido van Rossum does

Popular IDEs and their disadvantages

21 free hosting services for your website

Want to know everything. Solidity

Creating a Telegram bot on Python

Adaptive markup: learning or immediately into battle?

What is a front-end?

MVC: what is it and how it relates to the user interface

Practical application of JavaScript

Who can become a programmer?

Models or types

Adaptive markup: learning or immediately into battle?

What is the obfuscation of methods’ algorithms

Hibernate for beginners

Creating first application on React Native

Artificial intelligence is not what it seems.

UX vs UI: what is the difference

Zeplin.io – interaction service for designers and developers

The best TV series for IT geeks

8 series about IT and Virtual Reality

9 applications for learning programming

Programming tasks. Where to warm up?

Ada Lovelace

TOP-10 development frameworks for Java

Learn programming from scratch at home

Want to know everything. Solidity

How to build an effective mobile app design

TOP 10 Home Use Linux Distros

6 Series About Programmers

Books about programming: how and what to read

Java programming courses for beginners

How to master programming from scratch

Programming self-study: games and applications

What is a front-end?

11 applications to learn programming on mobile devices

Top 10 TV series for IT geeks

Software development methodologies

60 movies about IT and programming

Java Web frameworks

Figma: application overview for web design

Want to know everything. Go language

Pygame and game development

Quick start with Java: from the setup to the first application

How, where and why to learn Solidity?

Facts About Web Design

Ada Lovelace – the first developer in the world

5 Programming Languages ​​to Learn First

9 reasons to change Windows 10 for Linux

7 free resources for studying programming online

5 JavaScript code editors

Web Design From Scratch: how to get started for beginners

What PHP framework to choose for website development?

What is OOP?

The Best Linux Distros 2019

25 most popular myths about programming and developers

Learning to create Python multi-threaded and multi-process

Top 10 films and TV series on IT topics

A selection of good books for programmers

What programming language to learn in 2019?

Implement an algorithm to print all valid

  Our first thought here might be to apply a recursive approach where we build the solution for f(n) by adding pairs of parentheses to f (n-1). That’s certainly a good instinct.   Let’s consider the solution for n = 3: (()()) ((())) ()(()) How might we build this from n = 2? (()) ()()…

Given an input file with four billion non-negative integers

  FOLLOW UP: What if you have only 1 O MB of memory? Assume that all the values are distinct and we now have no more than one billion non-negative integers.   There are a total of 232, or 4 billion, distinct integers possible and 231 non-negative integers. Therefore, we know the input file (assuming…

You have 20 bottles of pills

    Sometimes, tricky constraints can be a clue. This is the case with the constraint that we can only use the scale once.   Because we can only use the scale once, we know something interesting: we must weigh multiple pills at the same time. In fact, we know we must weigh pills from…

Write a function that adds two numbers

    Our first instinct in problems like these should be that we’re going to have to work with bits. Why? Because when you take away the+ sign, what other choice do we have? Plus, that’s how computers do it!   Our next thought should be to deeply understand how addition works. We can walk…

A magic index in an array A[1… n-1]

Immediately, the brute force solution should jump to mind and there’s no shame in mentioning it. We simply iterate through the array, looking for an element which matches this condition.   int magicSlow(int[] array) { for (int i= 0; i < array.length; i++) { if (array[i] == i) { return i; } } return -1;…