Hi, all in this post I will talk about an easy problem with Binary Search Tree and recuresion also. When we solve a recuresion problem we are talking about the Base Case. The condition which on it the recursion stops is called : Base Case .In our problem we are searching on the nodes for… Continue reading Leetcode: 700. Search in a Binary Search Tree
In this series of posts i will post about the tech talks that I learned from wich have a good concepts about software industry . I will post here frquentaly to be like a cataloge for the talks that i loved and learned from. The Do’s and Don’ts of Error Handling • Joe Armstrong •… Continue reading Tech Talks :
Hello , This time we will solve an interesting problem from leetcode.com . Our problem today is called License Key Formatting let’s start analyzing and solve the problem. problem explain: You are given a license key represented as a string S which consists only alphanumeric character and dashes. The string is separated into N+1 groups… Continue reading leetcode [482. License Key Formatting] problem
Hi writing again on my blog what a great feeling , wow. The problem [Foregone Solution] we have today from Google codejam 2019 [qualification round ] the problem is easy one let’s start . problem explain: Someone just won the Code Jam lottery, and we owe them N jam coins! However, when we tried to print out… Continue reading [-Foregone Solution-] Google code jam 2019 problem.
I decided to post not only about competitive programming , algorithms or about the problems I solve and the problem which I love and enjoy while solving it and love it’s idea but also i decide to post about seminars and Ted talks I watch and helps me to learn something and produce nice ideas.… Continue reading The talks & seminars winch changes my life and helps me in my journey #1
I am so happy to re post again in my blog and today. we would solve a problem from Facebook Hacker Cup 2018 (tourist problem): the problem of today is simple and easy I enjoyed solving it I hope you enjoy solving it too . Problem: The Facebook campus has N different attractions, numbered from 1 to N in… Continue reading Tourist [Facebook Hacker Cup 2018 Qualification Round]
happy new year for all of you , new year with new challenges i hope your wishes be true this year . soon i will post my new book list and new the plan for the blog. and i will post about my new challenge this year . . Mohand sakr, mail :mohandsakr69@gmail.com Twitter |… Continue reading Happy new year 2018
Hello again i missed writing on my blog and here i am back,wow. Today we will discuss a simple and great algorithm which called Sieve of Eratosthenes; the algorithm is used in check a number is prime or not . it’s work likes Sieve it Sieves the primes in a efficient way . First : what is prime… Continue reading Sieve of Eratosthenes [check primes]
hello , today i will start a series of skills that i learned in the last year. i learn it from working on n developing myself to get to my goal. I am on my way towards my goal but there are skills that i learned that changes my life I hope it help you… Continue reading The best skills I learn in the last year[1]
Hello , this week we will discuss and solve an interesting problem Snakes, Mongooses and the Ultimate Election from SnackDown 2017 semi final round By (CodeChef). problem explain: In Snakeland, there are some snakes and mongooses. They are lined up in a row. The information about how exactly they are lined up it is provided to you… Continue reading Week 3 problem [Snakes, Mongooses and the Ultimate Election] SnackDown 2017 semi finals problem.
Mohand sakr 