<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Morgan Stanley on Dinçer Bakkal</title>
    <link>https://www.dincerbakkal.com/tags/morgan-stanley/</link>
    <description>Recent content in Morgan Stanley on Dinçer Bakkal</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-US</language>
    <copyright>This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.</copyright>
    <lastBuildDate>Sun, 11 Jul 2021 19:12:05 +0300</lastBuildDate><atom:link href="https://www.dincerbakkal.com/tags/morgan-stanley/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Leetcode 33 Search in Rotated Sorted Array</title>
      <link>https://www.dincerbakkal.com/posts/leetcode033/</link>
      <pubDate>Sun, 11 Jul 2021 19:12:05 +0300</pubDate>
      
      <guid>https://www.dincerbakkal.com/posts/leetcode033/</guid>
      <description>Soru There is an integer array nums sorted in ascending order (with distinct values).
Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 &amp;lt;= k &amp;lt; nums.length) such that the resulting array is [nums[k], nums[k+1], &amp;hellip;, nums[n-1], nums[0], nums[1], &amp;hellip;, nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 and become [4,5,6,7,0,1,2].
Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.</description>
    </item>
    
  </channel>
</rss>
